DocumentCode
2593988
Title
Fair Secure Message Exchange Protocols
Author
Xi, Li
Author_Institution
Dept. of Comput. Sci. & Technol., Tsinghua Univ., Beijing, China
Volume
2
fYear
2010
fDate
24-25 April 2010
Firstpage
227
Lastpage
231
Abstract
An ordinary fair exchange will inevitably leak something to the semi-trusted neutral party. In this paper, we present a new variety of such protocols which leak nothing, even the size of input to the semi-trusted neutral party, and prove that all languages in NP have such protocols.
Keywords
computational complexity; cryptographic protocols; message authentication; NP-hard problem; fair secure message exchange protocols; semitrusted neutral party; Computer networks; Computer science; Computer security; Cryptographic protocols; Cryptography; Electronic commerce; NP-hard problem; Polynomials; Wireless application protocol; Wireless communication; NP; Probability; proof; semi-trusted neutral party;
fLanguage
English
Publisher
ieee
Conference_Titel
Networks Security Wireless Communications and Trusted Computing (NSWCTC), 2010 Second International Conference on
Conference_Location
Wuhan, Hubei
Print_ISBN
978-0-7695-4011-5
Electronic_ISBN
978-1-4244-6598-9
Type
conf
DOI
10.1109/NSWCTC.2010.188
Filename
5480597
Link To Document