DocumentCode
1644989
Title
Research on Secure Multi-Party Closest String Problem
Author
Liu Wen ; Wang Yong-bin ; Cao Yi-zhen
Author_Institution
Sch. of Comput. Sci. Commun., Univ. of China, Beijing, China
fYear
2011
Firstpage
1
Lastpage
4
Abstract
A secure two-party hamming distance computing protocol is proposed based on the secure two-party matrix product protocol; a secure four-party addition protocol, a secure three-party addition protocol and a secure two-party number protocol are proposed based on the additive homomorphic encryption and secure two-party compare protocol. A secure multi-party closest string protocol is presented based on the secure two-party hamming distance computing protocol and a secure multi-party addition protocol. These protocols are based on semi-honest model.
Keywords
cryptographic protocols; secure four-party addition protocol; secure multiparty closest string problem; secure three-party addition protocol; secure two-party compare protocol; secure two-party hamming distance computing protocol; secure two-party matrix product protocol; secure two-party morphic encryption; semihonest model; Additives; Educational institutions; Encryption; Hamming distance; Protocols; Semantics;
fLanguage
English
Publisher
ieee
Conference_Titel
Wireless Communications, Networking and Mobile Computing (WiCOM), 2011 7th International Conference on
Conference_Location
Wuhan
ISSN
2161-9646
Print_ISBN
978-1-4244-6250-6
Type
conf
DOI
10.1109/wicom.2011.6040160
Filename
6040160
Link To Document