Filters








199 Hits in 6.5 sec

General Properties of Quantum Bit Commitment [article]

Jun Yan
2020 IACR Cryptology ePrint Archive  
These properties not only enable us to simplify both the construction and the security analysis of quantum bit commitment schemes significantly but also suggest a potential use of quantum bit commitments  ...  The concept of quantum bit commitment was introduced more than three decades ago in a failed attempt to base unconditionally secure bit commitment solely on laws of quantum mechanics.  ...  We thank Dominique Unruh for inspiring discussions with him about the strictness of the quantum binding property.  ... 
dblp:journals/iacr/Yan20 fatcat:62msv2ixtrbaviewwaygefmydy

Cryptographic Protocols under Quantum Attacks [article]

Carolin Lunemann
2011 arXiv   pre-print
We study the security of quantum and classical protocols against adversaries that are assumed to exploit quantum effects to their advantage.  ...  Security in the quantum world means that quantum computation does not jeopardize the assumption, underlying the protocol construction.  ...  Acknowledgments Thanks to all the people, I met on the way of my PhD education, for introducing me to new ways of thinking, inspiring me by fascinating ideas, and helping me in so many other ways.  ... 
arXiv:1102.0885v2 fatcat:y4ytrigbzzf3vb7pwxw3skoh4u

MLC No-go Theorems: Reinterpretation and Extension [article]

Minh-Dung Dang, Patrick Bellot
2008 arXiv   pre-print
This model could give a more general view on the concealing/binding trade-off of quantum bit commitment protocols.  ...  This interpretation leads to a global three-party model, involving Alice's and Bob's machines and the environment coupled to the macroscopic channel, using the decoherence scheme in quantum measurements  ...  So, such a short-term oracle cannot help to build secure two-party computations, for long-term usage. B.  ... 
arXiv:quant-ph/0701156v5 fatcat:knqv5677zzg4lonjgrgvrbdlum

Cryptography with Certified Deletion [article]

James Bartusek, Dakshita Khurana
2022 arXiv   pre-print
Assuming the existence of statistically-binding commitments, our compiler yields statistically-binding commitments with certified everlasting hiding as well as statistically-sound zero-knowledge proofs  ...  , assuming post-quantum X encryption.  ...  Acknowledgments We thank Bhaskar Roberts and Alex Poremba for comments on an earlier draft, and for noting that quantum fully-homomorphic encryption is not necessary for our FHE with certified deletion  ... 
arXiv:2207.01754v3 fatcat:5rhdddhwkjaofjwm7no4zioona

Generation and Distribution of Quantum Oblivious Keys for Secure Multiparty Computation

Mariano Lemus, Mariana F. Ramos, Preeti Yadav, Nuno A. Silva, Nelson J. Muga, André Souto, Nikola Paunković, Paulo Mateus, Armando N. Pinto
2020 Applied Sciences  
With the presented hybrid approach of quantum and classical, we obtain a practical and high-speed oblivious transfer protocol.  ...  We present a method to generate and distribute oblivious keys by exchanging qubits and by performing commitments using classical hash functions.  ...  This is achieved by the HMQ construction [35] which, given a standalone secure commitment scheme and a Random Oracle, outputs a universally-composable commitment scheme, which is perfectly hiding and  ... 
doi:10.3390/app10124080 fatcat:5skqgy2jqzf3ndtdeurk7deypm

How to Base Security on the Perfect/Statistical Binding Property of Quantum Bit Commitment? [article]

