一对多场景下的公钥时控性可搜索加密

doi:10.3969/j.issn.0372-2112.2015.04.019

电子学报 ›› 2015, Vol. 43 ›› Issue (4): 760-768.DOI: 10.3969/j.issn.0372-2112.2015.04.019

一对多场景下的公钥时控性可搜索加密

袁科^1,2, 刘哲理², 贾春福², 杨骏², 吕述望³

1. 河南大学计算机与信息工程学院, 河南开封 475004;
2. 南开大学计算机与控制工程学院, 天津 300071;
3. 中国科学院信息工程研究所信息安全国家重点实验室, 北京 100093

收稿日期:2014-01-27 修回日期:2014-09-02 出版日期:2015-04-25
- 通讯作者:
- 贾春福
- 作者简介:
- 袁科, 男,1982年生,河南南阳人,博士,2014年毕业于南开大学,现为河南大学副教授,主要研究方向:密码学、信息安全,E-mail:yuanke_hhhh@163.com;刘哲理, 男,1978年生,山东潍坊人,博士后,硕士生导师,主要研究方向:密码学应用、信息安全,E-mail:liuzheli@nankai.edu.cn
- 基金资助:
- 国家"973"重点基础研究计划 (No.2013CB834204); 国家自然科学基金 (No.61272423,No呕1300241); 天津市自然科学基金 (No.13JCNJC00300); 高等学校博士科学专项卡科研基金 (No.20120031120036)

Public Key Timed-Release Searchable Encryption in One-to-Many Scenarios

YUAN Ke^1,2, LIU Zhe-li², JIA Chun-fu², YANG Jun², LÜ Shu-wang³

1. School of Computer and Information Engineering, Henan University, Kaifeng, Henan 475004, China;
2. College of Computer and Control Engineering, NankaiUniversity, Tianjin, 300071, China;
3. State Key Laboratory of InformationSecurity, Institute of Information Engineering, Chinese Academy of Sciences, Beijing, 100093, China

Received:2014-01-27 Revised:2014-09-02 Online:2015-04-25 Published:2015-04-25
- Supported by:
- National Program on Key Basic Research Project of China (973 Program) (No.2013CB834204) (No.2013CB834204); National Natural Science Foundation of China (No.61272423, No.1300241); Natural Science Foundation of Tianjin Municipality, China (No.13JCNJC00300); University Doctoral Research Foundation of China (No.20120031120036)

摘要/Abstract

摘要：

为有效解决多接收者时间相关密文检索问题,采用广播加密技术提出一对多公钥时控性可搜索加密机制——发送者将加密的数据发送至云服务器,使得仅授权用户组成员可检索下载包含特定关键词的密文,但只能在指定的未来时间之后解密.给出方案及其安全游戏模型的形式化定义,提出两种基于q-DBDHI问题的可证明安全方案,并严格证明所提方案在自适应选择明文攻击下是安全的.效率分析表明,两种方案在执行过程中,实现了计算、存储、传输规模与用户规模无关;与相关方案相比,方案2具有更高效率.

关键词: 定时发布, 可搜索加密, 一对多, 可证明安全

Abstract:

To solve the multi-receiver time-dependent ciphertext retrieval problem efficiently,by borrowing the technique of identity-based broadcast encryption,we propose a cryptosystem of one to many public key timed-release searchableencryption (PKTRSE_OM).In our PKTRSE_OM model,the sender transmits anencrypted message to cloud server so that only the intended authorized user group member can search the target ciphertext containing specified keywords,but cannot decrypt it until the release time in the future.We formalize the notion of PKTRSE_OM and its security game model.Then,we construct two provably secure PKTRSE_OM schemes which are secure under the q-DBDHI assumption and give the rigorous proof for both schemes.The efficiency analysis shows that the two schemes achieve constant costs from the sender's and the recipient's points of view in the running process of the system and the second scheme is more efficient than the relevant schemes.

Key words: timed-release, searchable encryption, one-to-many, provable security

中图分类号:

TP309.07

. 一对多场景下的公钥时控性可搜索加密[J]. 电子学报, 2015, 43(4): 760-768.

. Public Key Timed-Release Searchable Encryption in One-to-Many Scenarios[J]. Acta Electronica Sinica, 2015, 43(4): 760-768.

参考文献

