Quantum-Secure Coin-Flipping and Applications

DOI10.1007/978-3-642-10366-7_4MaRDI QIDQ3650684zbMATH OpenOpenAlexFDO

Authors Carolin Lunemann, Ivan B. Damgård

Publication date 15 December 2009

Published in Advances in Cryptology – ASIACRYPT 2009 (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0903.3118

zbMATH Keywords

coin-flippingcommon reference stringquantum cryptographyquantum zero-knowledge

Mathematics Subject Classification ID

Quantum cryptography (quantum-theoretic aspects) (81P94)

Abstract: In this paper, we prove classical coin-flipping secure in the presence of quantum adversaries. The proof uses a recent result of Watrous [Wat09] that allows quantum rewinding for protocols of a certain form. We then discuss two applications. First, the combination of coin-flipping with any non-interactive zero-knowledge protocol leads to an easy transformation from non-interactive zero-knowledge to interactive quantum zero-knowledge. Second, we discuss how our protocol can be applied to a recently proposed method for improving the security of quantum protocols [DFL+09], resulting in an implementation without set-up assumptions. Finally, we sketch how to achieve efficient simulation for an extended construction in the common-reference-string model.

Recommendations

• Fully simulatable quantum-secure coin-flipping and applications
• Quantum cryptography: public key distribution and coin tossing
• Verifiable quantum encryption and its practical applications
• A new protocol and lower bounds for quantum coin flipping
• A new protocol and lower bounds for quantum coin flipping
• scientific article; zbMATH DE number 1283995
• Physical Limitations of Quantum Cryptographic Primitives or Optimal Bounds for Quantum Coin Flipping and Bit Commitment
• Applied quantum cryptography
• scientific article; zbMATH DE number 1263182
• Secrecy, computational loads and rates in practical quantum cryptography

Cited in

(15)

• Post-quantum multi-party computation
• Tight bounds for classical and quantum coin flipping
• Fully simulatable quantum-secure coin-flipping and applications
• Increasing the power of the verifier in quantum zero knowledge
• scientific article; zbMATH DE number 5595866 (Why is no real title available?)
• Transmutation scheme of coin flipping protocol and utilization
• Physical Limitations of Quantum Cryptographic Primitives or Optimal Bounds for Quantum Coin Flipping and Bit Commitment
• Quantum cryptography: public key distribution and coin tossing
• Semi-loss-tolerant strong quantum coin-flipping protocol using quantum non-demolition measurement
• Quantum weak coin flipping
• Quantum rewinding for many-round protocols
• On concurrent multi-party quantum computation
• Zero-knowledge proof systems for QMA
• Quantum counterfeit coin problems
• Round-efficient composable two-party quantum computation

This page was built for publication: Quantum-Secure Coin-Flipping and Applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3650684)