17,505 Hits in 4.8 sec

Secure Classical Bit Commitment using Fixed Capacity Communication Channels [article]

Adrian Kent
2006 arXiv   pre-print
We prove that RBC2 allows a bit commitment to be indefinitely maintained with unconditional security against all classical attacks.  ...  In earlier work, we used this fact to define a relativistic bit commitment protocol, RBC1, in which security is maintained by exchanging a sequence of messages whose transmission rate increases exponentially  ...  Using classical bit commitment protocols as a model, one can define a bit commitment with a certificate of classicality to be a perfectly secure bit commitment protocol that guarantees from the outset  ... 
arXiv:quant-ph/9906103v7 fatcat:nnwktji37bgvthor5nj5ecvpgq

Unconditionally Secure Bit Commitment

Adrian Kent
1999 Physical Review Letters  
We describe a new classical bit commitment protocol based on cryptographic constraints imposed by special relativity. The protocol is unconditionally secure against classical or quantum attacks.  ...  It evades the no-go results of Mayers, Lo and Chau by requiring from Alice a sequence of communications, including a post-revelation verification, each of which is guaranteed to be independent of its predecessor  ...  They can then, for as long as their channel capacity permits, use the iteration strategy above to achieve indefinitely secure bit commitment from a sequence of standard classical bit commitment protocols  ... 
doi:10.1103/physrevlett.83.1447 fatcat:rmif6u2htfdbviqw4brv7xlvty

Experimental implementation of bit commitment in the noisy-storage model

Nelly Huei Ying Ng, Siddarth K. Joshi, Chia Chen Ming, Christian Kurtsiefer, Stephanie Wehner
2012 Nature Communications  
In this work, we present a bit commitment protocol which is secure as long as the attacker's quantum memory device is imperfect. The latter assumption is known as the noisy-storage model.  ...  Finally, we provide a general analysis of our bit commitment protocol for a range of experimental parameters.  ...  Indeed, it was shown that security can be linked to the classical capacity 17 , the entanglement cost 22 , and finally the quantum capacity 23 of the adversary's storage device .  ... 
doi:10.1038/ncomms2268 pmid:23271659 fatcat:2hdm242ovjg2dpapta6nyhzy2y

Quantum bit commitment with misaligned reference frames

Aram Harrow, Roberto Oliveira, Barbara M. Terhal
2006 Physical Review A. Atomic, Molecular, and Optical Physics  
asymptotically secure bit commitment.  ...  We show that this uncertainty of reference frame is of no use for bit commitment when mu is uniformly distributed over a (sub)group of SO(3), but other choices of mu can give rise to a partially or even  ...  Since noisy classical channels can have a bit commitment capacity [8] (which is achieved by coding), we may expect that a single use of such a channel could lead to a bit commitment that goes beyond  ... 
doi:10.1103/physreva.73.032311 fatcat:6tzzlv3ihberznil6jsskcqn2m

Unconditional Security From Noisy Quantum Storage

Robert Konig, Stephanie Wehner, Jürg Wullschleger
2012 IEEE Transactions on Information Theory  
We construct novel protocols for oblivious transfer and bit commitment, and prove that realistic noise levels provide security even against the most general attack.  ...  Our protocols can be implemented with present-day hardware used for quantum key distribution. In particular, no quantum storage is required for the honest parties.  ...  Christian Schaffner for discussions and comments on an earlier draft, and Dominique Unruh for pointing out a flaw in the proof of Theorem 3.5 in an earlier version of the paper, as well as for various other useful  ... 
doi:10.1109/tit.2011.2177772 fatcat:fp7ftdyefjailf5nw3xqksydja

Impossibility of unconditionally secure commitment of a certified classical bit

Adrian Kent
2000 Physical Review A. Atomic, Molecular, and Optical Physics  
In a secure bit commitment protocol involving only classical physics, A commits either a 0 or a 1 to B.  ...  has a fixed classical value.  ...  of fixed capacity.  ... 
doi:10.1103/physreva.61.042301 fatcat:2hplr4oigff3dghw4wyrkly5xe

On Reverse Elastic Channels and the Asymmetry of Commitment Capacity under Channel Elasticity [article]

Amitalok J. Budkuley, Pranav Joshi, Manideep Mamindlapally, Anuj Kumar Yadav
2021 arXiv   pre-print
Commitment is an important cryptographic primitive. It is well known that noisy channels are a promising resource to realize commitment in an information-theoretically secure manner.  ...  Our principal contribution is the REC commitment capacity characterization; this proves a recent related conjecture.  ...  ACKNOWLEDGEMENT The authors would like to acknowledge several interesting discussions with Manoj Mishra (NISER, HBNI, Bhubaneshwar) which helped us progress in this work.  ... 
arXiv:2111.08477v1 fatcat:2n7huw7uunbrzfd5t3h74lsyde

