暂无分享,去创建一个
Kai-Min Chung | Serge Fehr | Yu-Hsuan Huang | Tai-Ning Liao | S. Fehr | Kai-Min Chung | Tai-Ning Liao | Yu-Hsuan Huang
[1] Mark Zhandry,et al. Revisiting Post-Quantum Fiat-Shamir , 2019, IACR Cryptol. ePrint Arch..
[2] Dominique Unruh,et al. Revocable Quantum Timed-Release Encryption , 2014, J. ACM.
[3] Christof Zalka. GROVER'S QUANTUM SEARCHING ALGORITHM IS OPTIMAL , 1997, quant-ph/9711070.
[4] Jeremiah Blocki,et al. On the Security of Proofs of Sequential Work in a Post-Quantum World , 2020, ITC.
[5] Yassine Hamoudi,et al. Quantum Time-Space Tradeoffs by Recording Queries , 2020, ArXiv.
[6] Amos Fiat,et al. How to Prove Yourself: Practical Solutions to Identification and Signature Problems , 1986, CRYPTO.
[7] Tetsu Iwata,et al. 4-Round Luby-Rackoff Construction is a qPRP , 2019, ASIACRYPT.
[8] Christian Schaffner,et al. Quantum Lazy Sampling and Game-Playing Proofs for Quantum Indifferentiability , 2019, IACR Cryptol. ePrint Arch..
[9] Gilles Brassard,et al. Strengths and Weaknesses of Quantum Computing , 1997, SIAM J. Comput..
[10] Mihir Bellare,et al. Random oracles are practical: a paradigm for designing efficient protocols , 1993, CCS '93.
[11] Gilles Brassard,et al. Quantum Algorithm for the Collision Problem , 2016, Encyclopedia of Algorithms.
[12] Mark Zhandry,et al. Random Oracles in a Quantum World , 2010, ASIACRYPT.
[13] Mark Zhandry,et al. How to Record Quantum Queries, and Applications to Quantum Indifferentiability , 2019, IACR Cryptol. ePrint Arch..
[14] Stacey Jeffery,et al. Optimal Parallel Quantum Query Algorithms , 2013, Algorithmica.
[15] Krzysztof Pietrzak,et al. Simple Proofs of Sequential Work , 2018, IACR Cryptol. ePrint Arch..
[16] Gilles Brassard,et al. Quantum Cryptanalysis of Hash and Claw-Free Functions , 1998, LATIN.
[17] Lov K. Grover. A fast quantum mechanical algorithm for database search , 1996, STOC '96.
[18] Peter Manohar,et al. Succinct Arguments in the Quantum Random Oracle Model , 2019, IACR Cryptol. ePrint Arch..
[19] Andris Ambainis,et al. Polynomial Degree and Lower Bounds in Quantum Complexity: Collision and Element Distinctness with Small Range , 2003, Theory Comput..
[20] Ran Canetti,et al. The random oracle methodology, revisited , 2000, JACM.