Practical Information-theoretic Commitment

Matthieu R. Bloch, João Barros, S.W. McLaughlin

Published Sep 26, 2007• 0 citations

Abstract

We consider the construction of practical commitment schemes for both discrete memoryless and Gaussian channels.For this purpose, we introduce a new proof of the achievability of commitment rates that emphasizes the connection with secret key agreement.By highlighting the fact that the concealing and binding properties of a commitment protocol can be enforced separately, this proof is shown to provide useful guidelines for the construction of practical schemes.

Related papers

Efficient Protocols Achieving the Commitment Capacity of Noisy Correlations

Hideki Imai, Kirill Morozov, Anderson C. A. Nascimento +1 more

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).

IEEE International Symposium on Information Theory (ISIT)Jul 1, 200627 citations

A practical scheme for string commitment based on the Gaussian channel

Frédérique Oggier, Kirill Morozov

We consider the problem of information-theoretically secure string commitment using a channel with additive white Gaussian noise. While the current results in the literature mainly present existence results for such schemes, we present here a practical scheme using lattice codes and analyze its security parameters for finite code lengths.

IEEE Information Theory Workshop (ITW)May 1, 20086 citations

On the Commitment Capacity of Unfair Noisy Channels

Claude Crépeau, Rafael Dowsley, Anderson C. A. Nascimento

Noisy channels are a valuable resource from a cryptographic point of view. They can be used for exchanging secret-keys as well as realizing other cryptographic primitives such as commitment and oblivious transfer. To be really useful, noisy channels have to be considered in the scenario where a cheating party has some degree of control over the channel characteristics. Damgård et al. (EUROCRYPT 1999) proposed a more realistic model where such level of control is permitted to an adversary, the so called unfair noisy channels, and proved that they can be used to obtain commitment and oblivious transfer protocols. Given that noisy channels are a precious resource for cryptographic purposes, one important question is determining the optimal rate in which they can be used. The commitment capacity has already been determined for the cases of discrete memoryless channels and Gaussian channels. In this work we address the problem of determining the commitment capacity of unfair noisy channels. We compute a single-letter characterization of the commitment capacity of unfair noisy channels. In the case where an adversary has no control over the channel (the fair case) our capacity reduces to the well-known capacity of a discrete memoryless binary symmetric channel.

arXiv:1905.10921IEEE Transactions on Information TheoryJan 17, 202015 citations

On secret key agreement from the additive white Gaussian noise channel

Motohiko Isaka, Kawata Seiya

It is known that noise on communication channels can be a powerful resource for certain cryptographic purposes, basically by utilizing the randomness to ensure the secrecy. In this paper, we study information theoretically secure key agreement through the use of the additive white Gaussian noise channel and public discussion. We present a protocol for key agreement that defines the computation and communications between the two communicating parties to share a common secret information, about which negligible amount of information is revealed to other third parties. We discuss the signal design, secrecy and the achievable rate of the protocol.

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)Sep 1, 20091 citation

Wireless Information-Theoretic Security - Part II: Practical Implementation

Matthieu R. Bloch, João Barros, Miguel R. D. Rodrigues +1 more

In Part I of this two-part paper on confidential communication over wireless channels, we studied the fundamental security limits of quasi-static fading channels from the point of view of outage secrecy capacity with perfect and imperfect channel state information. In Part II, we develop a practical secret key agreement protocol for Gaussian and quasi-static fading wiretap channels. The protocol uses a four-step procedure to secure communications: establish common randomness via an opportunistic transmission, perform message reconciliation, establish a common key via privacy amplification, and use of the key. We introduce a new reconciliation procedure that uses multilevel coding and optimized low density parity check codes which in some cases comes close to achieving the secrecy capacity limits established in Part I. Finally, we develop new metrics for assessing average secure key generation rates and show that our protocol is effective in secure key renewal.

arXiv:cs/0611121Nov 24, 200613 citations

1 Secret-Key Generation using Correlated Sources and Channels

Ashish J. Khisti, Student Member, Suhas N. Diggavi +1 more

Abstract—We study the secret-key capacity in a joint source-channel coding setup—the terminals are connected over a discrete memoryless channel and have access to side information, modelled as a pair of discrete memoryless source sequences. As our main result, we establish the upper and lower bounds on the secret-key capacity. In the lower bound expression, the equivocation terms of the source and channel components are functionally additive even though the coding scheme generates a single secret-key by jointly taking into account the source and channel equivocations. Our bounds coincide, thus establishing the capacity, when the underlying wiretap channel can be decomposed into a set of independent, parallel, and reversely degraded channels. For the case of parallel Gaussian channels and jointly Gaussian sources we show that Gaussian codebooks achieve the secret-key capacity. In addition, when the eavesdropper also observes a correlated side information sequence, we establish the secret-key capacity when both the source and channel of the eavesdropper are a degraded version of the legitimate receiver. We finally also treat the case when a public discussion channel is available, propose a separation based coding scheme, and establish its optimality when the channel output symbols of the legitimate receiver and eavesdropper are conditionally independent given the input. Index Terms—Information theoretic security, joint sourcechannel coding, public discussion, secret-key agreement, wiretap channel. I.

Jan 1, 201155 citations