Asset Details
Do you wish to reserve the book?
字符串匹配的保密计算
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
字符串匹配的保密计算
Do you wish to request the book?
字符串匹配的保密计算
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
字符串匹配的保密计算
2022
Overview
安全多方计算是密码学界研究的热点问题, 保密判断字符串匹配是安全多方计算的常见问题之一, 其在文本处理领域中是非常重要的一个主题. 它可以用于数据处理、数据压缩、文本编辑、信息检索等多种应用中. 现有含通配符的字符串保密匹配算法大多数只能实现近似匹配, 且通配符的使用受个数、位置的限制, 使用不灵活. 本文设计了一种新的编码方法, 应用该编码方法和Paillier加法同态加密算法, 在半诚实模型下设计了字符串模式匹配的保密判定协议和含通配符的字符串保密匹配协议, 尤其是第二个协议有一些非常理想的特征, 字符串中可以包含零、一个或多个通配符, 通配符可以位于字符串的任意位置, 一个通配符可以代表任意数量的字符. 协议可以保密地实现字符串的精确匹配, 通配符的使用也很灵活. 其次, 由于协议是基于同态加密而不是Bloom Filter构造的, 从而消除了Bloom Filter造成的误判, 实现了更高水平的隐私保护. 采用模拟范例证明了协议的安全性, 效率分析表明所设计的协议是高效的.
Publisher
Chinese Association for Cryptologic Research, Journal of Cryptologic Research
Subject
