Bit commitment in the bounded storage model: tight bound and simple optimal construction

Authors:
Junji Shikata;Daisuke Yamanaka
Affiliations:
Graduate School of Environment and Information Sciences, Yokohama National University, Japan;Graduate School of Environment and Information Sciences, Yokohama National University, Japan
Venue:
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
Year:
2011

Citing 21
Cited 0

A randomized protocol for signing contracts

Communications of the ACM
Founding crytpography on oblivious transfer

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Information-theoretic bounds for authentication schemes

Journal of Cryptology
Conditionally-perfect secrecy and a provably-secure randomized cipher

Journal of Cryptology - Eurocrypt '90
Randomness is linear in space

Journal of Computer and System Sciences
Hyper-Encryption and Everlasting Security

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Information Theoretically Secure Communication in the Limited Storage Space Model

CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Oblivious Transfer in the Bounded Storage Model

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Equivalence Between Two Flavours of Oblivious Transfers

CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Unconditional Security Against Memory-Bounded Adversaries

CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Efficient Oblivious Transfer in the Bounded-Storage Model

ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Oblivious Transfer with a Memory-Bounded Receiver

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Constant-Round Oblivious Transfer in the Bounded Storage Model

Journal of Cryptology
Interactive Hashing: An Information Theoretic Tool (Invited Talk)

ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
On the (im)possibility of basing oblivious transfer and bit commitment on weakened security assumptions

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Oblivious transfer and linear functions

CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Optimal reductions between oblivious transfers using interactive hashing

EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Information-Theoretic conditions for two-party secure function evaluation

EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Authentication theory and hypothesis testing

IEEE Transactions on Information Theory
Everlasting security in the bounded storage model

IEEE Transactions on Information Theory
The Bare Bounded-Storage Model: The Tight Bound on the Storage Requirement for Key Agreement

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study bit commitment in the bounded storage model (BSM). Specifically, in this paper we derive the tight lower bound on the memory size of honest players of bit commitment in the BSM. The tightness of our lower bound is shown by the fact that a certain bit commitment scheme obtained from the oblivious transfer by Ding et al. meets the bound with equality. We also give a simple and optimal construction of the bit commitment in this paper. We emphasize that our construction is simpler and easier to implement than already known any other bit commitment in the BSM.