Collapse-Binding Quantum Commitments Without Random Oracles
暂无分享,去创建一个
[1] I. Damgård,et al. Zero-Knowledge Proofs and String Commitments Withstanding Quantum Attacks , 2004, CRYPTO.
[2] John Watrous. Zero-Knowledge against Quantum Attacks , 2009, SIAM J. Comput..
[3] Dominique Unruh,et al. Quantum Proofs of Knowledge , 2012, IACR Cryptol. ePrint Arch..
[4] Brent Waters,et al. Lossy Trapdoor Functions and Their Applications , 2011, SIAM J. Comput..
[5] Dominique Unruh,et al. Computationally Binding Quantum Commitments , 2016, EUROCRYPT.
[6] Ivan Damgård,et al. On the existence of statistically hiding bit commitment schemes and fail-stop signatures , 1994, Journal of Cryptology.
[7] Mark Zhandry,et al. How to Construct Quantum Random Functions , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[8] Dominic Mayers. Unconditionally secure quantum bit commitment is impossible , 1997 .
[9] Louis Salvail,et al. Computational Collapse of Quantum State with Application to Oblivious Transfer , 2003, TCC.
[10] Mihir Bellare,et al. Lecture Notes on Cryptography , 2001 .
[11] Silvio Micali,et al. Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing , 1996, CRYPTO.
[12] Andris Ambainis,et al. Quantum Attacks on Classical Proof Systems: The Hardness of Quantum Rewinding , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[13] Louis Salvail,et al. Perfectly Concealing Quantum Bit Commitment from any Quantum One-Way Permutation , 2000, EUROCRYPT.
[14] Leonid A. Levin,et al. A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..
[15] Dongdai Lin,et al. Quantum Bit Commitment with Application in Quantum Zero-Knowledge Proof (Extended Abstract) , 2015, ISAAC.
[16] Louis Salvail,et al. Two Provers in Isolation , 2011, ASIACRYPT.