Junbin Fang, Dominique Unruh, Jian Weng, Jun Yan, Dehua Zhou
2020 IACR Cryptology ePrint Archive  
with a perfectly/statistically-binding quantum bit commitment.  ...  Since non-interactive quantum bit commitment schemes can be constructed from general quantum-secure one-way functions, we hope to use quantum bit commitment (rather than the classical one that is still  ...  Based on the quantum complexity assumption there are also two flavors of quantum bit commitments: (computationally-hiding) statistically-binding quantum bit commitments [DMS00, KO09, KO11] and statistically-hiding  ... 
dblp:journals/iacr/FangUWYZ20 fatcat:pwwk3uwf5zbapnucwvatmz4z2u

On the computational hardness needed for quantum cryptography [article]

Zvika Brakerski, Ran Canetti, Luowen Qian
2022 arXiv   pre-print
Building on the work of Yan (2022) which shows equivalence between EFI pairs and statistical commitment schemes, we show that EFI pairs are necessary and sufficient for a large class of quantum-cryptographic  ...  Specifically, while it was known how to construct commitments schemes, oblivious transfer, and general secure multiparty computation from any EFI, we show how to construct EFI pairs from minimalistic versions  ...  Acknowledgements LQ thanks Prabhanjan Ananth and Henry Yuen for the motivating discussions prior to this work.  ... 
arXiv:2209.04101v1 fatcat:57kv3dupuzgmzmdjsvjfwe5kba

Adaptive Versus Non-Adaptive Strategies in the Quantum Setting with Applications [chapter]

Frédéric Dupuis, Serge Fehr, Philippe Lamontagne, Louis Salvail
2016 Lecture Notes in Computer Science  
The second example is a quantum bit commitment scheme proposed in 1993 by Brassard et al. It was originally suggested as an unconditionally secure scheme, back when this was thought to be possible.  ...  The first is a quantum bit commitment scheme based on 1-bit cut-and-choose.  ...  GA16-22211S and of the EU FP7 under grant agreement no. 323970 (RAQUEL). LS is supported by Canada's NSERC discovery grant. Theorem 8. 1CC is statistically quantum UC-complete. Proof.  ... 
doi:10.1007/978-3-662-53015-3_2 fatcat:ah7otaemjvehfg7piuwcmgpwxm

Verifying quantum computations at scale: A cryptographic leash on quantum devices

Thomas Vidick
2019 Bulletin of the American Mathematical Society  
In these notes I give a self-contained introduction to her elegant solution, explaining the required concepts from complexity, quantum computing, and cryptography, and how they are brought together in  ...  A standard example is factoring: having run Shor's quantum algorithm for finding a prime factor p of an integer n, it is easy to execute Euclid's algorithm to check that p|n.  ...  He obtained his undergraduate degree in mathematics from License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use  ... 
doi:10.1090/bull/1678 fatcat:z4fur5gqxbalnl7blyeuh7dnva

Practical Governmental Voting with Unconditional Integrity and Privacy [chapter]

Nan Yang, Jeremy Clark
2017 Lecture Notes in Computer Science  
Where the voter casts an in-person (and possibly paper) ballot and leaves, as is common in a governmental election, the majority of the proposals fall in the category of providing unconditional integrity  ...  However as far as we know, no paper has succeeded in providing both unconditional integrity and privacy in this setting-it has only been explored in boardroom voting schemes where voters participate in  ...  The second author acknowledges funding for this work from NSERC and FQRNT.  ... 
doi:10.1007/978-3-319-70278-0_27 fatcat:gobfldct45fspm73osyrkadj2m

Computationally Binding Quantum Commitments [chapter]

Dominique Unruh
2016 Lecture Notes in Computer Science  
We present a new definition of computationally binding commitment schemes in the quantum setting, which we call "collapse-binding".  ...  The definition applies to string commitments, composes in parallel, and works well with rewindingbased proofs.  ...  We thank Ansis Rosmanis for discussions on insecure commitments based on collision-resistant hash functions, and Serge Fehr for discussions on the DFRSS-binding definition.  ... 
doi:10.1007/978-3-662-49896-5_18 fatcat:sv4uvld5nre2xlu6cijodic6dy

Adaptive Versus Non-Adaptive Strategies in the Quantum Setting with Applications [article]

Frédéric Dupuis, Serge Fehr, Philippe Lamontagne, Louis Salvail
2016 arXiv   pre-print
The second example is a quantum bit commitment scheme proposed in 1993 by Brassard et al. It was originally suggested as an unconditionally secure scheme, back when this was thought to be possible.  ...  The first is a quantum bit commitment scheme based on 1-bit cut-and-choose.  ...  Parties: The sender Alice and the receiver Bob. Inputs: Alice receives s0, s1 ∈ {0, 1} and Bob receives c ∈ {0, 1}.  ... 
arXiv:1607.08168v1 fatcat:skgsorgbmbhi3meo6pc7flkk3i

Koinonia

Huangyi Ge, Sze Yiu Chau, Victor E Gonsalves, Huian Li, Tianhao Wang, Xukai Zou, Ninghui Li
2019 Proceedings of the 35th Annual Computer Security Applications Conference on - ACSAC '19  
We thus design and implement Koinonia, a voting system that provides long-term privacy against powerful adversaries and enables anyone to verify that each ballot is well-formed and the tallying is done  ...  /or quantum computers.  ...  Any opinions, findings and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the DARPA.  ... 
doi:10.1145/3359789.3359804 dblp:conf/acsac/GeCGL0ZL19 fatcat:mzbizkcvwfeovkebudpjgrwxjq

Quantum cryptography beyond quantum key distribution

Anne Broadbent, Christian Schaffner
2015 Designs, Codes and Cryptography  
Quantum cryptography also studies the limitations and challenges resulting from quantum adversaries-including the impossibility of quantum bit commitment, the difficulty of quantum rewinding and the definition  ...  In this review article, aimed primarily at cryptographers unfamiliar with the quantum world, we survey the area of theoretical quantum cryptography, with an emphasis on the constructions and limitations  ...  C.S. is supported by an NWO VIDI grant, and the EU 7th framework project SIQS.  ... 
doi:10.1007/s10623-015-0157-4 pmid:32226229 pmcid:PMC7089691 fatcat:zm7zdq4l6babtd4y5ygwmttt2q

On the Security of Password-Authenticated Quantum Key Exchange [article]

Céline Chevalier, Marc Kaplan, Quoc Huy Vu
2019 arXiv   pre-print
Motivated by the Quantum Key Distribution (QKD) protocol, introduced in 1984 in the seminal paper of Bennett and Brassard, we investigate in this paper the achievability of unconditionally secure password-authenticated  ...  quantum key exchange (quantum PAKE), where the authentication is implemented by the means of human-memorable passwords.  ...  For instance, several attempts have been made to achieve unconditionally secure quantum bit-commitments, until Mayers and Lo et al. independently showed that statistically hiding and binding quantum commitments  ... 
arXiv:1904.01526v2 fatcat:w2vwzupckjg3zjaqdlyajuhuvy
« Previous Showing results 1 — 15 out of 199 results