Rates for bit commitment and coin tossing from noisy correlation

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2004, Pages 45-

  Imai, Hideki ^a   Müller Quade, Jörn ^b   Nascimento, Anderson ^a   Winter, Andreas ^c  

^a INSTITUTE OF INDUSTRIAL SCIENCE   (Japan)

^b UNIVERSITY OF KARLSRUHE   (Germany)

^c UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BIT COMMITMENT; COIN TOSSING PROTOCOL; NOISELESS COMMUNICATION; OBLIVIOUS TRANSFER;

BIT ERROR RATE; CHANNEL CAPACITY; COMMUNICATION SYSTEMS; CORRELATION METHODS; CRYPTOGRAPHY; NETWORK PROTOCOLS; NOISE ABATEMENT; REDUNDANCY;

COMPUTER NETWORKS;

EID: 5044248797     PISSN: 21578097     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (4)

1. D. Beaver,Correlated Pseudorandomness and the Complexity of Private Computation, STOC 1996: 479-488
2. M. Slum, Coin fipping by telephone: a protocol for solving impossible, Proc. IEEE Computer Conference, pp. 133-137, 1982.
3. J. Müller-Quade, D. Unruh, Extending statistically secure coin tosses, unpublished, 2003.
4. A. Winter, A. Nascimento, H. Imai, Commitment Capacity of Discrete Memoryless Channels, IMA Conf. Coding and Cryptography, LNCS 2898, Springer-Verlag. Extended version available at http://axxiv.org/abs/cs.CR/0304014