AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
Powered by AMiner. Clicking this button will take you away from SciOpen.
Home Journal of Computer Science and Technology Article
Article Link
Cite
EndNote(RIS) BibTeX
Collect
Submit Manuscript
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Regular Paper

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

School of Computer Science, Shaanxi Normal University, Xi’an 710119, China
State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences Beijing 100093, China
School of Computer Science and Technology, Wuhan University of Technology, Wuhan 430070, China
State Key Laboratory of Integrated Services Networks, Xidian University, Xi’an 710071, China
Show Author Information

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 encryptionidentity-based hash proof systemlatticeupdatableleakage-resilience

Electronic Supplementary Material

Download File(s)
jcst-33-6-1243-Highlights.pdf (91.4 KB)
jcst-33-6-1243_ESM.pdf (233 KB)

References

[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.
Crossref
[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.
Crossref
[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.
Crossref
[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.
Crossref Google Scholar
[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.
Crossref
[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.
Crossref Google Scholar
[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.
Crossref
[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.
Crossref
[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.
Crossref Google Scholar
[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.
Crossref
[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.
Crossref
[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.
Crossref
[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.
Crossref
[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.
Crossref
[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.
Crossref
[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.
Crossref
[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.
Crossref Google Scholar
[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.
Crossref Google Scholar
[19]
Wee H. Efficient chosen-ciphertext security via extractable hash proofs. In Proc. the 30th Annual Cryptology Conf., August 2010, pp.314-332.
Crossref
[20]

Zhang L, Zhang J, Mu Y. Novel leakage-resilient attributebased encryption from hash proof system. The Comput. J., 2017, 60(4): 541-554.
Crossref Google Scholar
[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.
Crossref Google Scholar
[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.
Crossref
[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.
[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.
Crossref
[25]

Regev O. On lattices, learning with errors, random linear codes, and cryptography. Journal of the ACM, 2009, 56(6): Article No. 34.
Crossref Google Scholar
[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.
Crossref
[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.
Crossref
[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.
Crossref
[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.
Crossref
Journal of Computer Science and Technology
Volume 33 Issue 6,
November 2018
Pages 1243-1260
DOI: 10.1007/s11390-018-1885-5
Cite this article:
Lai Q-Q, Yang B, Yu Y, et al. Updatable Identity-Based Hash Proof System Based on Lattices and Its Application to Leakage-Resilient Public-Key Encryption Schemes. Journal of Computer Science and Technology, 2018, 33(6): 1243-1260. https://doi.org/10.1007/s11390-018-1885-5

328

Views

2

Crossref

N/A

Web of Science

2

Scopus

1

CSCD

Altmetrics
Received: 19 October 2017
Revised: 17 September 2018
Published: 19 November 2018
©2018 LLC & Science Press, China
Return