The following pages link to Akinori Kawachi (Q434346):
Displaying 34 items.
- Computational indistinguishability between quantum states and its cryptographic application (Q434349) (← links)
- Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds (Q645124) (← links)
- Improved algorithms for quantum identification of Boolean oracles (Q884445) (← links)
- Generalized predecessor existence problems for Boolean finite dynamical systems on directed graphs (Q1729688) (← links)
- Lower bounds for key length of \(k\)-wise almost independent permutations and certain symmetric-key encryption schemes (Q1800680) (← links)
- A new quantum claw-finding algorithm for three functions (Q1880337) (← links)
- The query complexity of witness finding (Q2411034) (← links)
- Quantum query complexity of unitary operator discrimination (Q2412421) (← links)
- Universal test for quantum one-way permutations (Q2575756) (← links)
- Circuit lower bounds from learning-theoretic approaches (Q2636410) (← links)
- Characterization of the Relations between Information-Theoretic Non-malleability, Secrecy, and Authenticity (Q3002097) (← links)
- Quantum Sampling for Balanced Allocations (Q3082938) (← links)
- (Q3437580) (← links)
- (Q3437586) (← links)
- (Q3534623) (← links)
- On the Power of Quantum Encryption Keys (Q3535360) (← links)
- Security of Encryption Schemes in Weakened Random Oracle Models (Q3562912) (← links)
- Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding (Q3591441) (← links)
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems (Q3600386) (← links)
- Symmetric-Key Encryption Scheme with Multi-ciphertext Non-malleability (Q4912406) (← links)
- The Query Complexity of Witness Finding (Q4981161) (← links)
- Generalized Predecessor Existence Problems for Boolean Finite Dynamical Systems (Q5111222) (← links)
- STACS 2004 (Q5309692) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311155) (← links)
- Computational Indistinguishability Between Quantum States and Its Cryptographic Application (Q5385734) (← links)
- Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding (Q5390582) (← links)
- Proving Circuit Lower Bounds in High Uniform Classes (Q5417530) (← links)
- Introduction to Quantum Information Science (Q5419050) (← links)
- Algorithms and Computation (Q5712143) (← links)
- Multi-bit Cryptosystems Based on Lattice Problems (Q5756540) (← links)
- Improved Algorithms for Quantum Identification of Boolean Oracles (Q5757907) (← links)
- Hard Functions for Low-Degree Polynomials over Prime Fields (Q5892189) (← links)
- Hard Functions for Low-Degree Polynomials over Prime Fields (Q5894222) (← links)
- (Q6107273) (← links)
