IEEE Information Theory Workshop (ITW)

A practical scheme for string commitment based on the Gaussian channel

Frédérique Oggier, Kirill Morozov

Published May 1, 2008• 6 citations

Abstract

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.

DOI: 10.1109/itw.2008.4578679

Related papers

Oblivious Transfer from the Additive White Gaussian Noise Channel

Motohiko Isaka

We consider the use of the additive white Gaussian noise channel to achieve information theoretically secure oblivious transfer. A protocol for this primitive that ensures the correctness and privacy for players is presented together with the signal design. We also study the information theoretic efficiency of the protocol, and some more practical issues where the parameter of the channel is unknown to the players.

IEICE Transactions on Fundamentals of Electronics Communications and Computer SciencesJan 1, 20104 citations

Bit Commitment over Gaussian Channels

João Barros, Hideki Imai, Anderson C. A. Nascimento +1 more

We consider bit commitment over additive white Gaussian noise channels. Our main result is that the maximum rate at which this class of channels can be used for implementing commitment protocols (the commitment capacity) is provably infinite, even under an average power constraint.

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

Cryptographic primitives based on discrete-input AWGN channels

Motohiko Isaka, Y. Shimizu

Two cryptographic primitives, commitment and oblivious transfer, are devised based on the additive white Gaussian noise channel and discrete input alphabet. We present protocols and analyze the security and information theoretic efficiencies.

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

An unconditionally secure protocol based on lattices over the Gaussian channel

Motohiko Isaka

We propose to achieve an information theoretically secure oblivious transfer using lattice partitions based on the additive white Gaussian noise channel. A protocol is presented and the security and efficiency is discussed.

International Symposium on Information Theory and its ApplicationsDec 1, 20081 citation

Practical Information-theoretic Commitment

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

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.

Sep 26, 20070 citations

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