Fully Simulatable Quantum-Secure Coin-Flipping and Applications

DOI10.1007/978-3-642-21969-6_2zbMath1280.62126arXiv1102.0887OpenAlexW1772122339MaRDI QIDQ3011901

Carolin Lunemann, Jesper Buus Nielsen

Publication date: 29 June 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Applications of statistics in engineering and industry; control charts (62P30) Quantum computation (81P68) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Related Items (7)

Non-malleable commitments against quantum attacks ⋮ Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round ⋮ On concurrent multi-party quantum computation ⋮ The round complexity of quantum zero-knowledge ⋮ Fully Simulatable Quantum-Secure Coin-Flipping and Applications ⋮ Post-quantum multi-party computation ⋮ Oblivious transfer is in MiniQCrypt

Cites Work

• Unnamed Item
• Unnamed Item
• Minimum disclosure proofs of knowledge
• Zero-knowledge against quantum attacks
• Fully Simulatable Quantum-Secure Coin-Flipping and Applications
• Improving the Security of Quantum Protocols via Commit-and-Open
• A Framework for Efficient and Composable Oblivious Transfer
• Composing Quantum Protocols in a Classical Environment
• Secure Identification and QKD in the Bounded-Quantum-Storage Model
• Quantum-Secure Coin-Flipping and Applications
• The knowledge complexity of interactive proof-systems
• Classical Cryptographic Protocols in a Quantum World
• Advances in Cryptology – CRYPTO 2004
• On lattices, learning with errors, random linear codes, and cryptography

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