Fully simulatable quantum-secure coin-flipping and applications
From MaRDI portal
Abstract: We propose a coin-flip protocol which yields a string of strong, random coins and is fully simulatable against poly-sized quantum adversaries on both sides. It can be implemented with quantum-computational security without any set-up assumptions, since our construction only assumes mixed commitment schemes which we show how to construct in the given setting. We then show that the interactive generation of random coins at the beginning or during outer protocols allows for quantum-secure realizations of classical schemes, again without any set-up assumptions. As example applications we discuss quantum zero-knowledge proofs of knowledge and quantum-secure two-party function evaluation. Both applications assume only fully simulatable coin-flipping and mixed commitments. Since our framework allows to construct fully simulatable coin-flipping from mixed commitments, this in particular shows that mixed commitments are complete for quantum-secure two-party function evaluation. This seems to be the first completeness result for quantum-secure two-party function evaluation from a generic assumption.
Recommendations
- Quantum-Secure Coin-Flipping and Applications
- Physical Limitations of Quantum Cryptographic Primitives or Optimal Bounds for Quantum Coin Flipping and Bit Commitment
- Tight bounds for classical and quantum coin flipping
- Very-efficient simulatable flipping of many coins into a well (and a new universally-composable commitment scheme)
- Quantum bit escrow
Cites work
- A Framework for Efficient and Composable Oblivious Transfer
- Advances in Cryptology – CRYPTO 2004
- Classical cryptographic protocols in a quantum world
- Composing Quantum Protocols in a Classical Environment
- Fully simulatable quantum-secure coin-flipping and applications
- scientific article; zbMATH DE number 708820 (Why is no real title available?)
- scientific article; zbMATH DE number 1942445 (Why is no real title available?)
- Improving the Security of Quantum Protocols via Commit-and-Open
- Minimum disclosure proofs of knowledge
- On lattices, learning with errors, random linear codes, and cryptography
- Quantum-Secure Coin-Flipping and Applications
- Secure Identification and QKD in the Bounded-Quantum-Storage Model
- The knowledge complexity of interactive proof-systems
Cited in
(17)- Secure certification of mixed quantum states with application to two-party randomness generation
- Post-quantum multi-party computation
- Oblivious transfer is in MiniQCrypt
- Non-malleable commitments against quantum attacks
- The round complexity of quantum zero-knowledge
- Very-efficient simulatable flipping of many coins into a well (and a new universally-composable commitment scheme)
- Fully simulatable quantum-secure coin-flipping and applications
- scientific article; zbMATH DE number 5595866 (Why is no real title available?)
- Quantum-Secure Coin-Flipping and Applications
- Physical Limitations of Quantum Cryptographic Primitives or Optimal Bounds for Quantum Coin Flipping and Bit Commitment
- Semi-loss-tolerant strong quantum coin-flipping protocol using quantum non-demolition measurement
- Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round
- On concurrent multi-party quantum computation
- Zero-knowledge proof systems for QMA
- The round complexity of black-box post-quantum secure computation
- Round-efficient composable two-party quantum computation
- Almost-total puzzles and their applications
This page was built for publication: Fully simulatable 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 Q3011901)