Reexamination of quantum bit commitment: The possible and the impossible

Giacomo Mauro D'Ariano, Dennis Kretschmann, Dirk Schlingemann, Reinhard F. Werner
2007 Physical Review A. Atomic, Molecular, and Optical Physics  
Bit commitment protocols whose security is based on the laws of quantum mechanics alone are generally held to be impossible. In this paper we give a strengthened and explicit proof of this result.  ...  The result also provides a natural characterization of protocols that fall outside the standard setting of unlimited available technology, and thus may allow secure bit commitment.  ...  Well-known classical bit commitment protocols whose security relies on noisy communication channels are briefly reviewed, too.  ... 
doi:10.1103/physreva.76.032328 fatcat:bldyuir7qrahdc53zp2zfj2q7m

Temporary Assumptions for Quantum Multiparty Secure Computations [article]

J. Mueller-Quade
2001 arXiv   pre-print
We prove that secure quantum multiparty computations are possible if and only if classical multi party computations work.  ...  This paper introduces quantum multiparty protocols which allow the use of temporary assumptions.  ...  Random choices are done in the same way, instead of fixing one value all possible values should be created in superposition. The most critical part of the reduction concerns classical communication.  ... 
arXiv:quant-ph/0010112v2 fatcat:neydexk4trhlbdeyldr4yafka4

Quantum Cryptography: Key Distribution and Beyond

Akshata Shenoy-Hejamadi, Anirban Pathak, Srikanth Radhakrishna
2017 Quanta  
High dimension quantum key distribution based on d-level systems allows transmission of greater than 1 bit per photon detection, which can enhance communication capacity at fixed particle rate [316] [  ...  However, an unconditionally secure bit commitment protocol cannot be constructed via calls to a secure coin tossing black box, even given additional finite classical or quantum communication between Alice  ... 
doi:10.12743/quanta.v6i1.57 fatcat:nwczh5zqjjch3abhrpcjb34ry4

Universally Composable Quantum Multi-party Computation [chapter]

Dominique Unruh
2010 Lecture Notes in Computer Science  
Furthermore, we show that every statistically classically UC secure protocol is also statistically quantum UC secure. Such implications are not known for other quantum security definitions.  ...  We prove that in this model statistically secure oblivious transfer protocols can be constructed from commitments.  ...  a classical channel.  ... 
doi:10.1007/978-3-642-13190-5_25 fatcat:dzxtlqmnvvbidmg4uqz55lvjc4

Quantum information and computation

Charles H. Bennett, David P. DiVincenzo
2000 Nature  
In information processing, as in physics, our classical world view provides an incomplete approximation to an underlying quantum reality.  ...  Acknowledgements This work was supported by the US Army Research office. Correspondence and requests for materials should be addressed to C.H.B. (e-mail: review article  ...  help of unlimited two-way classical communication between sender and receiver; and Entanglement-assisted classical capacity, C E , defined as the maximum rate for sending classical bits through the channel  ... 
doi:10.1038/35005001 pmid:10749200 fatcat:uk3qf5akn5d37f7g24utznha4e

Commitment Capacity of Discrete Memoryless Channels

Andreas Winter, Anderson C. A. Nascimento, Hideki Imai
2003 arXiv   pre-print
can be used for bit commitment.  ...  In extension of the bit commitment task and following work initiated by Crepeau and Kilian, we introduce and solve the problem of characterising the optimal rate at which a discrete memoryless channel  ...  Yeung for sharing their ideas on the quantum wiretap channel, and making available to us their manuscript [10] . We also acknowledge interesting discussions with J. Müller-Quade and P.  ... 
arXiv:cs/0304014v1 fatcat:hkhafzgbpjbrxga6arhzmw3b24

On the Use of Quantum Entanglement in Secure Communications: A Survey [article]

Keith Shannon, Elias Towe, Ozan K. Tonguz
2020 arXiv   pre-print
communications, computing, and security.  ...  ultimate frontier of secure communications.  ...  The classical capacity of a channel is a measure of how many classical bits can be sent by a quantum channel. For separable states, simple results apply.  ... 
arXiv:2003.07907v1 fatcat:sipwwjnpvnfe3h5dtzlqf3hcee

Continuous-Variable Protocols in the Noisy-Storage Model [article]

Fabian Furrer, Christian Schaffner, Stephanie Wehner
2015 arXiv   pre-print
Concretely, we determine how many signals need to be sent in order to achieve security by establishing a trade-off between quantum uncertainty generated in the protocol and the classical capacity of the  ...  memory channel.  ...  Appendix C: Bit commitment Security definitions Let us first introduce the notation. In the bit commitment phase, Bob inputs a bit C to which he commits.  ... 
arXiv:1509.09123v1 fatcat:ivfgmdzq55gfdbu3s42zw6wg7e
« Previous Showing results 1 — 15 out of 17,505 results