ScholarLens Back to search
2004•Unpublished venueRequires access

Rates for bit commitment and coin tossing from noisy correlation

Hiroyuki Imai, Joern Mueller-Quade, Anderson C. A. Nascimento, Andreas Winter

Open publisher page 17 citations

Abstract

This paper studies the optimisation of the channel with cryptographic primitives such as coin tossing and oblivious transfer by committing to a set of strings. The main contribution of this paper is that the commitment is possible from any nontrivial correlation at rates when the sender is Alice and Bob, those rates are optimal. Also the coin tossing capacity is infinite for every channel having a positive bit commitment rate.

About this research paper

What this paper is about

This paper studies the optimisation of the channel with cryptographic primitives such as coin tossing and oblivious transfer by committing to a set of strings. The main contribution of this paper is that the commitment is possible from any nontrivial correlation at rates when the sender is Alice and Bob, those rates are optimal. Also the coin tossing capacity is infinite for every channel having a positive bit commitment rate.

Why it matters

OpenAlex reports 17 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This paper studies the optimisation of the channel with cryptographic primitives such as coin tossing and oblivious transfer by committing to a set of strings. The main contribution of this paper is that the commitment is possible from any nontrivial correlation at rates when the sender is Alice and Bob, those rates are optimal. Also the coin tossing capacity is infinite for every channel having a positive bit commitment rate.

Key concepts: Coin flipping, Communication source, Oblivious transfer, Alice and Bob, Computer science, Commitment scheme, Bit (key), Set (abstract data type)

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Rates for bit commitment and coin tossing from noisy correlation — Research Paper | ScholarLens