In search of mathematical primitives for deriving universal projective hash families

Applicable Algebra in Engineering, Communications and Computing

Volumn 19, Issue 2, 2008, Pages 161-173

  González Vasco, María Isabel ^a,b   Villar, Jorge L ^c  

^a UNIVERSIDAD REY JUAN CARLOS   (Spain)

^b UNIVERSIDAD AUTÓNOMA DE MADRID   (Spain)

^c UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Projective hash families; Provable security; Public key encryption

Indexed keywords

BLOCK CODES; CRAMER-RAO BOUNDS; INFORMATION USE; MATHEMATICAL MORPHOLOGY;

PROJECTIVE HASH FAMILIES; PROVABLE SECURITY;

PUBLIC KEY CRYPTOGRAPHY;

EID: 41249098852     PISSN: 09381279     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00200-008-0068-y     Document Type: Article

References (15)

1. Bonisoli, J.: On collineation groups of finite planes. Lecture notes from the course Finite Geometries and Their Applications Available at http://www.maths.qmul.ac.uk/~pjc/design/notes.html 1-27, (1999)
2. Cramer, R., Shoup, V.: A practical public key cryptosystem secure against adaptive chosen ciphertext attacks. Advances in Cryptology-CRYPTO'98, Lecture Notes in Computer Science, vol. 1462, pp. 424-441. Springer, Heidelberg (1998)
3. Cramer, R., Shoup, V.: 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/
4. Cramer, R., Shoup, V.: Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption. Advances in Cryptology-EUROCRYPT 2002, Lecture Notes in Computer Science, vol. 2332, pp. 45-64. Springer, Heidelberg (2002)
5. Carter J. and Wegman W. (1979). Universal classes of hash functions. J. Comput. Syst. Sci. 18: 143-154
6. Goldreich O. (2001). Foundations of Cryptography, vol. 1. Cambridge University Press, London
7. Goldreich O. (2004). Foundations of Cryptography, vol. 2. Cambridge University Press, London
8. Impagliazo, R., Levin, L.A., Luby, A.: Pseudorandom Generators from any One-Way Function. In: 21st STOC, Proceedings, pp. 12-24. Springer, Heidelberg (1989)
9. Kalai, Y.I.: Smooth Projective Hashing and Two-Message Oblivious Transfer. In: Advances in Cryptology. Proceedings of EUROCRYPT 2005, Lecture Notes in Computer Science, vol. 3494, pp. 78-95. Springer, Heidelberg (2005)
10. Kurosawa, K., Desmedt, Y.: A New Paradim of Hybrid Encryption Scheme. In: Advances in Cryptology. Proceedings of CRYPTO 2004, Lecture Notes in Computer Science, vol. 3152. pp. 426-442. Springer, Heidelberg (2004)
11. Naor, M., Yung, M.: Public-key Cryptosystems Provably Secure against Chosen Ciphertext Attacks. In: Proceedings of the twenty-second annual ACM symposium on Theory of computing, pp. 427-437. ACM Press, New York (1990)
12. Rotman J.J. (1999). An Introduction to the Theory of Groups, 4th ed. Springer, Heidelberg
13. González Vasco, M.I., Martínez, C., Steinwandt, R., Villar, J.L.: A new Cramer-Shoup like methodology for group based provable secure encryption schemes. In: Proceedings of the Second Theory of Cryptography Conference TCC 2005, Lecture Notes in Computer Science, vol. 3378, pp. 495-509. Springer, Heidelberg (2005)
14. Gennaro, R., Lindell, Y.: A Framewok for Passord-Based Authenticated Key Exchange. Cryptology ePrint Archive: Report 2003/032 (2003). Electronically available at http://eprint.iacr.org/2003/032/
15. Gennaro, R., Shoup, V.: A Note on an Encryption Scheme of Kurosawa and Desmedt. Cryptology ePrint Archive: Report 2004/194 (2004). Electronically available at http://eprint.iacr.org/2004/194/