Concrete chosen-ciphertext secure encryption from subgroup membership problems

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

Volumn 4301 LNCS, Issue , 2006, Pages 1-18

  Brown, Jaimee ^a   Nieto, Juan Manuel Gonźalez ^a   Boyd, Colin ^a  

^a QUEENSLAND UNIVERSITY OF TECHNOLOGY   (Australia)

Author keywords

Chosen ciphertext security; Cramer shoup framework; Hybrid encryption; Public key encryption; Subgroup membership problems

Indexed keywords

CONCRETES; PUBLIC KEY CRYPTOGRAPHY;

CHOSEN CIPHERTEXT SECURITY; CRAMER- SHOUP FRAMEWORK; HYBRID ENCRYPTION; PUBLIC-KEY ENCRYPTION; SUBGROUP MEMBERSHIP PROBLEM;

NETWORK SECURITY;

EID: 84885933063     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11935070_1     Document Type: Conference Paper

References (12)

1. R. Cramer and V. Shoup. A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack. In CRYPTO '98, volume 1462 of LNCS, pages 13-25. Springer-Verlag, 1998.
2. R. Cramer and V. Shoup. Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption. http://shoup.net/papers/uhp.pdf December 2001.
3. R. Cramer and V. Shoup. Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption. In EUROCRYPT '02, volume 2332 of LNCS, pages 45-64. Springer-Verlag, 2002.
4. R. Gennaro and V. Shoup. A Note on The Encryption Scheme of Kurosawa and Desmedt. Cryptology ePrint Archive, Report 2004/194, 2004. http://eprint.iacr. org/.
5. K. Gjøsteen. Symmetric Subgroup Membership Problems. In S. Vaudenay, editor, PKC '05, volume 3386 of LNCS, pages 104-119. Springer-Verlag, 2005.
6. J. M. Gonźalez-Nieto, C. Boyd, and E. Dawson. A Public Key Cryptosystem Based On A Subgroup Membership Problem. Design, Codes and Cryptography, 36(3):301-316, 2005.
7. K. Kurosawa and Y. Desmedt. A New Paradigm of Hybrid Encryption Scheme. In CRYPTO '04, volume 3152 of LNCS, pages 426-442. Springer-Verlag, 2004.
8. K. Kurosawa, Y. Katayama, W. Ogata, and S. Tsujii. General public key residue cryptosystems and mental poker protocols. In EUROCRYPT '90, volume 473 of LNCS, pages 374-388. Springer-Verlag, 1990.
9. T. Okamoto and S. Uchiyama. A New Public-Key Cryptosystem as Secure as Factoring. In EUROCRYPT '98, volume 1403 of LNCS, pages 308-318. Springer- Verlag, 1998.
10. P. Paillier. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In EUROCRYPT '99, volume 1592 of LNCS, pages 223-238. Springer- Verlag, 1999.
11. P. C. van Oorschot and M. J. Wiener. On Diffie-Hellman Key Agreement with Short Exponents. In EUROCRYPT '96, volume 1070 of LNCS, pages 332-343. Springer-Verlag, 1996.
12. A. Yamamura and T. Saito. Private Information Retrieval based on the Subgroup Membership Problem. In ACISP '01, volume 2119 of LNCS, pages 206-220. Springer-Verlag, 2001.