Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
Book cover

International Conference on the Theory and Application of Cryptology and Information Security

ASIACRYPT 2012: Advances in Cryptology – ASIACRYPT 2012 pp 80–97Cite as

  1. Home
  2. Advances in Cryptology – ASIACRYPT 2012
  3. Conference paper
Optimal Reductions of Some Decisional Problems to the Rank Problem

Optimal Reductions of Some Decisional Problems to the Rank Problem

  • Jorge Luis Villar18 
  • Conference paper
  • 3657 Accesses

  • 10 Citations

Part of the Lecture Notes in Computer Science book series (LNSC,volume 7658)

Abstract

In the last years the use of large matrices and their algebraic properties proved to be useful to instantiate new cryptographic primitives like Lossy Trapdoor Functions and encryption schemes with improved security, like Key Dependent Message resilience. In these constructions the rank of a matrix is assumed to be hard to guess when the matrix is hidden by elementwise exponentiation. This problem, that we call here the Rank Problem, is known to be related to the Decisional Diffie-Hellman problem, but in the known reductions between both problems there appears a loss-factor in the advantage which grows linearly with the rank of the matrix.

In this paper, we give a new and better reduction between the Rank problem and the Decisional Diffie-Hellman problem, such that the reduction loss-factor depends logarithmically in the rank. This new reduction can be applied to a number of cryptographic constructions, improving their efficiency. The main idea in the reduction is to build from a DDH tuple a matrix which rank shifts from r to 2r, and then apply a hybrid argument to deal with the general case. In particular this technique widens the range of possible values of the ranks that are tightly related to DDH.

On the other hand, the new reduction is optimal as we show the nonexistence of more efficient reductions in a wide class containing all the “natural” ones (i.e., black-box and algebraic). The result is twofold: there is no (natural) way to build a matrix which rank shifts from r to 2r + α for α > 0, and no hybrid argument can improve the logarithmic loss-factor obtained in the new reduction.

The techniques used in the paper extend naturally to other “algebraic” problems like the Decisional Linear or the Decisional 3-Party Diffie- Hellman problems, also obtaining reductions of logarithmic complexity.

Keywords

  • Rank Problem
  • Decisional Diffie-Hellman Problem
  • Black-Box Reductions
  • Algebraic Reductions
  • Decision Linear Problem

Download conference paper PDF

References

  1. Boneh, D., Boyen, X., Shacham, H.: Short Group Signatures. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 41–55. Springer, Heidelberg (2004)

    Google Scholar 

  2. Boneh, D., Halevi, S., Hamburg, M., Ostrovsky, R.: Circular-Secure Encryption from Decision Diffie-Hellman. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 108–125. Springer, Heidelberg (2008)

    Google Scholar 

  3. Boneh, D., Sahai, A., Waters, B.: Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 573–592. Springer, Heidelberg (2006)

    CrossRef  Google Scholar 

  4. Galindo, D., Herranz, J., Villar, J.L.: Identity-based encryption with master key-dependent message security and applications. IACR Cryptology ePrint Archive, 142 (2012)

    Google Scholar 

  5. Galindo, D., Herranz, J., Villar, J.: Identity-Based Encryption with Master Key-Dependent Message Security and Leakage-Resilience. In: Foresti, S., Yung, M., Martinelli, F. (eds.) ESORICS 2012. LNCS, vol. 7459, pp. 627–642. Springer, Heidelberg (2012)

    CrossRef  Google Scholar 

  6. Green, M., Hohenberger, S.: Practical Adaptive Oblivious Transfer from Simple Assumptions. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 347–363. Springer, Heidelberg (2011)

    CrossRef  Google Scholar 

  7. Hofheinz, D.: All-but-many lossy trapdoor functions. Cryptology ePrint Archive, Report 2011/230 (2011), http://eprint.iacr.org/

  8. Hofheinz, D.: All-But-Many Lossy Trapdoor Functions. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 209–227. Springer, Heidelberg (2012)

    CrossRef  Google Scholar 

  9. Laguillaumie, F., Paillier, P., Vergnaud, D.: Universally convertible directed signatures. In: Roy [14], pp. 682–701

    Google Scholar 

  10. Naor, M., Segev, G.: Public-Key Cryptosystems Resilient to Key Leakage. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 18–35. Springer, Heidelberg (2009)

    CrossRef  Google Scholar 

  11. Pascal Paillier and Damien Vergnaud. Discrete-log-based signatures may not be equivalent to discrete log. In: Roy [14], pp. 1–20

    Google Scholar 

  12. Peikert, C., Waters, B.: Lossy trapdoor functions and their applications. IACR Cryptology ePrint Archive, 279 (2007)

    Google Scholar 

  13. Peikert, C., Waters, B.: Lossy trapdoor functions and their applications. In: Dwork, C. (ed.) STOC, pp. 187–196. ACM (2008)

    Google Scholar 

  14. Roy, B. (ed.): ASIACRYPT 2005. LNCS, vol. 3788. Springer, Heidelberg (2005)

    MATH  Google Scholar 

  15. Schwartz, J.T.: Fast probabilistic algorithms for verification of polynomial identities. J. ACM 27(4), 701–717 (1980)

    CrossRef  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universitat Politècnica de Catalunya, Spain

    Jorge Luis Villar

Authors
  1. Jorge Luis Villar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Tsinghua University, 30 Shuangqing Road, 100084, Beijing, China

    Xiaoyun Wang

  2. Central Research Laboratories, NEC, 1754 Shimonumabe Nakahara, 211-8666, Kawasaki, Japan

    Kazue Sako

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 International Association for Cryptologic Research

About this paper

Cite this paper

Villar, J.L. (2012). Optimal Reductions of Some Decisional Problems to the Rank Problem. In: Wang, X., Sako, K. (eds) Advances in Cryptology – ASIACRYPT 2012. ASIACRYPT 2012. Lecture Notes in Computer Science, vol 7658. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34961-4_7

Download citation

  • .RIS
  • .ENW
  • .BIB
  • DOI: https://doi.org/10.1007/978-3-642-34961-4_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34960-7

  • Online ISBN: 978-3-642-34961-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature