Title :
Fair Secure Message Exchange Protocols
Author_Institution :
Dept. of Comput. Sci. & Technol., Tsinghua Univ., Beijing, China
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;
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
DOI :
10.1109/NSWCTC.2010.188
