The knowledge complexity of interactive proof-systems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Minimum disclosure proofs of knowledge
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Founding crytpography on oblivious transfer
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
On Defining Proofs of Knowledge
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Towards a formal definition of security for quantum protocols
Towards a formal definition of security for quantum protocols
On lattices, learning with errors, random linear codes, and cryptography
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Zero-knowledge against quantum attacks
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
A Framework for Efficient and Composable Oblivious Transfer
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Composing Quantum Protocols in a Classical Environment
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Improving the Security of Quantum Protocols via Commit-and-Open
CRYPTO '09 Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology
Quantum-Secure Coin-Flipping and Applications
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Secure identification and QKD in the bounded-quantum-storage model
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Fully simulatable quantum-secure coin-flipping and applications
AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa
Fully simulatable quantum-secure coin-flipping and applications
AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa
Classical cryptographic protocols in a quantum world
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Feasibility and completeness of cryptographic tasks in the quantum world
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
| Hi-index | 0.00 |
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.