A new cramer-shoup like methodology for group based provably secure encryption schemes

Lecture Notes in Computer Science

Volumn 3378, Issue , 2005, Pages 495-509

  Vasco, María Isabel Gonzalez ^a   Martínez, Consuelo ^b   Steinwandt, Rainer ^c   Villar, Jorge L ^d  

^a UNIVERSIDAD REY JUAN CARLOS   (Spain)

^b UNIVERSITY OF OVIEDO   (Spain)

^c UNIVERSITY OF KARLSRUHE   (Germany)

^d UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; PUBLIC KEY CRYPTOGRAPHY;

CRAMER-SHOUP LIKE METHODOLOGY; IDEALIZATION ASSUMPTIONS; NON-ABELIAN GROUPS;

SECURITY OF DATA;

EID: 24144498379     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30576-7_27     Document Type: Conference Paper

References (22)

1. I. Anshel, M. Anshel, B. Fisher, and D. Goldfeld. New Key Agreement Protocols in Braid Group Cryptography. In CT-RSA 2001, volume 2020 of Lecture Notes in Computer Science, pages 13-27, Berlin, Heidelberg, 2001. Springer.
2. I. Anshel, M. Anshel, and D. Goldfeld. An algebraic method for public-key cryptography. Mathematical Research Letters, 6:1-5, 1999.
3. M. Bellare, A. Desai, D. Pointcheval, and P. Rogaway. Relations Among Notions of Security for Public-Key Encryption Schemes. In Advances in Cryptology, Proceedings of CRYPTO '98, volume 1462 of Lecture Notes in Computer Science, pages 26-45. Springer, 1998.
4. M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In A CM Conference on Computer and Communications Security, pages 62-73, 1993.
5. 1. Designs, Codes and Cryptography, to appear.
6. J.H. Cheon and B. Jun. Diffie-Hellman Conjugacy Problem on Braids. Cryptology ePrint Archive: Report 2003/019, 2003. Electronically available at http://eprint.iacr.org/2003/019/.
7. R. Cramer and V. Shoup. Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption. Cryptology ePrint Archive: Report 2001/085, 2001. Electronically available at http://eprint.iacr.org/2001/085/.
8. R. Cramer and V. Shoup. Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption. In Lars Knudsen, editor, Advances in Cryptology - EUROCRYPT 2002, volume 2332 of Lecture Notes in Computer Science, pages 45-64. Springer, 2002.
9. D. Dolev, C. Dwork, and M. Naor. Non-malleable cryptography. SIAM Journal on Computing, 30:391-437, 2000.
10. A. Fiat and A. Shamir. How to prove yourself: practical solutions to identification and signature problems. In Advances in cryptology-CRYPTO '86, volume 263 of Lecture Notes in Computer Science, pages 186-194. Springer, 1987.
11. M. Garzon and Y. Zalcstein. The Complexity of Grigorchuk groups with application to cryptography. Theoretical Computer Science, 88:83-98, 1991.
12. M.I. González Vasco, C. Martínez, and R. Steinwandt. Towards a Uniform Description of Several Group Based Cryptographic Primitives. Designs, Codes and Cryptography, 33:215-226, 2004.
13. M.I. González Vasco and R. Steinwandt. Reaction Attacks on Public Key Cryptosystems Based on the Word Problem. Applicable Algebra in Engineering, Communication and Computing, 14:335-340, 2004.
14. D. Hofheinz and R. Steinwandt. A Practical Attack on Some Braid Group Based Cryptographic Primitives. In Public Key Cryptography, 6th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2003 Proceedings, volume 2567 of Lecture Notes in Computer Science, pages 187-198. Springer, 2003.
15. K.H. Ko, S.J. Lee, J.H. Cheon, J.W. Han, J. Kang, and C. Park. New Public-Key Cryptosystem using Braid Groups. In Advances in Cryptology. Proceedings of CRYPTO 2000, volume 576 of Lecture Notes in Computer Science, pages 166-183. Springer, 2000.
16. H.K. Lee, H.S. Lee, and Y.R. Lee. An Authenticated Group Key Agreement Protocol on Braid Groups. Cryptology ePrint Archive: Report 2003/018, 2003. Electronically available at http://eprint.iacr.org/2003/018/.
17. S.S. Magliveras and N.D. Memon. Algebraic properties of cryptosystem PGM. Journal of Cryptology, 5:167-183, 1992.
18. S.S. Magliveras, D.R. Stinson, and T. Trung. New approaches to designing public key cryptosystems using one-way functions and trap-doors in finite groups. Journal of Cryptology, 15:285-297, 2002.
19. M. Naor and M. Yung. Public-key Cryptosystems Provably Secure against Chosen Ciphertext Attacks. In Proceedings of the twenty-second annual ACM symposium on Theory of computing, pages 427-437. ACM Press, 1990.
20. C. Rackoff and D. Simon. Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack. In Advances in Cryptology - CRYPTO'91, volume 576 of Lecture Notes in Computer Science, pages 433-444. Springer, 1992.
21. V. Shpilrain. Assessing security of some group based cryptosystems. Cryptology ePrint Archive: Report 2003/123, 2003. Electronically available at http://eprint.iacr.org/2003/123/.
22. N.R. Wagner and M.R. Magyarik. A Public Key Cryptosystem Based on the Word Problem. In Advances in Cryptology: Proceedings of CRYPTO 84, volume 196 of Lecture Notes in Computer Science, pages 19-36. Springer, 1985.