| Publication | Date of Publication | Type |
|---|
Quantum query lower bounds for key recovery attacks on the Even-Mansour cipher
| 2024-08-22 | Paper |
Communication complexity of private simultaneous quantum messages protocols
| 2023-07-03 | Paper |
Generalized predecessor existence problems for Boolean finite dynamical systems
| 2020-05-26 | Paper |
Generalized predecessor existence problems for Boolean finite dynamical systems on directed graphs
Theoretical Computer Science | 2019-02-28 | Paper |
Lower bounds for key length of \(k\)-wise almost independent permutations and certain symmetric-key encryption schemes
| 2018-10-24 | Paper |
Circuit lower bounds from learning-theoretic approaches
Theoretical Computer Science | 2018-06-05 | Paper |
Quantum query complexity of unitary operator discrimination
| 2017-10-23 | Paper |
The query complexity of witness finding
Theory of Computing Systems | 2017-10-20 | Paper |
Hard functions for low-degree polynomials over prime fields
ACM Transactions on Computation Theory | 2015-09-24 | Paper |
The query complexity of witness finding
Computer Science - Theory and Applications | 2014-06-24 | Paper |
Introduction to quantum information science. Translated from the Japanese by the authors
Graduate Texts in Physics | 2014-06-04 | Paper |
Proving Circuit Lower Bounds in High Uniform Classes
Interdisciplinary Information Sciences | 2014-05-21 | Paper |
Symmetric-key encryption scheme with multi-ciphertext non-malleability
Advances in Information and Computer Security | 2013-04-04 | Paper |
Computational indistinguishability between quantum states and its cryptographic application
Journal of Cryptology | 2012-07-10 | Paper |
Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds
Computational Complexity | 2011-11-08 | Paper |
Hard functions for low-degree polynomials over prime fields
Mathematical Foundations of Computer Science 2011 | 2011-08-17 | Paper |
Characterization of the relations between information-theoretic non-malleability, secrecy, and authenticity
Lecture Notes in Computer Science | 2011-05-19 | Paper |
Quantum hardcore functions by complexity-theoretical quantum list decoding
SIAM Journal on Computing | 2011-04-04 | Paper |
Quantum sampling for balanced allocations
Lecture Notes in Computer Science | 2011-03-18 | Paper |
Security of Encryption Schemes in Weakened Random Oracle Models
Public Key Cryptography – PKC 2010 | 2010-05-28 | Paper |
Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
Advances in Cryptology - ASIACRYPT 2008 | 2009-02-10 | Paper |
On the Power of Quantum Encryption Keys
Post-Quantum Cryptography | 2008-11-11 | Paper |
Quantum measurements for hidden subgroup problems with optimal sample complexity
| 2008-11-03 | Paper |
Computational Indistinguishability Between Quantum States and Its Cryptographic Application
Lecture Notes in Computer Science | 2008-05-06 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding
Automata, Languages and Programming | 2007-09-11 | Paper |
Improved Algorithms for Quantum Identification of Boolean Oracles
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
Multi-bit Cryptosystems Based on Lattice Problems
Public Key Cryptography – PKC 2007 | 2007-09-04 | Paper |
Improved algorithms for quantum identification of Boolean oracles
Theoretical Computer Science | 2007-06-06 | Paper |
Quantum computational cryptography
| 2007-05-09 | Paper |
Quantum identification of Boolean oracles
| 2007-05-09 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Universal test for quantum one-way permutations
Theoretical Computer Science | 2005-12-06 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
A new quantum claw-finding algorithm for three functions
New Generation Computing | 2004-09-22 | Paper |
