Skip to main content
SpringerLink
Log in

In search of mathematical primitives for deriving universal projective hash families

  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

Abstract

We provide some guidelines for deriving new projective hash families of cryptographic interest. Our main building blocks are so called group action systems; we explore what properties of these mathematical primitives may lead to the construction of cryptographically useful projective hash families. We point out different directions towards new constructions, deviating from known proposals arising from Cramer and Shoup’s seminal work.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  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

    Article  MATH  MathSciNet  Google Scholar 

  6. Goldreich O. (2001). Foundations of Cryptography, vol. 1. Cambridge University Press, London

    Google Scholar 

  7. Goldreich O. (2004). Foundations of Cryptography, vol. 2. Cambridge University Press, London

    Google Scholar 

  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

    Google Scholar 

  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/

Download references

Author information

Authors and Affiliations

  1. Área de Matemática Aplicada, Universidad Rey Juan Carlos, C/Tulipán s/n. 28933, Móstoles, Madrid, Spain

    María Isabel González Vasco

  2. IMDEA Matemáticas, Facultad de Ciencias C-IX, Campus UAM, 28049, Cantoblanco, Madrid, Spain

    María Isabel González Vasco

  3. Departamento de Matemática Aplicada IV, Universitat Politécnica de Catalunya Campus Nord, c/Jordi Girona, 1-3, 08034, Barcelona, Spain

    Jorge L. Villar

Authors
  1. María Isabel González Vasco
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jorge L. Villar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to María Isabel González Vasco.

Additional information

Part of this research was done while the authors visited the Centre de Recerca Matemàtica on the occasion of the Research Program on Contemporary Cryptology (Spring 2005).

Rights and permissions

Reprints and permissions

About this article

Cite this article

González Vasco, M.I., Villar, J.L. In search of mathematical primitives for deriving universal projective hash families. AAECC 19, 161–173 (2008). https://doi.org/10.1007/s00200-008-0068-y

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00200-008-0068-y

Keywords

Search

Navigation