[1] R L Rivest,A Shamir,D A Wagner.Time-lock puzzles and timed-release crypto,MIT/LCS/TR-684[R/OL].Cambridge,MA:MIT's Laboratory of Computer Science.http://publications.csail.mit.edu/lcs/pubs/pdf/MIT-LCS-TR-684.pdf,1996-02-01.
[2] D Boneh,G D Crescenzo,R Ostrovsky,G Persiano.Public key encryption with Keyword search[A].Proceedings of the 23rd International Conference on Advances in Cryptology-Eurocrypt 2004[C].Berlin:Springer,2004.506-522.
[3] K Yuan,Z Liu,C Jia,J Yang,S Lv.Public key timed-release searchable encryption[A].Proceedings of the 4th IEEE International Conference on Emerging IntelligentData and Web Technologies[C].Piscataway,NJ:IEEE,2013.241-248.
[4] D Boneh,X Boyen.Efficient selective-id secure identity-based encryption without random oracles[A].Proceedings of the 23rd International Conference on Advances in Cryptology-EUROCRYPT 2004[C].Berlin:Springer,2004.223-238.
[5] C Delerablée.Identity-based broadcast encryption with constant size ciphertexts and private keys[A].Proceedings of the 13th International Conference on Advances in Cryptology-ASIACRYPT 2007[C].Berlin:Springer,2007.200-215.
[6] T May.Timed-release crypto[EB/OL].http://www.cyphernet.org/cyphernomicon/chapter14/14.5.html.1993.
[7] 袁科,刘哲理,贾春福,马昊玉,吕述望.TRE加密技术研究[J].计算机研究与发展,2014,51(6):1206-1220. Yuan Ke,Liu Zhe-li,Jia Chun-fu,Ma Hao-yu,Lü Shu-wang.Research on timed-release encryption[J].Journal of Computer Research and Development,2014,51(6):1206-1220.(in Chinese).
[8] J Cathalo,B Libert,J-J Quisquater.Efficient and non-interactive timed-release encryption[A].Proceedings of the 7th International Conference on Information and Communications Security[C].Berlin:Springer,2005.291-303.
[9] K Chalkias,D Hristu-Varsakelis,G Stephanides.Improved anonymous timed-release encryption[A].Proceedings of the 12th European Symposium on Computer Security—ESORICS 2007[C].Berlin:Springer,2007.311-326.
[10] K Liang,Q Huang,R Schlegel,D S Wong,C Tang.A conditional proxy broadcast re-encryption scheme supporting timed-release[A].Proceedings of the 9th International Conference on Information Security Practice and Experience[C].Berlin:Springer,2013:132-146.
[11] K Emura,A Miyaji,K Omote.A timed-release proxy re-encryption scheme and its application to fairly-opened multicast communication[A].Proceedings of the 4th International Conference on Provable Security[C].Berlin:Springer,2010.200-213.
[12] K Emura,A Miyaji,K Omote.A timed-release proxy re-encryption scheme[J].IEICETrans on Fundamentals of Electronics,Communications and Computer Sciences,2011,E94-A(8):1682-1695.
[13] Y H Hwang,P J Lee.Public key encryption with conjunctive keyword search and its extension to a multi-user system[A].Proceedings of the 1st International Conference on Pairing-Based Cryptography–Pairing 2007[C].Berlin:Springer,2007.2-22.
[14] F Bao,R H Deng,X Ding,Y.Yang.Private query on encrypted data in multi-user settings[A].Proceedings of the 4th International Conference on Information Security Practice and Experience[C].Berlin:Springer,2008.71-85.
[15] F Zhao,T Nishide,K Sakurai.Multi-user keyword search scheme for secure data sharing with fine-grained access control[A].Proceedings of the 14th International Conference on Information Security and Cryptology-ICISC 2011[C].Berlin:Springer,2012.406-418.
[16] R Canetti,S Halevi,J Katz.Chosen-ciphertext security from identity-based encryption[A].Proceedings of the 23rd International Conference on Advances in Cryptology-Eurocrypt 2004[C].Berlin:Springer,2004.207-222.

一对多场景下的公钥时控性可搜索加密

Public Key Timed-Release Searchable Encryption in One-to-Many Scenarios

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

[1]	尹安琪, 曲彤洲, 郭渊博, 汪定, 陈琳, 李勇飞. 格上基于密文标准语言的可证明安全两轮口令认证密钥交换协议[J]. 电子学报, 2022, 50(5): 1140-1149.
[2]	侯红霞, 杨波, 张丽娜, 张明瑞. 安全的两方协作SM2签名算法[J]. 电子学报, 2020, 48(1): 1-8.
[3]	刘良桂, 孙辉, 贾会玲, 张宇. 面向高效加密云数据排序搜索的类别分组索引方法[J]. 电子学报, 2019, 47(2): 331-336.
[4]	李子臣, 张卷美, 杨亚涛, 张峰娟. 基于NTRU的全同态加密方案[J]. 电子学报, 2018, 46(4): 938-944.
[5]	张俊伟, 陈治平, 马建峰, 杨力. 可证明安全的基于位置的Prover-to-Prover密钥交换协议[J]. 电子学报, 2016, 44(1): 14-20.
[6]	张宇, 陈晶, 杜瑞颖, 周庆, 郑明辉. 适于车载网安全通信的高效签密方案[J]. 电子学报, 2015, 43(3): 512-517.
[7]	郭奕旻, 李顺东, 陈振华, 刘新. 一种轻量级隐私保护的RFID群组证明协议[J]. 电子学报, 2015, 43(2): 289-292.
[8]	马骏, 郭渊博, 马建峰, 刘西蒙, 李琦. 物联网感知层基于资源分层的多用户访问控制方案[J]. 电子学报, 2014, 42(1): 28-35.
[9]	裴士辉;赵永哲;赵宏伟. 基于遍历矩阵的公钥加密方案[J]. 电子学报, 2010, 38(8): 1908-1913.
[10]	徐津;温巧燕;王大印. 一种新的一阶段加密认证模式[J]. 电子学报, 2009, 37(10): 2187-2192.
[11]	粟栗, 崔国华, 李俊, 郑明辉. 签密的仲裁安全与仲裁安全的签密方案[J]. 电子学报, 2007, 35(11): 2117-2122.
[12]	李进;张方国;王燕鸣. 两个高效的基于分级身份的签名方案[J]. 电子学报, 2007, 35(1): 150-152.
[13]	王念平, 金晨辉, 余昭平. 非平衡Feistel网络的线性可证明安全性的进一步分析[J]. 电子学报, 2006, 34(10): 1799-1802.
[14]	王大印, 林东岱, 吴文玲. 一种可证明安全的消息认证码[J]. 电子学报, 2006, 34(10): 1812-1816.
[15]	王彩芬, 贾爱库, 刘军龙, 于成尊. 基于签密的多方认证邮件协议[J]. 电子学报, 2005, 33(11): 2070-2073.