Advertisement

Journal of Computer Science and Technology

, Volume 33, Issue 6, pp 1243–1260 | Cite as

Updatable Identity-Based Hash Proof System Based on Lattices and Its Application to Leakage-Resilient Public-Key Encryption Schemes

  • Qi-Qi Lai
  • Bo YangEmail author
  • Yong Yu
  • Zhe Xia
  • Yan-Wei Zhou
  • Yuan Chen
Regular Paper

Abstract

Identity-based hash proof system is a basic and important primitive. It is widely utilized to construct cryptographic schemes and protocols that are secure against key-leakage attacks. In this paper, we introduce the concept of updatable identity-based hash proof system, in which the related master secret key and the identity secret key can be updated securely. Then, we instantiate this primitive based on lattices in the standard model. Moreover, we introduce an application of this new primitive by giving a generic construction of leakage-resilient public-key encryption schemes with anonymity. This construction can be considered as the integration of the bounded-retrieval model and the continual leakage model. Compared with the existing leakage-resilient schemes, our construction not only is more efficient but also can resist much more key leakage.

Keywords

public-key encryption identity-based hash proof system lattice updatable leakage-resilience 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Supplementary material

11390_2018_1885_MOESM1_ESM.pdf (91 kb)
ESM 1 (PDF 91 kb)

