Computers & Security

Bit Commitment Based on Information Theoretic Security

Hong Yan

Published Jan 1, 2009• 0 citations

Abstract

A trusted protocol for committing a classical bit could be used for protocols implementing a wide range of other cryptographic tasks. This paper discusses a safe bit commitment scheme over noisy Channels, which imports one-way hash function and interaction. It introduces the commitment capacity and analyses the security performance of the scheme studied from an information-theoretic perspective.

Related papers

Safe Scheme of Bit Commitment

Yanhui Wu, Jianer Chen

Based on analyzing the scheme of bit commitment,which is provided on a pseudo-random generator,from the literature~([1]),This paper discuss a pattern of interaction attack which aims at the course of bit commitment,and provides a safe scheme based on the scheme of bit commitment.Holded the security of that scheme,the safe scheme imports one-way hash function and authentication,protects the datas from man-in-the-middle attack during the transmission course.

Mini-micro SystemsJan 1, 20050 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

A brief review on quantum bit commitment

Álvaro J. Almeida, Ricardo Loura, Nikola Paunković +5 more

In classical cryptography, the bit commitment scheme is one of the most important primitives. We review the state of the art of bit commitment protocols, emphasizing its main achievements and applications. Next, we present a practical quantum bit commitment scheme, whose security relies on current technological limitations, such as the lack of long-term stable quantum memories. We demonstrate the feasibility of our practical quantum bit commitment protocol and that it can be securely implemented with nowadays technology.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIEAug 22, 20148 citations

An Information-Theoretic Perspective on the Quantum Bit Commitment Impossibility Theorem

Marius Nagy, Naya Nagy

This paper proposes a different approach to pinpoint the causes for which an unconditionally secure quantum bit commitment protocol cannot be realized, beyond the technical details on which the proof of Mayers' no-go theorem is constructed. We have adopted the tools of quantum entropy analysis to investigate the conditions under which the security properties of quantum bit commitment can be circumvented. Our study has revealed that cheating the binding property requires the quantum system acting as the safe to harbor the same amount of uncertainty with respect to both observers (Alice and Bob) as well as the use of entanglement. Our analysis also suggests that the ability to cheat one of the two fundamental properties of bit commitment by any of the two participants depends on how much information is leaked from one side of the system to the other and how much remains hidden from the other participant.

EntropyMar 13, 20187 citations

Cheat Sensitive Quantum Bit Commitment

Lucién Hardy, Adrian Kent

We define cheat sensitive cryptographic protocols between mistrustful parties as protocols which guarantee that, if either cheats, the other has some nonzero probability of detecting the cheating. We describe an unconditionally secure cheat sensitive nonrelativistic bit commitment protocol which uses quantum information to implement a task which is classically impossible; we also describe a simple relativistic protocol.

arXiv:quant-ph/9911043Physical Review LettersApr 16, 200498 citations

No Superluminal Signaling Implies Unconditionally Secure Bit Commitment

H. F. Chau, Chi‐Hang Fred Fung, Hoi‐Kwong Lo

Bit commitment (BC) is an important cryptographic primitive for an agent to convince a mutually mistrustful party that she has already made a binding choice of 0 or 1 but only to reveal her choice at a later time. Ideally, a BC protocol should be simple, reliable, easy to implement using existing technologies, and most importantly unconditionally secure in the sense that its security is based on an information-theoretic proof rather than computational complexity assumption or the existence of a trustworthy arbitrator. Here we report such a provably secure scheme involving only one-way classical communications whose unconditional security is based on no superluminal signaling (NSS). Our scheme is inspired by the earlier works by Kent, who proposed two impractical relativistic protocols whose unconditional securities are yet to be established as well as several provably unconditionally secure protocols which rely on both quantum mechanics and NSS. Our scheme is conceptually simple and shows for the first time that quantum communication is not needed to achieve unconditional security for BC. Moreover, with purely classical communications, our scheme is practical and easy to implement with existing telecom technologies. This completes the cycle of study of unconditionally secure bit commitment based on known physical laws.

arXiv:1405.0198May 1, 20141 citation