基于可提取哈希证明系统的多策略加密方案

doi:10.3969/j.issn.0372-2112.2019.02.012

电子学报 ›› 2019, Vol. 47 ›› Issue (2): 337-343.DOI: 10.3969/j.issn.0372-2112.2019.02.012

基于可提取哈希证明系统的多策略加密方案

张丽娜^1,2,3, 杨波^1,3, 黄梅娟^1,3,4, 贾艳艳²

1. 陕西师范大学计算机科学学院, 陕西西安 710119;
2. 西安科技大学计算机科学与技术学院, 陕西西安 710054;
3. 中国科学院信息工程研究所信息安全国家重点实验室, 北京 100093;
4. 宝鸡文理学院数学与信息科学学院, 陕西宝鸡 721013

收稿日期:2018-01-22 修回日期:2018-06-22 出版日期:2019-02-25
- 通讯作者:
- 杨波
- 作者简介:
- 张丽娜 女,1981年出生,博士,副教授,研究方向为密码学、信息安全.E-mail:zhangln@xust.edu.cn
- 基金资助:
- 国家重点研发计划 (No.2017YFB0802000）; 国家自然科学基金 (No.61572303，No.61772326）; 中国科学院信息工程研究所信息安全国家重点实验室开放课题 (No.2017-MS-03）; "十三五"国家密码发展基金 (No.MMJJ20180217）; 中央高校基本科研业务费项目 (No.GK201702004）; 陕西省自然科学基础研究计划 (No.2017JQ6026）; 榆林市科技计划产学研项目 (No.2014CXY-08-01）

A Multi-Policy Encryption Scheme Based on Extractable Hash Proof Systems

ZHANG Li-na^1,2,3, YANG Bo^1,3, HUANG Mei-juan^1,3,4, JIA Yan-yan²

1. School of Computer Science, Shaanxi Normal University, Xi'an, Shaanxi 710119, China;
2. Department of Computing Science and Technology, Xi'an University of Science and Technology, Xi'an, Shaanxi, 710054, China;
3. State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing 100093, China;
4. Department of Mathematics, Baoji University of Arts and Sciences, Baoji, Shaanxi 721013, China

Received:2018-01-22 Revised:2018-06-22 Online:2019-02-25 Published:2019-02-25
- Supported by:
- National Key Research and Development Program of China (No.2017YFB0802000); National Natural Science Foundation of China (No.61572303, No.61772326); Open Project of State Key Laboratory of Information Security of Institute of Information Engineering, CAS (No.2017-MS-03); National Cryptography Development Fund during the 13th Five-year Plan (No.MMJJ20180217); Program of Fundamental Research Funds for the Central Universities (No.GK201702004); Natural Science Basic Research Program of Shaanxi Province (No.2017JQ6026); Industry-University-Research Project of Yulin Science Technology Program (No.2014CXY-08-01)

摘要/Abstract

摘要： 哈希证明系统由Cramer-Shoup在2002年首次提出，到目前为止仍是密码工作者的研究热点之一.进而，Wee在2010年提出可提取哈希证明系统的概念，其可用来构造基于查找性困难假设的公钥加密方案.本文在可提取哈希证明系统之上，通过重新定义系统参数的意义，扩大了可提取哈希证明系统的密码学应用范围.我们利用可提取哈希证明系统的框架构造了一个基本的基于Diffie-Hellman关系的All-But-One可提取哈希证明系统.在此基础上细粒度了辅助输入，引入权重计算，给出了一个基于标签和可变策略的CCA加密方案，并进行了详细的安全性证明.特别的，该方案比可提取具有更丰富的抽象表达，即是All-But-N的，也即在提取模式中由标签决定的分支数量可以有n个.同时，该方案是基于困难性可搜索问题，本质上是基于计算性的Diffie-Hellman问题.

关键词: Diffie-Hellman关系, 选择密文攻击, 哈希证明系统, 可提取哈希证明系统, 多策略

Abstract: Hash proof systems,which was first introduced by Cramer and Shoup in 2002,is still one of the hottest research topics in cryptography.And then Wee proposed the concept of extractable hash proof system in 2010 and it is a concept extension on the hash proof system and as a paradigm of constructing PKE from search problems.On the basis of the extractable hash proof system,this paper expands the application scope of the extractable hash proof system by redefining the meaning of system parameters.We construct a basic All-But-One extractable hash proof system based on Diffie-Hellman relations by using the framework of extractable hash proof system.Based on this,fine-grained auxiliary input and weighting calculation are introduced.A new variable-policy CCA encryption scheme based on tag is proposed,and the security proof is also given in details.In particular,this scheme is a richer abstraction of extractable hash proof system that it is All-But-N,which means that the number of branches determined by the tag in the extraction mode could be n.At the same time,the scheme is based on the difficulty of the search problem and is essentially based on the computational Diffie-Hellman problem.

Key words: Diffie-Hellman relations, chosen ciphertext attack, hash proof systems, extractable Hash proof system, multi-policy

中图分类号:

TP309

张丽娜, 杨波, 黄梅娟, 等. 基于可提取哈希证明系统的多策略加密方案[J]. 电子学报, 2019, 47(2): 337-343.

ZHANG Li-na, YANG Bo, HUANG Mei-juan, et al. A Multi-Policy Encryption Scheme Based on Extractable Hash Proof Systems[J]. Acta Electronica Sinica, 2019, 47(2): 337-343.

参考文献

[1] Cramer R,Shoup V.Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption[A].International Conference on the Theory and Applications of Cryptographic Techniques[C].Berlin Heidelberg:Springer,2002.45-64.
[2] Cramer R,Shoup V.A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack[A].Annual International Cryptology Conference[C].Berlin Heidelberg:Springer,1998.13-25.
[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[A].Annual International Conference on the Theory and Applications of Cryptographic Techniques[C].Berlin Heidelberg:Springer,2010.113-134.
[4] Chen Y,Zhang ZY,Lin DD,Cao ZF.Generalized(identity-based)Hash proof system and its applications[J].Security and Communication Networks,2016,9(12):1698-1716.
[5] 来齐齐,杨波,陈原,韩露露,白健.格上基于身份哈希证明系统的新型构造[J].软件学报,2018,http://www.jos.org.cn/1000-9825/5357.html. Lai QQ,Yang Bo,Chen Y,Han LL,Bai Jian.Novel construction of identity-based hash proof system based on lattices[J].Journal of Software,2018, http://www.jos.org.cn/1000-98255357.htm. (in Chinese)
[6] Zhu D,Zhang R,Jia D.Public-key encryption with simulation-based sender selective-opening security[A].International Conference on Provable Security[C].Cham:Springer,2017.361-380.
[7] Wee H.KDM-security via homomorphic smooth projective hashing[A].IACR International Workshop on Public Key Cryptography[C].Berlin Heidelberg:Springer,2016.159-179.
[8] Abdalla M,Benhamouda F,Pointcheval D.Disjunctions for hash proof systems:New constructions and applications[A].Annual International Conference on the Theory and Applications of Cryptographic Techniques[C].Berlin Heidelberg:Springer,2015.69-100.
[9] Benhamouda F,Blazy O,Chevalier C,et al.New techniques for SPHFs and efficient one-round PAKE protocols[A].Annual International Cryptology Conference[C].Berlin Heidelberg:Springer,2013.449-475.
[10] Katz J,Vaikuntanathan V.Smooth projective Hashing and password-based authenticated key exchange from lattices[A].International Conference on the Theory and Application of Cryptology and Information Security[C].Berlin Heidelberg:Springer,2009.636-652.
[11] Blazy,O,Pointcheval,D,& Vergnaud,D.(2012,March).Round-optimal privacy-preserving protocols with smooth projective hash functions[A].Theory of Cryptography Conference[C].Berlin Heidelberg:Springer,2012.94-111.
[12] Kalai Y T.Smooth projective hashing and two-message oblivious transfer[A].Annual International Conference on the Theory and Applications of Cryptographic Techniques[C].Berlin Heidelberg:Springer,2005.78-95.
[13] Garg S,Gentry C,Sahai A,et al.Witness encryption and its applications[A].Proceedings of the forty-fifth annual ACM symposium on Theory of computing[C].New York USA:ACM,2013.467-476.
[14] Abdalla M,Chevalier C,Pointcheval D.Smooth projective hashing for conditionally extractable commitments[A].Annual International Cryptology Conference[C].Berlin Heidelberg:Springer,2009.671-689.
[15] Hemenway B,Ostrovsky R.Lossy trapdoor functions from smooth homomorphic Hash proof systems[J].Electronic Colloquium on Computational Complexity,2009,16(127):127-127.
[16] Wee H.Dual projective hashing and its applications-lossy trapdoor functions and more[A].Annual International Conference on the Theory and Applications of Cryptographic Techniques[C].Berlin Heidelberg:Springer,2012.246-262.
[17] Zhang M,Zhang Y,Su Y,et al.Attribute-based hash proof system under learning-with-errors assumption in obfuscator-free and leakage-resilient environments[J].IEEE Systems Journal,2017,11(2):1018-1026.
[18] Zhang L,Zhang J,Mu Y.Novel leakage-resilient attribute-based encryption from hash proof system[J].The Computer Journal,2016,60(4):541-554.
[19] Wee H.Efficient chosen-ciphertext security via extractable hash proofs[A].Annual International Cryptology Conference[C].Berlin Heidelberg:Springer,2010.314-332.
[20] Chen Y,Zhang Z.Publicly evaluable pseudorandom functions and their applications[J].Journal of Computer Security,2016,24(2):289-320.
[21] Faonio A,Nielsen J B,Venturi D.Predictable arguments of knowledge[A].IACR International Workshop on Public Key Cryptography[C].Berlin Heidelberg:Springer,2017.121-150.
[22] Goyal R,Goyal V.Overcoming cryptographic impossibility results using blockchains[A].Theory of Cryptography Conference[C].Cham:Springer,2017.529-561.
[23] Hu C,Liu P,Guo S.Public key encryption secure against related-key attacks and key-leakage attacks from extractable hash proofs[J].Journal of Ambient Intelligence and Humanized Computing,2016,7(5):681-692.
[24] Goldreich O,Levin L A.A hard-core predicate for all one-way functions[A].Proceedings of the twenty-first annual ACM symposium on Theory of computing[C].Seattle,Washington:ACM,1989.25-32.
[25] Dodis Y,Goldwasser S,Kalai Y,et al.Public-key encryption schemes with auxiliary inputs[A].Theory of Cryptography Conference[C].Berlin Heidelberg:Springer,2010.361-381.
[26] Canetti R,Halevi S,Katz J.Chosen-ciphertext security from identity-based encryption[A].International Conference on the Theory and Applications of Cryptographic Techniques[C].Berlin Heidelberg:Springer,2004.207-222.
[27] Cash D,Kiltz E,Shoup V.The twin Diffie-Hellman problem and applications[J].Journal of Cryptology,2009,22(4):470-504.

基于可提取哈希证明系统的多策略加密方案

A Multi-Policy Encryption Scheme Based on Extractable Hash Proof Systems

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 9

编辑推荐

Metrics

[1]	吕阳, 钱斌, 胡蓉, 张梓琪. 增强人工蜂群算法求解半导体最终测试调度问题[J]. 电子学报, 2021, 49(9): 1708-1715.
[2]	谢承旺, 张飞龙, 陆建波, 肖驰, 龙广林. 一种多策略协同的多目标萤火虫算法[J]. 电子学报, 2019, 47(11): 2359-2367.
[3]	侯红霞, 杨波, 周彦伟. 基于对偶系统的匿名身份基哈希证明系统及其应用[J]. 电子学报, 2018, 46(7): 1675-1682.
[4]	韩博文, 姚佩阳, 孙昱. 基于多目标MSQPSO算法的UAVS协同任务分配[J]. 电子学报, 2017, 45(8): 1856-1863.
[5]	王亚辉, 吴金妹, 贾晨辉. 基于动态种群多策略差分进化模型的多目标进化算法[J]. 电子学报, 2016, 44(6): 1472-1480.
[6]	符强, 汪鹏君, 童楠, 王铭波, 张会红. 基于多策略离散粒子群算法的MPRM电路延时与面积优化[J]. 电子学报, 2016, 44(5): 1202-1207.
[7]	谢承旺, 邹秀芬, 夏学文, 王志杰. 一种多策略融合的多目标粒子群优化算法[J]. 电子学报, 2015, 43(8): 1538-1544.
[8]	朱大林, 詹腾, 张屹, 郑小东. 多策略差分进化的元胞多目标粒子群算法[J]. 电子学报, 2014, 42(9): 1831-1838.
[9]	葛爱军, 马传贵, 程庆丰. 标准模型下CCA2安全且固定密文长度的模糊基于身份加密方案[J]. 电子学报, 2013, 41(10): 1948-1952.