DocumentCode :
2945614
Title :
Efficient Protocols Achieving the Commitment Capacity of Noisy Correlations
Author :
Imai, Hideki ; Morozov, Kirill ; Nascimento, Anderson C A ; Winter, Andreas
Author_Institution :
Dept. of Electr., Electron. & Commun. Eng., Chuo Univ., Tokyo
fYear :
2006
fDate :
9-14 July 2006
Firstpage :
1432
Lastpage :
1436
Abstract :
Bit commitment is an important tool for constructing zero-knowledge proofs and multi-party computation. Unconditionally secure bit commitment can be based, in particular, on noisy channel or correlation where noise considered a valuable resource. Recently, Winter, Nascimento and Imai introduced the concept of commitment capacity, the maximal ratio between the length of a string which the sender commits to and the number of times the noisy channel/correlation is used. They also proved that for any discrete memoryless channel there exists a secure protocol achieving its commitment capacity however, no particular construction was given. Solving their open question, we provide an efficient protocol for achieving the commitment capacity of discrete memoryless systems (noisy channels and correlations)
Keywords :
channel capacity; protocols; telecommunication security; commitment capacity; correlation; discrete memoryless channel; noisy channel; secure bit commitment; secure protocol; Acoustic noise; Communication industry; Computer industry; Electronic mail; Electronics industry; Industrial electronics; Information security; Mathematics; Memoryless systems; Protocols;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2006 IEEE International Symposium on
Conference_Location :
Seattle, WA
Print_ISBN :
1-4244-0505-X
Electronic_ISBN :
1-4244-0504-1
Type :
conf
DOI :
10.1109/ISIT.2006.262083
Filename :
4036203
Link To Document :
بازگشت