Chosen-ciphertext security from tag-based encryption

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

Volumn 3876 LNCS, Issue , 2006, Pages 581-600

  Kiltz, Eike ^a  

^a CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; LINEAR EQUATIONS; MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS; SECURITY OF DATA;

CHOSEN-CIPHERTEXT SECURITY; GAP-GROUPS; KEY ENCAPSULATION MECHANISM; TAG-BASED ENCRYPTION (TBE);

CRYPTOGRAPHY;

EID: 33745574075     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11681878_30     Document Type: Conference Paper

References (30)

1. M. Abe, R. Gennaro, K. Kurosawa, and V. Shoup. Tag-KEM/DEM: A new frame-work for hybrid encryption and a new analysis of Kurosawa-Desmedt KEM, In R. Cramer, editor, EUROCRYPT 2005, volume 3494 of LNCS, pages 128-146. Springer-Verlag, May 2005.
2. M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In ACM CCS 93, pages 62-73. ACM Press, Nov. 1993.
3. D. Boneh and X, Boyen. Efficient selective-id secure identity based encryption without random oracles. In C. Cachin and J. Camenisch, editors, EUROCRYPT 2004, volume 3027 of LNCS, pages 223-238. Springer-Verlag, May 2004.
4. D. Boneh, X. Boyen, and H. Shacham. Short group signatures. In M. Franklin, editor, CRYPTO 2004, volume 3152 of LNCS, pages 41-55. Springer-Verlag, Aug, 2004.
5. D. Boneh, R. Canetti, S, Halevi, and J. Katz. Chosen-ciphertext security from identity-based encryption, Journal submission. Available from author's web page http://crypto.stanford.edu/~dabo/pubs.html, November 2005.
6. D. Boneh and M. K. Franklin. Identity based encryption from the Weil pairing, SIAM Journal on Computing, 32(3):586-615, 2003.
7. D. Boneh and J. Katz. Improved efficiency for CCA-secure cryptosystems built using identity-based encryption. In A. Menezes, editor, CT-RSA 2005, volume 3376 of LNCS, pages 87-103. Springer-Verlag, Feb. 2005.
8. D. Boneh and H. Shacham, Group signatures with verifier-local revocation. In ACM CCS 04, pages 168-177. ACM Press, Oct. 2004.
9. X. Boyen, Q. Mei, and B. Waters. Simple and efficient CCA2 security from IBE techniques. In ACM Conference on Computer and Communications Security-CCS 2005, pages 320-329. New-York: ACM Press, 2005.
10. R. Canetti, O. Goldreich, and S. Halevi. The random oracle methodology, revisited. In 30th ACM STOC, pages 209-218. ACM Press, May 1998.
11. R. Canetti, S. Halevi, and J. Katz. Chosen-ciphertext security from identity-based encryption. In C. Cachin and J. Camenisch, editors, EUROCRYPT 2004, volume 3027 of LNCS, pages 207-222. Springer-Verlag, May 2004.
12. R. Cramer and V. Shoup. A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack, In H. Krawczyk, editor, CRYPTO'98, volume 1462 of LNCS, pages 13-25, Springer-Verlag, Aug, 1998.
13. R. Cramer and V. 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.
14. W. Diffie and M. E. Hellman, New directions in cryptography. IEEE Transactions on Information Theory, 22:644-654, 1978.
15. D. Dolev, C. Dwork, and M. Naor. Nonmalleable cryptography. SIAM Journal on Computing, 30(2):391-437, 2000.
16. T. El Gamal. A public key cryptosystem and a signature scheme based on discrete logarithms. In G. R. Blakley and D. Chaum, editors, CRYPTO'84, volume 196 of LNCS, pages 10-18. Springer-Verlag, Aug. 1985.
17. E. Elkind and A. Sahai. A unified methodology for constructing public-key encryption schemes secure against adaptive chosen-ciphertext attack. Cryptology ePrint Archive, Report 2002/042, 2002. http://eprint.iacr.org/.
18. D. Galindo and I. Hasuo, Security notions for identity based encryption, Cryptology ePrint Archive, Report 2005/253, 2005, http://eprint.iacr.org/.
19. S. Goldwasser and S. Micali, Probabilistic encryption, Journal of Computer and System Sciences, 28:270-299, 1984.
20. E. Kiltz. Chosen-ciphertext security from tag-based encryption. Cryptology ePrint Archive, 2005. http://eprint.iacr.org/.
21. K. Kurosawa and Y. Desmedt. A new paradigm of hybrid encryption scheme. In M. Franklin, editor, CRYPTO 2004, volume 3152 of LNCS, pages 426-442. Springer-Verlag, Aug. 2004.
22. P. D. MacKenzie, M. K. Reiter, and K. Yang. Alternatives to non-malleability: Definitions, constructions, and applications. In M. Naor, editor, TCC 2004, volume 2951 of LNCS, pages 171-190. Springer-Verlag, Feb. 2004.
23. M. Naor and M. Yung. Public-key cryptosystems provably secure against chosen ciphertext attacks, In 22nd ACM STOC. ACM Press, May 1990.
24. L. Nguyen and R. Safavi-Naini, Efficient and provably secure trapdoor-free group signature schemes from bilinear pairings. In P. J. Lee, editor, ASIA CRYPT 2004, volume 3329 of LNCS, pages 372-386. Springer-Verlag, Dec. 2004.
25. T. Okamoto and D. Pointcheval. The gap-problems: A new class of problems for the security of cryptographic schemes. In K. Kim, editor, PKC 2001, volume 1992 of LNCS, pages 104-118. Springer-Verlag, Feb. 2001.
26. G. Rackoff and D. R. Simon. Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In J. Feigenbaum, editor, CRYPTO'91, volume 576 of LNCS, pages 433-444, Springer-Verlag, Aug. 1991.
27. R. L. Rivest, A. Shamir, and L. M. Adloman. A method for obtaining digital signature and public-key cryptosystems. Communications of the ACM, 21(2):120-126, 1978.
28. M. Scott. Faster pairings using an elliptic curve with an efficient endomorphism. Cryptology ePrint Archive, Report 2005/252, 2005. http://eprint.iacr.org/.
29. V. Shoup. A proposal for an ISO standard for public key encryption (version 2.1), manuscript, 2001. Available on http://shoup.net/papers/.
30. B. R. Waters. Efficient identity-based encryption without random oracles. In R. Cramer, editor, EUROCRYPT 2005, volume 3494 of LNCS, pages 114-127, Springer-Verlag, May 2005.