期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

一种安全的具有匿名性的可搜索加密方案 被引量：2

Safe anonymous identity based public key encryption with keyword search
下载PDF
导出
摘要 2004年,Boneh等利用匿名的基于身份加密方案构造了一个公钥可搜索加密方案(PEKS),解决了特定环境下对加密数据进行检索的这一困难工作。已有的可搜索加密方案,都是实现对关键词信息的保护,其实一个真正安全的可搜索加密方案,在保证搜索能力的前提下,不仅要实现对关键词信息的保护,也要实现对消息查询方信息的保护。提出具有匿名性的基于身份可搜索方案(ANO-IBEKS)的构造算法,给出了方案在随机预言机模型下语义安全性的证明。该方案可以很好地解决大量数据交给第三方服务器存储(比如网络存储)的关键词密文查询问题,可以有效地保护查询关键词和查询者身份等敏感信息,无法追踪究竟是哪个用户查询了什么信息。 In 2004, Boneh using anonymous hierarchical identity-based encryption scheme constructed a public key searchable encryption scheme （Public Key Encryption with Keyword Search shorthand for PEKS）, which was proposed to solve the difficult task of the encrypted data to be retrieved under certain circumstances. For the existing searchable encryption schemes, the only purpose is to protect the information of keyword. In fact, a genuine safety PEKS should provide not only the security ofkeywords but also the security of users. So that, on the basis of existing anonymous hierarchical identity-based encryption scheme （ANO-IBE）, the scheme of Anonymous Identity Based Public Key Encryption with Keyword Search （ANO-IBEKS）is firstly proposed. The semantic security proof of ANO-IBEKS in the random oracle model is given. The program can provide the function of protect- ing both the information ofkeyword and identity of the users under the circumstance of a lot of data to the third party server stor- age（ such as network storage）. In this scheme, severs cannot track exactly which user queries relevant information.
作者 李双
机构地区 北京工商大学理学院
出处 《计算机工程与应用》 CSCD 2013年第16期97-102,共6页 Computer Engineering and Applications
基金 北京市属高等学校人才强教计划项目(No.201302) 国家自然科学基金(No.10990011 No.61272499)
关键词 可搜索加密 匿名性 双线性Diffie—Hellman问题 安全性证明 Public Key Encryption with Keyword Search （ PEKS ） anonymity Bilinear Diffie-Hellman （BDH） security proof
分类号 TP309 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献16

  • 1Boneh D,Di Crescenzo G,Ostrovsky R,et al.Public key en- cryption with keyword search[C]//LNCS 3027.Switzerland: Springer-Verlag, 2004: 506-522.
  • 2Boneh D, Franklin M.Identity-based eneryption from the weil pairing[C]//LNCS 2139.California: Springer-Verlag, 2001: 213-229.
  • 3A1-Riyami S,Paterson K.Certificateless public key cryptogra- phy[C]//LNCS 2332.Taiwan & Springer-Verlag, 2003 : 452-473.
  • 4Goyal V.Reducing trust in the PKG in identity-based crypto- systems[C]//LNCS 4622.California: Springer-Verlag, 2007: 430-447.
  • 5Shamir A.Identity-based cryptosystems and signature schemes[C]// LNCS 196.California: Springer-Verlag, 1985 : 48-53.
  • 6Fujisaki E, Okamoto T.Secure integration of asymmetric and symmetric encryption sehemes[C]//LNCS 1666.California: Springer-Verlag, 1999: 537-554.
  • 7Baek J, Safavi-Naini R, Susilo W.Public key encryption with keyword search revisited[C]//LNCS 5072: ICCSA 2008 Part 1.1taly: Springer-Verlag, 2008 : 1249-1259.
  • 8Rhee H S, Park J H, Susilo W, et al.Improved searchable public key encryption with designated tester[J].Journal of Systems and Software, 2010,83 (5) : 763-771.
  • 9Fujisaki E,Okamoto T.How to enhance the security of pub- lic key encryption at minimum cost[C]//LNCS 1560.Berlin: Springer, 1999 : 53-68.
  • 10Shao J, Cao Z, Liang X, et al.Proxy re-encryption with keyword search[J].Information Sciences, 2010,180 ( 13 ) : 2576-2587.

同被引文献26

  • 1Abdalla M,Bellare M,Catalano D,et al. Advances in Cryptology[C]// CRYPTO 2005. Springer Berlin Heidelberg, 2005 : 205-222.
  • 2Baek J,Safavi-Naini R,Susilo W. Computational Science and ItsApplications[C] // ICCSA 2008. Springer Berlin Heidelberg.2008:1249-1259.
  • 3Boneh D, Boyen X. Efficient selective-ID Identity based encryp-tion without random oracles[C] //Proc. of EUROCRYPT 2004.Springer Berlin Heidelberg.2004 : 223-238.
  • 4Boneh D, Di C G, Ostrovsky R,et al. Public Key Encryptionwith Keyword Search [C] // Proc. of EUROCRYPT 2004.Springer Berlin Heidelberg,2004: 506-522.
  • 5Canetti R, Goldreich 0. Halevi S. The random oracle methodolo-gy .revisited[C]//Proc. of 30th ACM STOC. ACM Press, 1998:209-218.
  • 6Canetti R, Halevi S, Katz J. Chosen-Ciphertext Security fromIdentity-Based Encryption [C] // Proc. of EUROCRYPT 2004.Springer Berlin Heidelberg,2004: 202-222.
  • 7Fang L,Susilo W,Ge C, et al. Public key encryption with key-word search secure against keyword guessing attacks withoutrandom oracle[J]. Information Sciences,2013,238 . 221-241.
  • 8Gentry C. Practical identity-based encryption without randomoracles[C] // Proc. of EUROCRYPT 2006. Springer-Verlag,2006:457-464.
  • 9Gu C,Pan Y,Z A H. Efficient Public Key Encryption with Key-word Search Schemes from Pairings[M] // Information Securityand Cryptology: Third SKLOIS Conference. 2008 : 372-382.
  • 10Waters B,Balfanz D’Durfee G,et al. Building an Encrypted andSearchable Audit Log[C] // Network and Distributed System Se-curity Symposium (NDSS 2004). 2004.

引证文献2

二级引证文献4

计算机工程与应用
2013年 第16期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部