Akinori Kawachi

According to our database1, Akinori Kawachi authored at least 44 papers between 2000 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Private Quantum Signal Processing.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2025

2024
A Threshold-Blind Signature Scheme and Its Application in Blockchain-Based Systems.
IEEE Access, 2024

2023
Quantum Query Lower Bounds for Key Recovery Attacks on the Even-Mansour Cipher.
Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

2021
Randomness Bounds for Private Simultaneous Messages and Conditional Disclosure of Secrets.
IACR Cryptol. ePrint Arch., 2021

Recent Progress in Private Simultaneous Messages Protocols.
Proceedings of the IEEE Information Theory Workshop, 2021

Communication Complexity of Private Simultaneous Quantum Messages Protocols.
Proceedings of the 2nd Conference on Information-Theoretic Cryptography, 2021

2020
Foreword.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2020

Hamming Weight of Product of Random Sparse Polynomials.
Proceedings of the International Symposium on Information Theory and Its Applications, 2020

Secure Primitive for Big Data Utilization.
Proceedings of the Security Infrastructure Technology for Integrated Utilization of Big Data, 2020

2019
Generalized predecessor existence problems for Boolean finite dynamical systems on directed graphs.
Theor. Comput. Sci., 2019

String commitment scheme with low output locality.
Proceedings of the 14th Asia Joint Conference on Information Security, 2019

2018
Circuit lower bounds from learning-theoretic approaches.
Theor. Comput. Sci., 2018

2017
Generalized Predecessor Existence Problems for Boolean Finite Dynamical Systems.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Quantum Query Complexity of Unitary Operator Discrimination.
Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

2016
Lower Bounds for Key Length of k-wise Almost Independent Permutations and Certain Symmetric-Key Encryption Schemes.
Proceedings of the Advances in Information and Computer Security, 2016

2015
A Fourier-Analytic Approach to List-Decoding for Sparse Random Linear Codes.
IEICE Trans. Inf. Syst., 2015

Post-Challenge Leakage Resilient Public-Key Cryptosystem in Split State Model.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015

2014
The Query Complexity of Witness Finding.
Proceedings of the Computer Science - Theory and Applications, 2014

2013
General Constructions of Rational Secret Sharing with Expected Constant-Round Reconstruction.
IACR Cryptol. ePrint Arch., 2013

2012
Estimating the Gowers Norm of Modulo Functions over Prime Fields.
IEICE Trans. Inf. Syst., 2012

Query Complexity and Error Tolerance of Witness Finding Algorithms.
Electron. Colloquium Comput. Complex., 2012

Symmetric-Key Encryption Scheme with Multi-ciphertext Non-malleability.
Proceedings of the Advances in Information and Computer Security, 2012

2011
Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds.
Comput. Complex., 2011

Hard Functions for Low-Degree Polynomials over Prime Fields.
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

Characterization of the Relations between Information-Theoretic Non-malleability, Secrecy, and Authenticity.
Proceedings of the Information Theoretic Security - 5th International Conference, 2011

2010
Security of Encryption Schemes in Weakened Random Oracle Models.
Proceedings of the Public Key Cryptography, 2010

Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds.
Proceedings of the 25th Annual IEEE Conference on Computational Complexity, 2010

2009
Strong Hardness Preserving Reduction from a P-Samplable Distribution to the Uniform Distribution for NP-Search Problems.
Electron. Colloquium Comput. Complex., 2009

2008
Quantum measurements for hidden subgroup problems with optimal sample complexity.
Quantum Inf. Comput., 2008

On the Power of Quantum Encryption Keys.
Proceedings of the Post-Quantum Cryptography, Second International Workshop, 2008

Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems.
Proceedings of the Advances in Cryptology, 2008

2007
Multi-bit Cryptosystems Based on Lattice Problems.
Proceedings of the Public Key Cryptography, 2007

2006
Progress in Quantum Computational Cryptography.
J. Univers. Comput. Sci., 2006

Quantum Biased Oracles.
Inf. Media Technol., 2006

Improved Algorithms for Quantum Identification of Boolean Oracles.
Proceedings of the Algorithm Theory, 2006

Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005
Compact Routing with Stretch Factor of Less Than Three.
IEICE Trans. Inf. Syst., 2005

Computational Indistinguishability Between Quantum States and Its Cryptographic Application.
Proceedings of the Advances in Cryptology, 2005

2004
Quantum Identification of Boolean Oracles.
Proceedings of the STACS 2004, 2004

Universal Test for Quantum One-Way Permutations.
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

Approximated Two Choices in Randomized Load Balancing.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

2003
A New Quantum Claw-finding Algorithm for Three Functions.
New Gener. Comput., 2003

Quantum Sampling for Balanced Allocations.
Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

2000
Compact routing with stretch factor of less than three (brief announcement).
Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000


  Loading...