期刊文献+

自适应安全的支持模式匹配的流加密方案

Adaptive secure stream encryption supporting pattern matching
下载PDF
导出
摘要 支持模式匹配的流加密方案为同时实现模式匹配以及用户隐私保护提供了解决思路。一方面,支持模式匹配的流加密方案可以对加密后的消息进行模式匹配操作,即通过密文查找某个关键字是否出现在明文中或出现在明文消息的哪些位置;另一方面,支持模式匹配的流加密方案的安全性保证了除模式匹配的结果外,不会泄露关于明文消息的任何额外信息。目前已经有很多关于支持模式匹配的流加密方案的工作,但尚没有支持模式匹配的流加密方案能够同时满足基于非交互式安全假设(特别是基于后量子假设)实现、具有自适应安全性以及支持带通配符的模式匹配。针对这一问题,首先,以函数加密方案为组件提出了一个支持模式匹配的流加密方案的通用构造方案。该通用构造方案具有自适应安全性且支持带通配符的模式匹配;进一步地,使用已有的基于容错学习假设的函数加密方案对支持模式匹配的流加密方案的通用构造方案进行实例化,并由此得到了一个基于非交互式后量子假设(容错学习假设)、具有自适应安全性和支持带通配符模式匹配的流加密实例化方案。 The stream encryption supporting pattern matching(SEPM)is a primitive proposed to provide privacy protection while doing pattern matching.On the one hand,one can use the SEPM to perform pattern matching on some ciphertext to find out whether and where a keyword exists in its corresponding plaintext.On the other hand,the security of the SEPM guarantees that no information about the plaintext will be revealed except for the results of pattern matching.Up to now,there have been several constructions of the SEPM,but none of them achieves the adaptive security from non-interactive assumptions(especially post-quantum assumptions),and supports pattern matching with the wildcard simultaneously.In this paper,we propose a new generic construction of the SEPM from a functional encryption(FE),achieving the adaptive security and supporting pattern matching with the wildcard.Further,we instantiate the generic construction of the SEPM by existing learning with error(LWE)-based instantiations of the FE.Finally,an SEPM scheme is obtained which could achieve the adaptive security from a non-interactive and post-quantum assumption(the LWE assumption)and could support pattern matching with the wildcard simultaneously.
作者 李一鸣 刘胜利 LI Yiming;LIU Shengli(Department of Computer Science and Engineering,Shanghai Jiao Tong University,Shanghai 200240,China;State Key Laboratory of Cryptology,Beijing 100878,China)
出处 《西安电子科技大学学报》 EI CAS CSCD 北大核心 2023年第4期1-10,共10页 Journal of Xidian University
基金 广东省基础与应用基础研究重大项目(2019B030302008) 国家自然科学基金(61925207) 国家重点研发计划(2022YFB2701500)。
关键词 公钥密码 模式匹配 后量子密码 自适应安全 public key cryptography pattern matching post-quantum cryptography adaptive security
  • 相关文献

参考文献1

二级参考文献11

  • 1Blaze M,Bleumer G,Strauss M.Divertible protocols and atomic proxy cryptography[C]//International Conference on the Theory and Application of Cryptographic Techniques.Berlin:Springer-Verlag,1998:127-144.
  • 2Ateniese G,Hohenberger S.Proxy Re-Signatures:New definitions,algorithms,and applications[C]//Proceedings of the ACM Conference on CCS.New York:ACM,2005:310-319.
  • 3Shao Jun,Cao Zhenfu,Wang Licheng,et al.Proxy Re-signature Schemes without Random Oracles[C]//Proceedings of Indecrypt 2007,LNCS 4859.Heidelberg:Springer-Verlag,2007:197-209.
  • 4Libert B,Vergnaud D.Multi-Use Unidirectional Proxy Re-Signatures[C]//Proceedings of the ACM Conference on CCS.New York:ACM,2008:511-520.
  • 5Shao Jun,Wei Guiyi,Ling Yun,et al.Unidirectional Identity-based Proxy re-signature[C]//Proceedings of the IEEE International Conference on Communications.Piscataway:IEEE,2011:1-5.
  • 6Gentry C,Peikert C,Vaikuntanathan V.Trapdoors for Hard Lattices and New Cryptographic Constructions[C]//Proceedings of the Annual ACM Symposium on Theory of Computing.New York:ACM,2008:197-206.
  • 7Lyubashevsky V.Lattice Signatures without Trapdoors[C]//Proceedings of Eurocrypt 2012,LNCS 7237.Heidelberg:Springer-Verlag,2012:738-755.
  • 8Xagawa K.Cryptography with Lattices[D].Tokyo:Tokyo Institute of Technology,2010.
  • 9Alwen J,Peiker C.Generating Shorter Bases for Hard Random Lattices[J].Theory of Computing Systems,2011,48(3):535-553.
  • 10Micciancio D,Regev O.Worst-case to Average-case Reductions Based on Gaussian Measures[J].SIAM Journal Computer,2007,37(1):267-302.

共引文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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