A new security proof for Damgård's ElGamal

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3960 LNCS, Issue , 2006, Pages 150-158

  Gjøsteen, Kristian ^a  

^a NORWEGIAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CRIME; CRYPTOGRAPHY; PROBLEM SOLVING; TEXT PROCESSING; ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

DECISION DIFFIE-HELLMAN PROBLEMS; PROBLEMATIC ASSUMPTIONS; SECURITY PROOFS; CHOSEN CIPHERTEXT ATTACK; DECISION DIFFIE-HELLMAN PROBLEM; ELGAMAL;

SECURITY OF DATA; CRYPTOGRAPHY;

EID: 33745655621     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11605805_10     Document Type: Conference Paper

References (12)

1. Michel Abdalla, Mihir Bollare, arid Phillip Rogaway. The Oracle Diffie-Hellman assumptions arid an analysis of DHIES. In David Naccache, editor, Proceedings of CT-RSA 2001, volume 2020 of LNCS, pages 143-158. Springer-Verlag, 2001.
2. Mihir Bellare and Adriana Palacio. The knowledge-of-exponent assumptions and 3-round zero-knowledge protocols. In Matthew K. Franklin, editor, Proceeding of CRYPTO 2003, volume 3152 of LNCS, pages 273-289. Springer-Verlag, 2004.
3. Mihir Bellare and Adriana Palacio. Towards plaintext-aware public-key encryption without random oracles. In Pil Joong Lee, editor, Proceedings of ASIACRYPT 2004, volume 3329 of LNCS, pages 48-62. Springer-Verlag, 2004.
4. D. Boneh. The Decision Diffie-Hellman problem. In Proceedings of the Third Algorithmic. Number Theory Symposium, volume 1423 of LNCS, pages 48-63. Springer-Verlag, 1998.
5. Ronald Cramer and Vietor Shoup. Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption. In Lars R. Knudsen, editor, Proceedings of EUROCRYPT 2002, volume 2332 of LNCS, pages 45-64. Springer-Verlag, 2002.
6. Ronald Cramer and Victor Shoup. Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack. SIAM Journal on Computing, 33(1): 167-226, 2003.
7. Ivan Damgård. Towards practical public key systems secure against chosen ciphertext attacks. In Joan Feigenbaum, editor, Proceedings of CRYPTO '91, volume 576 of LNCS, pages 445-456. Springer-Verlag, 1992.
8. W. Diffie and M. E. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, 22:644-654, 1976.
9. Kristian Gjøsteen. Symmetric subgroup membership problems. In Serge Vaudenay, editor, Proceedings of Public Key Cryptography 2005, volume 3386 of LNCS, pages 104-119. Springer-Verlag, 2005.
10. Satoshi Hada and Toshiaki Tanaka. On the existence of 3-Round zero-knowledge protocols. In Hugo Krawczyk, editor, Proceedings of CRYPTO '98, volume 1462 of LNCS, pages 408-423. Springer-Verlag, 1998.
11. Tatsuaki Okamoto and David Pointcheval. The gap-problems: A new class of problems for the security of cryptographic schemes. In Kwangjo Kim, editor, Proceedings of Public Key Cryptography 2001, volume 1992 of LNCS, pages 104-118. Springer-Verlag, 2001.
12. P. Paillier. Public-key cryptosystems based on composite degree residue classes. In Jacques Stern, editor, Proceedings of EUROCRYPT '99, volume 1592 of LNCS, pages 223-238. Springer-Verlag, 1999.