(2008) A deniable authenticated key agreement protocol. Das, Debayan; Sen, Shreyas. 692.5 323.4 569.4 323.4 569.4 323.4 323.4 569.4 631 507.9 631 507.9 354.2 569.4 631 endobj (2010) Full and partial deniability for authentication schemes. Chosen-Ciphertext Security via Correlated Products. 777.8 777.8 1000 1000 777.8 777.8 1000 777.8] Efficient Completely Non-Malleable and RKA Secure Public Key Encryptions. 820.5 796.1 695.6 816.7 847.5 605.6 544.6 625.8 612.8 987.8 713.3 668.3 724.7 666.7 2020. Link : Complete Notes. Theory of Cryptography, 529-555. 2007. (2016) Public-key encryption indistinguishable under plaintext-checkable attacks. Advances in Cryptology - ASIACRYPT 2013, 316-336. /Length 4096 (2019) Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes. Link – Unit 1 Notes. Lower Bounds for Non-interactive Zero-Knowledge. 2004. Advances in Cryptology – EUROCRYPT 2008, 415-432. Advances in Cryptology – CRYPTO 2005, 309-326. (2017) How to explain modern security concepts to your children. Provable Security, 3-18. Adaptive Trapdoor Functions and Chosen-Ciphertext Security. 833 556 500 556 556 444 389 333 556 500 722 500 500 444 394 220 394 520 0 0 0 333 Cryptography in Constant Parallel Time, 147-185. 2012. Lattice-Based Cryptosystems, 23-49. >> Advances in Cryptology – ASIACRYPT 2009, 303-318. 2009. Security in Communication Networks, 180-192. Advances in Cryptology – CRYPTO 2008, 108-125. 722 722 722 722 722 611 556 500 500 500 500 500 500 722 444 444 444 444 444 278 278 IND-CCA Secure Cryptography Based on a Variant of the LPN Problem. On Adaptively Secure Protocols. 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 826.4 295.1 826.4 531.3 826.4 2004. New Blockcipher Modes of Operation with Beyond the Birthday Bound Security. /BaseFont/RZOTDC+CMSY6 (2009) New Approaches for Deniable Authentication. Efficient Secure Group Signatures with Dynamic Joins and Keeping Anonymity Against Group Managers. The statements, opinions and data contained in the journals are solely Password-Only Authenticated Key Exchange Between Two Agents in the Four-Party Setting. Fully Leakage-Resilient Signatures with Auxiliary Inputs. 319.4 958.3 638.9 575 638.9 606.9 473.6 453.6 447.2 638.9 606.9 830.6 606.9 606.9 Election Verifiability or Ballot Privacy: Do We Need to Choose?. /LastChar 196 Theory of Cryptography, 403-418. 638.9 638.9 509.3 509.3 379.6 638.9 638.9 768.5 638.9 379.6 1000 924.1 1027.8 541.7 A Public Key Cryptoscheme Using Bit-Pairs with Provable Semantical Security. (2013) Public Key Timed-Release Searchable Encryption. Theory of Cryptography, 535-552. OAEP Reconsidered. 2006. Efficient Non-interactive Proof Systems for Bilinear Groups. Identity-Based Encryption from the Weil Pairing. On the (Im)possibility of Obfuscating Programs. Computational Science and Its Applications - ICCSA 2006, 517-526. Certificateless Public Key Cryptography. /Type/Font 2013. Advances in Cryptology – CRYPTO 2010, 429-446. Cramer-Shoup Like Chosen Ciphertext Security from LPN. The PACE|AA Protocol for Machine Readable Travel Documents, and Its Security. 500 500 500 500 500 500 500 564 500 500 500 500 500 500 500 500] A Black-Box Construction of a CCA2 Encryption Scheme from a Plaintext Aware (sPA1) Encryption Scheme. Theory of Cryptography, 343-367. M��`�4Q~�|au9�gYGI*�Z�Dxw��ǟ��WY�eVw[�SA+�:���\�|(�������r�7�OW2 3�R��^�%�m���C������w��]��a��������"��Z�X��35�~� �����=��֞�fZI6[���$UI�$���7��-��T|�x�BOa�8�l�LC�����Y��+����v����U4�D�Q�I/�k�t[���r��p< U�c�Omw%����C�����M?T�i��1n��=�M�i k�B)bZ��U�[웶nw���w�O�o�!y�s����۶٭w'&�������:�r�o�������U?�y�wL���� =�g�֑Z�X�,޺e�P%�r�?�ߞ�H�XP��Q~���l�z���Ov�]��)�Xh%�y;)�q�����Ӧ����E�������|\�HCEh��}�ޡ�:KWg�yXE� Progress on Cryptography, 187-194. (2019) Non-malleable Coding for Arbitrary Varying Channels. Security and Cryptography for Networks, 435-454. Relaxing Chosen-Ciphertext Security. 2016. /LastChar 196 833.3 1444.4 1277.8 555.6 1111.1 1111.1 1111.1 1111.1 1111.1 944.4 1277.8 555.6 1000 767.4 767.4 826.4 826.4 649.3 849.5 694.7 562.6 821.7 560.8 758.3 631 904.2 585.5 (2010) A Framework for the Sound Specification of Cryptographic Tasks. OAEP Is Secure under Key-Dependent Messages. 2018. /Widths[1222.2 638.9 638.9 1222.2 1222.2 1222.2 963 1222.2 1222.2 768.5 768.5 1222.2 2019. /Widths[622.5 466.3 591.4 828.1 517 362.8 654.2 1000 1000 1000 1000 277.8 277.8 500 /FontDescriptor 9 0 R /Type/Font 34 0 obj Unconditionally Secure Encryption Under Strong Attacks. (2007) New Efficient Non-malleable Commitment Schemes. Advances in Cryptology - CRYPTO 2009, 18-35. Advances in Cryptology - ASIACRYPT 2008, 506-523. Security Weakness in Ren et al.’s Group Key Agreement Scheme Built on Secure Two-Party Protocols. >> Chosen Ciphertext Security from Injective Trapdoor Functions. On the Non-malleability of the Fiat-Shamir Transform. (2006) ACM SIGACT news distributed computing column 24. 2017. 2004.