| 无条件安全的隐私保护的集合模式匹配协议 |
| |
| 引用本文： | 郑强,罗守山,辛阳,谷勇浩.无条件安全的隐私保护的集合模式匹配协议[J].北京邮电大学学报,2009,32(1):99-102. |
| |
| 作者姓名： | 郑强 罗守山 辛阳 谷勇浩 |
| |
| 作者单位： | 北京邮电大学 网络与交换技术国家重点实验室,北京,100876;北京邮电大学 网络与信息攻防技术教育部重点实验室,北京,100876;北京邮电大学 灾备技术国家工程实验室,北京,100876 |
| |
| 基金项目： | 国家高技术研究发展计划(863计划)，国家自然科学基金，国家重点基础研究发展规划(973计划) |
| |
| 摘 要： | 在信息论通信模型下，基于秘密分享模式和将集合的元素转化为多项式形式的技术，提出了隐私保护的集合模式匹配的协议。假设参与方都是半诚实的，且合谋的参与方人数少于1/2,那么所提的协议能够安全高效的计算集合模式匹配的问题。由于此协议是在信息论模型下所提出的集合模式匹配协议，所以此协议是无条件安全的。
|
| 关 键 词： | 安全多方计算 信息论模型 模式匹配 无条件安全 |
| 收稿时间： | 2008-7-15 |
Protocol for Privacy preserving Set Pattern Matching with Unconditionally Secure |
| |
| ZHENG Qiang,LUO Shoushan,XIN Yang,GU Yonghao.Protocol for Privacy preserving Set Pattern Matching with Unconditionally Secure[J].Journal of Beijing University of Posts and Telecommunications,2009,32(1):99-102. |
| |
| Authors: | ZHENG Qiang LUO Shoushan XIN Yang GU Yonghao |
| |
| Affiliation: | 1.State Key Laboratory of Networking and Switching Technology;Beijing University of Posts and Telecommunications;Beijing 100876;China;2.Key Laboratory of Network and Information Attack and Defence Technology;Ministry of Education;3.National Engineering Laboratory for Disaster Backup and Recovery;China |
| |
| Abstract: | To overcome the inadequate of the existed protocols for privacy preserving set operation that almost comes from homomorphic public-key encryption in the cryptographic model. A protocol for privacy preserving set pattern matching, based on the secret sharing scheme and the technique of representing sets as polynomials, is proposed. Assuming that all players are semi-honest, and less than players collude, the set pattern matching is correctly computed by this protocol. Since the presented protocol is based on information theoretic model, it is unconditionally secure. |
| |
| Keywords: | secure multiparty computation information theoretic model pattern matching unconditionally secure |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《北京邮电大学学报》浏览原始摘要信息 |
|
点击此处可从《北京邮电大学学报》下载全文 |
