| Communication Complexity of Private Simultaneous Quantum Messages Protocols. | 0 | 0.34 | 2021 |
| Generalized predecessor existence problems for Boolean finite dynamical systems on directed graphs. | 0 | 0.34 | 2019 |
| Circuit lower bounds from learning-theoretic approaches. | 0 | 0.34 | 2018 |
| Quantum Query Complexity Of Unitary Operator Discrimination | 0 | 0.34 | 2017 |
| Generalized Predecessor Existence Problems for Boolean Finite Dynamical Systems. | 0 | 0.34 | 2017 |
| General Constructions of Rational Secret Sharing with Expected Constant-Round Reconstruction. | 1 | 0.35 | 2017 |
| Lower Bounds for Key Length of k-wise Almost Independent Permutations and Certain Symmetric-Key Encryption Schemes. | 0 | 0.34 | 2016 |
| A Fourier-Analytic Approach To List-Decoding For Sparse Random Linear Codes | 1 | 0.35 | 2015 |
| Post-Challenge Leakage Resilient Public-Key Cryptosystem In Split State Model | 0 | 0.34 | 2015 |
| The Query Complexity of Witness Finding. | 0 | 0.34 | 2014 |
| Hard Functions For Low-Degree Polynomials Over Prime Fields | 0 | 0.34 | 2013 |
| Symmetric-Key Encryption Scheme with Multi-ciphertext Non-malleability. | 0 | 0.34 | 2012 |
| Query Complexity and Error Tolerance of Witness Finding Algorithms. | 1 | 0.36 | 2012 |
| Estimating The Gowers Norm Of Modulo Functions Over Prime Fields | 0 | 0.34 | 2012 |
| Hard functions for low-degree polynomials over prime fields | 1 | 0.41 | 2011 |
| Characterization of the relations between information-theoretic non-malleability, secrecy, and authenticity | 6 | 0.56 | 2011 |
| Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding | 5 | 0.48 | 2010 |
| Security of encryption schemes in weakened random oracle models | 4 | 0.38 | 2010 |
| Strong Hardness Preserving Reduction from a P-Samplable Distribution to the Uniform Distribution for NP-Search Problems | 0 | 0.34 | 2009 |
| Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds | 4 | 0.40 | 2009 |
| Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems | 60 | 2.01 | 2008 |
| Quantum measurements for hidden subgroup problems with optimal sample complexity | 7 | 0.82 | 2008 |
| On the Power of Quantum Encryption Keys | 5 | 0.59 | 2008 |
| Improved algorithms for quantum identification of Boolean oracles | 9 | 0.70 | 2007 |
| Multi-bit cryptosystems based on lattice problems | 34 | 3.67 | 2007 |
| Progress in Quantum Computational Cryptography | 1 | 0.35 | 2006 |
| Compact Routing With Stretch Factor Of Less Than Three | 3 | 0.38 | 2005 |
| Compact Routing with Stretch Factor of Less Than Three. | 0 | 0.34 | 2005 |
| Quantum Sampling for Balanced Allocations. | 0 | 0.34 | 2005 |
| Computational indistinguishability between quantum states and its cryptographic application | 14 | 1.14 | 2005 |
| Quantum Sampling for Balanced Allocations | 0 | 0.34 | 2005 |
| Quantum Identification of Boolean Oracles | 18 | 0.99 | 2004 |
| Universal test for quantum one-way permutations | 4 | 0.41 | 2004 |
| Approximated two choices in randomized load balancing | 0 | 0.34 | 2004 |
| A new quantum claw-finding algorithm for three functions | 1 | 0.36 | 2003 |
| Compact routing with stretch factor of less than three (brief announcement) | 6 | 0.54 | 2000 |