References

  1. [1]
    Boneh D, Gentry C, Hamburg M. Space-efficient identity based encryption without pairings. In Proc. the 48th Annual IEEE Symposium on Foundations of Computer Science, October 2007, pp.647-657.Google Scholar
  2. [2]
    Alwen J, Dodis Y, Naor M, Segev G, Walfish S, Wichs D. Public-key encryption in the bounded-retrieval model. In Proc. the 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, May 30-June 3, 2010, pp.113-134.Google Scholar
  3. [3]
    Chow S M, Dodis Y, Rouselakis Y, Waters B. Practical leakage-resilient identity-based encryption from simple assumptions. In Proc. the 17th ACM Conf. Computer and Communications Security, October 2010, pp.152-161.Google Scholar
  4. [4]
    Baek J, Wong D S, Li J, Au M H. Efficient generic construction of CCA-secure identity-based encryption from randomness extraction. The Computer Journal, 2016, 59(4): 508-521.Google Scholar
  5. [5]
    Chen Y, Zhang Z, Lin D, Cao Z. Identity-based extractable hash proofs and their applications. In Proc. the 10th Int. Conf. Applied Cryptography and Network Security, June 2012, pp.153-170.Google Scholar
  6. [6]
    Chen Y, Zhang Z, Lin D, Cao Z. CCA-secure IB-KEM from identity-based extractable hash proof system. The Comput. J., 2014, 57(10): 1537-1556.Google Scholar
  7. [7]
    Cramer R, Shoup V. Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption. In Proc. the Int. Conf. the Theory and Applications of Cryptographic Techniques, April 28-May 2, 2002, pp.45-64.Google Scholar
  8. [8]
    Chen R, Mu Y, Yang G, Susilo W, Guo F, Zhang M. Cryptographic reverse firewall via malleable smooth projective hash functions. In Proc. the 22nd Int. Conf. the Theory and Application of Cryptology and Information Security, December 2016, pp.844-876.Google Scholar
  9. [9]
    Chen R, Mu Y, Yang G, Susilo W, Guo F. Strong authenticated key exchange with auxiliary inputs. Designs, Codes and Cryptography, 2017, 85(1): 145-173.Google Scholar
  10. [10]
    Naor M, Segev G. Public-key cryptosystems resilient to key leakage. In Proc. the 29th Annual Int. Cryptology Conf., August 2009, pp.18-35.Google Scholar
  11. [11]
    Yang R, Xu Q, Zhou Y, Zhang R, Hu C, Yu Z. Updatable hash proof system and its applications. In Proc. the 20th European Symp. Research in Computer Security. September 2015, pp.266-285.Google Scholar
  12. [12]
    Agrawal S, Boneh D, Boyen X. Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE. In Proc. the 30th Annual Cryptology Conf., August 2010, pp.98-115.Google Scholar
  13. [13]
    Akavia A, Goldwasser S, Vaikuntanathan V. Simultaneous hardcore bits and cryptography against memory attacks. In Proc. the 6th Theory of Cryptography Conf., March 2009, pp.474-495.Google Scholar
  14. [14]
    Alwen J, Dodis Y, Wichs D. Leakage-resilient public-key cryptography in the bounded-retrieval model. In Proc. the 29th Annual Int. Cryptology Conf., August 2009, pp.36-54.Google Scholar
  15. [15]
    Dodis Y, Haralambiev K, López-Alt A, Wichs D. Cryptography against Continuous Memory Attacks. In Proc. the 51st Annual IEEE Symp. Foundations of Computer Science, October 2010, pp.511-520.Google Scholar
  16. [16]
    Chen Y, Zhang Z, Lin D, Cao Z. Anonymous identity-based hash proof system and its applications. In Proc. the 6th Int. Conf. Provable Security, September 2012, pp.143-160.Google Scholar
  17. [17]
    Chen Y, Zhang Z, Lin D, Cao Z. Generalized (identitybased) hash proof system and its applications. Security and Communication Networks, 2016, 9(12): 1698-1716.Google Scholar
  18. [18]
    Lai Q, Yang B, Yu Y, Chen Y, Bai J. Novel smooth hash proof systems based on lattices. The Comput. J., 2018, 61(4): 561-574.Google Scholar
  19. [19]
    Wee H. Efficient chosen-ciphertext security via extractable hash proofs. In Proc. the 30th Annual Cryptology Conf., August 2010, pp.314-332.Google Scholar
  20. [20]
    Zhang L, Zhang J, Mu Y. Novel leakage-resilient attributebased encryption from hash proof system. The Comput. J., 2017, 60(4): 541-554.Google Scholar
  21. [21]
    Zhang M, Zhang Y, Su Y, Huang Q, Mu Y. Attribute-based hash proof system under learning-with-errors assumption in obfuscator-free and leakage-resilient environments. IEEE Systems J., 2017, 11(2): 1018-1026.Google Scholar
  22. [22]
    Ajtai M. Generating hard instances of the short basis problem. In Proc. the 26th Int. Colloquium on Automata, Languages and Programming, July 1999, pp.1-9.Google Scholar
  23. [23]
    Alwen J, Peikert C. Generating shorter bases for hard random lattices. In Proc. the 26th Int. Symp. Theoretical Aspects of Computer Science, February 2009, pp.75-86.Google Scholar
  24. [24]
    Gentry C, Peikert C, Vaikuntanathan V. Trapdoors for hard lattices and new cryptographic constructions. In Proc. the 40th Annual ACM Symp. Theory of Computing, May 2008, pp.197-206.Google Scholar
  25. [25]
    Regev O. On lattices, learning with errors, random linear codes, and cryptography. Journal of the ACM, 2009, 56(6): Article No. 34.Google Scholar
  26. [26]
    Dodis Y, Goldwasser S, Kalai Y T, Peikert C, Vaikuntanathan V. Public-key encryption schemes with auxiliary inputs. In Proc. the 7th Theory of Cryptography Conf., February 2010, pp.361-381.Google Scholar
  27. [27]
    Lewko A, Rouselakis Y, Waters B. Achieving leakage resilience through dual system encryption. In Proc. the 8th Theory of Cryptography Conf., March 2011, pp.70-88.Google Scholar
  28. [28]
    Brakerski Z, Kalai Y T, Katz J, Vaikuntanathan V. Overcoming the hole in the bucket: Public-key cryptography resilient to continual memory leakage. In Proc. the 51st Annual IEEE Symp. Foundations of Computer Science, October 2010, pp.501-510.Google Scholar
  29. [29]
    Agrawal S, Dodis Y, Vaikuntanathan V, Wichs D. On continual leakage of discrete log representations. In Proc. the 19th Int. Conf. the Theory and Application of Cryptology and Information Security, December 2013, pp.401-420.Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  • Qi-Qi Lai
    • 1
    • 2
  • Bo Yang
    • 1
    • 2
    Email author
  • Yong Yu
    • 1
  • Zhe Xia
    • 3
  • Yan-Wei Zhou
    • 1
  • Yuan Chen
    • 4
  1. 1.School of Computer ScienceShaanxi Normal UniversityXi’anChina
  2. 2.State Key Laboratory of Information SecurityInstitute of Information Engineering, Chinese Academy of SciencesBeijingChina
  3. 3.School of Computer Science and TechnologyWuhan University of TechnologyWuhanChina
  4. 4.State Key Laboratory of Integrated Services NetworksXidian UniversityXi’anChina

Personalised recommendations