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

• 学术论文 • 上一篇    下一篇

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

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

  1. 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 Ke1,2, LIU Zhe-li2, JIA Chun-fu2, YANG Jun2, LÜ Shu-wang3   

  1. 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

摘要:

为有效解决多接收者时间相关密文检索问题,采用广播加密技术提出一对多公钥时控性可搜索加密机制——发送者将加密的数据发送至云服务器,使得仅授权用户组成员可检索下载包含特定关键词的密文,但只能在指定的未来时间之后解密.给出方案及其安全游戏模型的形式化定义,提出两种基于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 (PKTRSEOM).In our PKTRSEOM 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 PKTRSEOM and its security game model.Then,we construct two provably secure PKTRSEOM 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

中图分类号: