Skip to main content
SpringerLink
Log in

Tightly Secure Public-Key Cryptographic Schemes from One-More Assumptions

  • Regular Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

A tightly secure cryptographic scheme refers to a construction with a tight security reduction to a hardness assumption, where the reduction loss is a small constant. A scheme with tight security is preferred in practice since it could be implemented using a smaller parameter to improve efficiency. Recently, Bader et al. (EUROCRYPT 2016) have proposed a comprehensive study on the impossible tight security reductions for certain (e.g., key-unique) public-key cryptographic schemes in the multi-user with adaptive corruptions (MU-C) setting built upon non-interactive assumptions. The assumptions of one-more version, such as one-more computational Diffie-Hellman (n-CDH), are variants of the standard assumptions and have found various applications. However, whether it is possible to have tightly secure key-unique schemes from the one-more assumptions or the impossible tight reduction results also hold for these assumptions remains unknown. In this paper, we give affirmative answers to the above question, i.e., we can have efficient key-unique public-key cryptographic schemes with tight security built upon the one-more assumptions. Specifically, we propose a digital signature scheme and an encryption scheme, both of which are key-unique and have tight MU-C security under the one-more computational Diffie-Hellman (n-CDH) assumption. Our results also reflect from another aspect that there indeed exists a gap between the standard assumptions and their one-more version counterparts.

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. Hofheinz D, Nguyen N. On tightly secure primitives in the multi-instance setting. In Proc. the 22nd IACR International Conference on Practice and Theory of Public-Key Cryptography, April 2019, pp.581-611.

  2. Han J, Yang Y, Liu J, Li J, Liang K, Shen J. Expressive attribute-based keyword search with constant-size ciphertext. Soft Comput., 2018, 22(15): 5163-5177.

    Article  Google Scholar 

  3. Lai J, Huang Z, Au M, Mao X. Constant-size CCA-secure multi-hop unidirectional proxy re-encryption from indistinguishability obfuscation. In Proc. the 23rd Australasian Conference, July 2018, pp.805-812.

  4. Yang Y, Liu X, Deng R. Lightweight break-glass access control system for healthcare internet-of-things. IEEE Trans. Industrial Informatics, 2018, 14(8): 3610-3617.

    Article  Google Scholar 

  5. Galbraith S D, Malone-Lee J, Smart N P. Public key signatures in the multi-user setting. Inf. Process. Lett., 2002, 83(5): 263-266.

    Article  MathSciNet  Google Scholar 

  6. Bellare M, Boldyreva A, Micali S. Public-key encryption in a multi-user setting: Security proofs and improvements. In Proc. the 19th Int. Conference on the Theory and Application of Cryptographic Techniques, May 2000, pp.259-274.

  7. Bader C, Hofheinz D, Jager T, Kiltz E, Li Y. Tightly-secure authenticated key exchange. In Proc. the 12th Theory of Cryptography Conference, March 2015, pp.629-658.

  8. Bader C, Jager T, Li Y, Schäge S. On the impossibility of tight cryptographic reductions. In Proc. the 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, May 2016, pp.273-304.

  9. Gjøsteen K, Jager T. Practical and tightly-secure digital signatures and authenticated key exchange. In Proc. the 38th Annual International Cryptology Conference, August 2018, pp.95-125.

  10. Bader C. Efficient signatures with tight real world security in the random-oracle model. In Proc. the 13th Int. Conference on Cryptology and Network Security, October 2014, pp.370-383.

  11. Hofheinz D, Jager T. Tightly secure signatures and publickey encryption. Des. Codes Cryptography, 2016, 80(1): 29-61.

    Article  MathSciNet  Google Scholar 

  12. Libert B, Joye M, Yung M, Peters T. Concise multichallenge CCA-secure encryption and signatures with almost tight security. In Proc. the 20th Int. Conference on the Theory and Application of Cryptology and Information Security, December 2014, pp.1-21.

  13. Libert B, Peters T, Joye M, Yung M. Compactly hiding linear spans — Tightly secure constant-size simulation-sound QA-NIZK proofs and applications. In Proc. the 21st Int. Conference on the Theory and Application of Cryptology and Information Security, December 2015, pp.681-707.

  14. Attrapadung N, Hanaoka G, Yamada S. A framework for identity-based encryption with almost tight security. In Proc. the 21st Int. Conference on the Theory and Application of Cryptology and Information Security, December 2015, pp.521-549.

  15. Blazy O, Kiltz E, Pan J. (Hierarchical) identity-based encryption from affine message authentication. In Proc. the 34th Annual Cryptology Conference, August 2014, pp.408-425.

  16. Chen J, Gong J, Weng J. Tightly secure IBE under constant-size master public key. In Proc. the 20th Int. IACR International Conference on Practice and Theory in Public-Key Cryptography, March 2017, pp.207-231.

  17. Chen J, Wee H. Fully, (almost) tightly secure IBE and dual system groups. In Proc. the 33rd Annual Cryptology Conference, August 2013, pp.435-460.

  18. Gong J, Chen J, Dong X, Cao Z, Tang S. Extended nested dual system groups, revisited. In Proc. the 19th IACR International Conference on Practice and Theory in Public-Key Cryptography, March 2016, pp.133-163.

  19. Gong J, Dong X, Chen J, Cao Z. Efficient IBE with tight reduction to standard assumption in the multi-challenge setting. In Proc. the 22nd Int. Conference on the Theory and Application of Cryptology and Information Security, December 2016, pp.624-654.

  20. Hofheinz D, Jia D, Pan J. Identity-based encryption tightly secure under chosen-ciphertext attacks. In Proc. the 24th Int. Conference on the Theory and Application of Cryptology and Information Security, December 2018, pp.190-220.

  21. Hofheinz D, Koch J, Striecks C. Identity-based encryption with (almost) tight security in the multi-instance, multiciphertext setting. In Proc. the 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, March 2015, pp.799-822.

  22. Coron J. Optimal security proofs for PSS and other signature schemes. In Proc. the 21st Int. Conference on the Theory and Applications of Cryptographic Techniques, April 2002, pp.272-287.

  23. Hofheinz D, Jager T, Knapp E. Waters signatures with optimal security reduction. In Proc. the 15th Int. Conference on Practice and Theory in Public Key Cryptography, May 2012, pp.66-83.

  24. Kakvi S, Kiltz E. Optimal security proofs for full domain hash, revisited. J. Cryptology, 2018, 31(1): 276-306.

    Article  MathSciNet  Google Scholar 

  25. Bellare M, Namprempre C, Pointcheval D, Semanko M. The power of RSA inversion oracles and the security of Chaum’s RSA-based blind signature scheme. In Proc. the 5th Int. Conference on Financial Cryptography, February 2002, pp.309-328.

  26. Boldyreva A. Threshold signatures, multisignatures and blind signatures based on the Gap-Diffie-Hellman-group signature scheme. In Proc. the 6th Int. Workshop on Theory and Practice in Public Key Cryptography, January 2003, pp.31-46.

    Google Scholar 

  27. Bellare M, Neven G. Transitive signatures: New schemes and proofs. IEEE Trans. Information Theory, 2005, 51(6): 2133-2151.

    Article  MathSciNet  Google Scholar 

  28. Bellare M, Namprempre C, Neven G. Security proofs for identity-based identification and signature schemes. J. Cryptology, 2009, 22(1): 1-61.

    Article  MathSciNet  Google Scholar 

  29. de Cristofaro E, Tsudik G. Practical private set intersection protocols with linear complexity. In Proc. the 14th Int. Conference on Financial Cryptography and Data Security, January 2010, pp.143-159.

  30. Fischlin M, Fleischhacker N. Limitations of the metareduction technique: The case of Schnorr signatures. In Proc. the 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, May 2013, pp.444-460.

  31. Garg S, Bhaskar R, Lokam S. Improved bounds on security reductions for discrete log based signatures. In Proc. the 28th Annual International Cryptology Conference, August 2008, pp.93-107.

  32. Seurin Y. On the exact security of Schnorr-type signatures in the Random Oracle Model. In Proc. the 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques, April 2012, pp.554-571.

  33. Bresson E, Monnerat J, Vergnaud D. Separation results on the “one-more” computational problems. In Proc. the 2008 the Cryptographers’ Track at the RSA Conference, April 2008, pp.71-87.

  34. Pass R. Limits of provable security from standard assumptions. In Proc. the 43rd ACM Symposium on Theory of Computing, June 2011, pp.109-118.

  35. Zhang J, Zhang Z, Chen Y, Guo Y, Zhang Z. Black-box separations for one-more (static) CDH and its generalization. In Proc. the 20th Int. Conference on the Theory and Application of Cryptology and Information Security, December 2014, pp.366-385.

  36. Boneh D, Lynn B, Shacham H. Short signatures from the Weil pairing. In Proc. the 7th Int. Conference on the Theory and Application of Cryptology and Information Security, December 2001, pp.514-532.

  37. Abdalla M, Bellare M, Rogaway P. The Oracle Diffie-Hellman assumptions and an analysis of DHIES. In Proc. the 1st Cryptographer’s Track at RSA Conference, April 2001, pp.143-158.

  38. Wang Y, Matsuda T, Hanaoka G, Tanaka K. Impossibility on tamper-resilient cryptography with uniqueness properties. IACR ePrint Archive, 2018, 2018: Article No. 564.

  39. Boneh D, Boyen X. Efficient selective-ID secure identitybased encryption without random oracles. In Proc. the 23rd Int. Conference on the Theory and Applications of Cryptographic Techniques, May 2004, pp.223-238.

  40. Katz J, Wang N. Efficiency improvements for signature schemes with tight security reductions. In Proc. the 10th ACM Conference on Computer and Communications Security, October 2003, pp.155-164.

  41. ElGamal T. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Information Theory, 1985, 31(4): 469-472.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Cyber Science and Engineering, Southeast University, Nanjing, 211189, China

    Ge Wu

  2. Institute of Cybersecurity and Cryptology, School of Computing and Information Technology University of Wollongong, Wollongong, 2522, Australia

    Ge Wu, Fu-Chun Guo & Willy Susilo

  3. Purple Mountain Laboratories, Nanjing, 211111, China

    Ge Wu

  4. School of Mathematics and Computer Science, Fujian Normal University, Fuzhou, 350117, China

    Jian-Chang Lai

  5. School of Computer Science and Technology, Nanjing Normal University, Nanjing, 210023, China

    Fu-Tai Zhang

Authors
  1. Ge Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jian-Chang Lai
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Fu-Chun Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Willy Susilo
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Fu-Tai Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jian-Chang Lai.

Electronic supplementary material

ESM 1

(PDF 386 kb)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wu, G., Lai, JC., Guo, FC. et al. Tightly Secure Public-Key Cryptographic Schemes from One-More Assumptions. J. Comput. Sci. Technol. 34, 1366–1379 (2019). https://doi.org/10.1007/s11390-019-1980-2

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-019-1980-2

Keywords

Search

Navigation