微信服务号

微信订阅号

2025-4-24- 18
Home > Archive>Volume 29, Issue 7, 2018 >1880-1892. DOI:10.13328/j.cnki.jos.005357
PDF HTML XML Export Cite reminder
Novel Construction of Identity-Based Hash Proof System Based on Lattices
Author:
Affiliation:

Fund Project:

National Natural Science Foundation of China (61402353, 61572303, 61772326); Fundamental Research Funds for the Central Universities (GK201603084, GK201702004); National Key Research and Development Program of China (2017YFB0802003, 2017YFB0802004); Foundation of State Key Laboratory of Information Security, Institute of Information Engineering, CAS (2017-MS-03); National Cryptography Development Fund During the 13th Five-Year Plan Period (MMJJ20170216)

  • Article
    • | |
  • Metrics
    • |
  • Reference [24]
    • |
  • Related [20]
    • | | |
  • Comments
    Abstract:

    Privacy protection is an important security issue in today's big data information era. As one of theoretical and technical bases, cryptography can be utilized to protect several kinds of privacy information, such as content and identity. Identity-Based hash proof system is a basic cryptographic primitive, which can be used to construct lots of schemes for privacy protection. Through analyzing all existing identity-based hash proof systems based on lattices, this work reveals that one of their common deficiencies is the large bit size of ciphertext, which further results in the low efficiency of the related cryptographic schemes. Thus it is of great significance to reduce the size of their cipheretexts. In this paper, a new hash proof system is first presented based on the learning with errors assumption in the standard model, and the smoothness of the system is proved through employing the properties of discrete Gaussian distribution and smooth parameter over lattices. Then, in order to transform this new hash proof system into the identity setting, the preimage sampling function proposed by Gentry, et al. is used to sample the identity secret key for any identity id with the help of random oracle. As an extension for this new hash proof system based on lattices, an updatable hash proof system can also be obtained in the standard model. Finally, the efficiency of these new constructions is analyzed, and a comparison with other existing constructions is performed.

    Reference
    [1] Feng DG, Zhang M, Li H. Big data security and privacy protection. Ji Suan Ji Xue Bao/Chinese Journal of Computers, 2014,37(1):246-258(in Chinese with English abstract).
    [2] Peng CG, Ding HF, Zhu YJ, Tian YL, Fu ZF. Information entropy models and privacy metrics methods for privacy protection. Ruan Jian Xue Bao/Journal of Software, 2016,27(8):1891-1903(in Chinese with English abstract). http://www.jos.org.cn/1000-9825/5096.htm[doi:10.13328/j.cnki.jos.005096]
    [3] Alwen J, Dodis Y, Naor M, Segev G, Walfish S, Wichs D, Walfish, S, Wichs, D. Public-Key encryption in the bounded-retrieval model. In:Gilbert H, ed. Proc. of the 29th Annual Int'l Conf. on the Theory and Applications of Cryptographic Techniques (EUROCRYPT 2010). Berlin:Springer-Verlag, 2010. 113-134.
    [4] Naor M, Segev G. Public-Key cryptosystems resilient to key leakage. In:Halevi S, ed. Proc. of the 29th Annual Int'l Cryptology Conf. (CRYPTO 2009). Berlin:Springer-Verlag, 2010. 18-35.
    [5] Chow SM, Dodis Y, Rouselakis Y, Waters B. Practical leakage-resilient identity-based encryption from simple assumptions. In:Al-Shaer E, Keromytis AD, Shmatikov V, eds. Proc. of the 17th ACM Conf. on Computer and Communications Security (CCS 2010). New York:ACM, 2010. 152-161.
    [6] Chen Y, Zhang ZY, Lin DD, Cao ZF. Anonymous identity-based hash proof system and its applications. In:Takagi T, Wang GL, Qin ZG, Jiang SQ, Yu Y, eds. Proc. of the 6th Int'l Conf. on Provable Security (ProvSec 2012). Berlin:Springer-Verlag, 2010. 143-160.
    [7] Chen Y, Zhang ZY, Lin DD, Cao ZF. Generalized (identity-based) hash proof system and its applications. Security and Communication Networks, 2016,9(12):1698-1716.
    [8] Chen Y, Zhang ZY, Lin DD, Cao ZF. Identity-Based extractable hash proofs and their applications. In:Boureanu I, Owesarski P, Vaudenay S, eds. Proc. of the 12th Int'l Conf. on Applied Cryptography and Network Security (ACNS 2012). Berlin:Springer-Verlag, 2012. 153-170.
    [9] Chen Y, Zhang ZY, Lin DD, Cao ZF. CCA-Secure IB-KEM from identity-based extractable hash proof system. The Computer Journal, 2014,57(10):1537-1556.
    [10] Gentry C, Peikert C, Vaikuntanathan V. Trapdoors for hard lattices and new cryptographic constructions. In:Dwork C, ed. Proc. of the 40th Annual ACM Symp. on Theory of Computing (STOC 2008). New York:ACM, 2010. 197-206.
    [11] Katz J, Vaikuntanathan V. Smooth projective hashing and password-based authenticated key exchange from lattices. In:Matsui M, ed. Proc. of the 15th Int'l Conf. on the Theory and Application of Cryptology and Information Security (ASIACRYPT 2009). Berlin:Springer-Verlag, 2009. 636-652.
    [12] Ajtai M. Generating hard instances of the short basis problem. In:Bratko I, Dzeroski S, eds. Proc. of the 16th Int'l Conf. on Machine Learning (ICALP 1999). Berlin:Springer-Verlag, 1999. 1-9.
    [13] Alwen J, Peikert C. Generating shorter bases for hard random lattices. Theory of Computing Systems, 2011,48(3):535-553.
    [14] Micciancio D, Regev O. Worst-Case to average-case reductions based on gaussian measures. SIAM Journal on Computing, 2007,37(1):267-302.
    [15] Peikert C. Limits on the hardness of lattice problems in lp norms. Computational Complexity, 2008,17(2):300-351.
    [16] Regev O. On lattices, learning with errors, random linear codes, and cryptography. Journal of the ACM, 2009,56(6):34:1-34:40.
    [17] Agrawal S, Boneh D, Boyen X. Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE. In:Rabin T, ed. Proc. of the 30th Annual Cryptology Conf. (CRYPTO 2010). Berlin:Springer-Verlag, 2010. 98-115.
    [18] Agrawal S, Boneh D, Boyen X. Efficient lattice (H)IBE in the standard model. In:Gilbert H, ed. Proc. of the 29th Annual Int'l Conf. on the Theory and Applications of Cryptographic Techniques (EUROCRYPT 2010). Berlin:Springer-Verlag, 2010. 553-572.
    [19] Cramer R, Shoup V. Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption. In:Knudsen LR, ed. Proc. of the 21st Annual Int'l Conf. on the Theory and Applications of Cryptographic Techniques (EUROCRYPT 2002). Berlin:Springer-Verlag, 2002. 45-64.
    [20] Hofheinz D, Kiltz E. Secure hybrid encryption from weakened key encapsulation. In:Menezes A, ed. Proc. of the 27th Annual Int'l Cryptology Conf. (CRYPTO 2007). Berlin:Springer-Verlag, 2007. 553-571.
    [21] Yang RP, Xu QL, Zhou Y., Zhang R, Hu C, Yu Z. Updatable hash proof system and its applications. In:Proc. of the 20th European Symp. on Research in Computer Security (ESORICS 2015). Berlin:Springer-Verlag, 2015. 266-285.
    附中文参考文献:
    [1] 冯登国,张敏,李昊.大数据安全与隐私保护.计算机学报,2014,37(1):246-258.
    [2] 彭长根,丁红发,朱义杰,田有亮,符祖峰.隐私保护的信息熵模型及其度量方法.软件学报,2016,27(8):1891-1903. http://www.jos.org.cn/1000-9825/5096.htm[doi:10.13328/j.cnki.jos.005096]
    Cited by
    Comments
    Comments
    分享到微博
    Submit
Get Citation

来齐齐,杨波,陈原,韩露露,白健.格上基于身份哈希证明系统的新型构造.软件学报,2018,29(7):1880-1892

Copy
Share
Article Metrics
  • Abstract:4710
  • PDF: 7569
  • HTML: 3313
  • Cited by: 0
History
  • Received:May 29,2017
  • Revised:July 13,2017
  • Online: October 17,2017
Links:Institute of Software, CASChina Computer FederationCASNSFC
You are the first2038207Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address：4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code：100190
Phone：010-62562563 Fax：010-62562533 Email：jos@iscas.ac.cn
Technical Support：Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063