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

李一鸣; 刘胜利

doi:10.19665/j.issn1001-2400.2023.04.001

您当前的位置：

首页 >

文章列表页 >

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

网络空间安全专栏 | 更新时间：2023-10-18

- 自适应安全的支持模式匹配的流加密方案
- 暂无标题
- 西安电子科技大学学报 2023年50卷第4期页码：1-10
- 作者机构：
  
  1. 上海交通大学计算机科学与工程系,上海 200240
  2. 密码科学技术全国重点实验室,北京 100878
- 作者简介：
  
  [ "李一鸣(1996—),女,上海交通大学博士研究生,E-mail:[email protected]" ]
  刘胜利(1974—),女,教授,E-mail:[email protected]
- 基金信息：
  
  广东省基础与应用基础研究重大项目(2019B030302008);国家自然科学基金(61925207);国家重点研发计划(2022YFB2701500)
- DOI：10.19665/j.issn1001-2400.2023.04.001
  中图分类号：
扫描看全文
李一鸣, 刘胜利. 自适应安全的支持模式匹配的流加密方案[J]. 西安电子科技大学学报, 2023,50(4):1-10.
李一鸣, 刘胜利. 自适应安全的支持模式匹配的流加密方案[J]. 西安电子科技大学学报, 2023,50(4):1-10. DOI： 10.19665/j.issn1001-2400.2023.04.001.

DOI：

摘要

支持模式匹配的流加密方案为同时实现模式匹配以及用户隐私保护提供了解决思路。一方面,支持模式匹配的流加密方案可以对加密后的消息进行模式匹配操作,即通过密文查找某个关键字是否出现在明文中或出现在明文消息的哪些位置;另一方面,支持模式匹配的流加密方案的安全性保证了除模式匹配的结果外,不会泄露关于明文消息的任何额外信息。目前已经有很多关于支持模式匹配的流加密方案的工作,但尚没有支持模式匹配的流加密方案能够同时满足基于非交互式安全假设(特别是基于后量子假设)实现、具有自适应安全性以及支持带通配符的模式匹配。针对这一问题,首先,以函数加密方案为组件提出了一个支持模式匹配的流加密方案的通用构造方案。该通用构造方案具有自适应安全性且支持带通配符的模式匹配;进一步地,使用已有的基于容错学习假设的函数加密方案对支持模式匹配的流加密方案的通用构造方案进行实例化,并由此得到了一个基于非交互式后量子假设(容错学习假设)、具有自适应安全性和支持带通配符模式匹配的流加密实例化方案。

Abstract

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.

关键词

公钥密码模式匹配后量子密码自适应安全

Keywords

public key cryptographypattern matchingpost-quantum cryptographyadaptive security

references

SONG X D D, WAGNER D A, PERRIG A. Practical Techniques for Searches on Encrypted Data[C]// IEEE Symposium on Security & Privacy.Piscataway:IEEE, 2000:44-55.

BONEH D, CRESCENZO G D, OSTROVSKY R, et al. Public Key Encryption with Keyword Search[C]// Advances in Cryptology-EUROCRYPT 2004.Heidelberg:Springer, 2004:506-522.

DESMOULINS N, FOUQUE P, ONETE C, et al. Pattern Matching on Encrypted Streams[C]// Advances in Cryptology-ASIACRYPT 2018.Heidelberg:Springer, 2018:121-148.

SHERRY J, LAN C, POPA R A, et al. BlindBox:Deep Packet Inspection over Encrypted Traffic[C]// Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication (SIGCOMM 2015). New York: ACM, 2015:213-226.

ABDALLA M, BELLARE M, CATALANO D, et al. Searchable Encryption Revisited:Consistency Properties,Relation to Anonymous IBE,and Extensions[J]. Journal of Cryptology, 2008, 21(3):350-391. DOI:10.1007/s00145-007-9006-6http://doi.org/10.1007/s00145-007-9006-6http://link.springer.com/10.1007/s00145-007-9006-6http://link.springer.com/10.1007/s00145-007-9006-6

BKAKRIA A, CUPPENS N, CUPPENS F. Privacy-Preserving Pattern Matching on Encrypted Data[C]// Advances in Cryptology-ASIACRYPT 2020.Heidelberg:Springer, 2020:191-220.

BOUSCATIÉ É, CASTAGNOS G, SANDERS O. Public Key Encryption with Flexible Pattern Matching[C]// Advances in Cryptology - ASIACRYPT 2021.Heidelberg:Springer, 2021:342-370.

BONEH D, BOYEN X, GOH E. Hierarchical Identity Based Encryption with Constant Size Ciphertext[C]// Advances in Cryptology - EUROCRYPT 2005.Heidelberg:Springer, 2005:440-456.

江明明, 胡予濮, 王保仓, 等. 格上的代理重签名方案[J]. 西安电子科技大学学报, 2014, 41(2):20-24.

JIANG Mingming, HU Yupu, WANG Baocang, et al. Proxy Re-Signature Scheme over the Lattice[J]. Journal of Xidian University, 2014, 41(2):20-24.

PAN J X, WAGNER B. Short Identity-Based Signatures with Tight Security from Lattices[C]// Post-Quantum Cryptography-12th International Workshop (PQCrypto 2021).Heidelberg:Springer, 2021:360-379.

WU C H, KE L, DU Y S. Quantum Resistant Key-Exposure Free Chameleon Hash and Applications in Redactable Blockchain[J] Information Sciences, 2021, 548:438-449. DOI:10.1016/j.ins.2020.10.008http://doi.org/10.1016/j.ins.2020.10.008https://linkinghub.elsevier.com/retrieve/pii/S0020025520309956https://linkinghub.elsevier.com/retrieve/pii/S0020025520309956

ISHIBASHI R, YONEYAMA K. Post-Quantum Anonymous One-Sided Authenticated Key Exchange without Random Oracles[C]// Public Key Cryptography-PKC 2020.Heidelberg:Springer, 2022:35-65.

AGRAWAL S, MAITRA M, VEMPATI S N, et al. Functional Encryption for Turing Machines with Dynamic Bounded Collusion from LWE[C]// Advances in Cryptology - CRYPTO 2021.Heidelberg:Springer, 2021:239-269.

GARG R, GOYAL R, LU G, et al. Dynamic Collusion Bounded Functional Encryption from Identity-Based Encryption[C]// Advances in Cryptology - EUROCRYPT 2022.Heidelberg:Springer, 2022:736-763.

REGEV O. On Lattices,Learning with Errors,Random Linear Codes,and Cryptography[C]// Proceedings of the 37th Annual ACM Symposium on Theory of Computing. New York: ACM, 2009:84-93.

PEIKERT C. A Decade of Lattice Cryptography[J]. Foundations & Trends in Theoretical Computer Science, 2016, 10(4):283-424.

浏览量

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

一种Canetti-Krawczyk模型下的快速认证协议

一种改进的多模式匹配算法