Rerandomizable and replayable adaptive chosen ciphertext attack secure cryptosystems

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

Volumn 2951, Issue , 2004, Pages 152-170

  Groth, Jens ^a,b,c  

^a BRIC   (Denmark)

^b AARHUS UNIVERSITY   (Denmark)

^c Cryptomathic AS   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

SECURITY OF DATA;

BUILDING BLOCKES; CCA2 SECURITIES; CHOSEN CIPHERTEXT ATTACK; CIPHERTEXTS; NIELSEN; PLAINTEXT; WEAK FORM;

CRYPTOGRAPHY;

EID: 35048856555     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24638-1_9     Document Type: Article

References (15)

1. Dolev, D., Dwork, C., Naor, M.: Non-malleable cryptography. SIAM J. of Computing 30 (2000) 391-437 Earlier version at STOC '91.
2. Sahai, A.: Non-malleable non-interactive zero-knowledge and adaptive chosenciphertext security. In: proceedings of FOCS '01. (2001) 543-553
3. Cramer, R., Shoup, V.: Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack. In: proceedings of CRYPTO '98, LNCS series, volume 1462. (1998) 13-25
4. Cramer, R., Shoup, V.: Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption. In: proceedings of EUROCRYPT '02, LNCS series, volume 2332. (2002) 45-64
5. Lindell, Y.: A simpler construction of cca2-secure public-key encryption under general assumptions. In: proceedings of EUROCRYPT '03, LNCS series, volume 2656. (2003) 241-254
6. Shoup, V.: A proposal for an iso standard for public key encryption. Cryptology ePrint Archive, Report 2001/112 (2001) http://eprint.iacr.org/2001/ 212.
7. An, J.H., Dodis, Y., Rabin, T.: On the security of joint signature and encryption. In: proceedings of EUROCRYPT '02, LNCS series, volume 2332. (2002) 83-107
8. Canetti, R., Krawczyk, H., Nielsen, J.B.: Relaxing chosen-ciphertext security. In: proceedings of CRYPTO '03, LNCS series, volume 2729. (2003) 565-582
9. Bleichenbacher, D.: Chosen ciphertext attacks against protocols based on the rsa encryption standard pkcs 1. In: proceedings of CRYPTO '98, LNCS series, volume 1462. (1998) 1-12
10. Bellare, M., Sahai, A.: Non-malleable encryption: Equivalence between two notions, and an indistinguishability-based characterization. In: proceedings of CRYPTO '99, LNCS series, volume 1666. (1999) 519-536
11. Boneh, D., Lipton, R.J.: Algorithms for black-box fields and their application to cryptography. In: proceedings of CRYPTO '96, LNCS series, volume 1109. (1996) 283-297
12. Shoup, V.: Lower bounds for discrete logarithms and related problems. In: proceedings of EUROCRYPT '97, LNCS series, volume 1233. (1997) 256-266
13. Damgård, I., Koprowski, M.: Generic lower bounds for root extraction and signature schemes in general groups. In: proceedings of EUROCRYPT '02, LNCS series, volume 2332. (2002) 256-271
14. Naor, M., Yung, M.: Public-key cryptosystems provably secure against chosen ciphertext attacks. In: proceedings of STOC '90. (1990) 427-437
15. Bellare, M., Desai, A., Pointcheval, D., Rogaway, P.: Relations among notions of security for public-key encryption schemes. In: proceedings of CRYPTO '98, LNCS series, volume 1462. (1998) 26-45