Akinori Kawachi
Orcid: 0000-0001-9218-9944
According to our database1,
Akinori Kawachi
authored at least 44 papers
between 2000 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2025
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2025
2024
IEEE Access, 2024
2023
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
Proceedings of the IEEE Information Theory Workshop, 2021
Proceedings of the 2nd Conference on Information-Theoretic Cryptography, 2021
2020
Proceedings of the International Symposium on Information Theory and Its Applications, 2020
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
Proceedings of the 14th Asia Joint Conference on Information Security, 2019
2018
2017
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017
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
IEICE Trans. Inf. Syst., 2015
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015
2014
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
IEICE Trans. Inf. Syst., 2012
Electron. Colloquium Comput. Complex., 2012
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
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
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 Inf. Comput., 2008
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
Proceedings of the Public Key Cryptography, 2007
2006
Proceedings of the Algorithm Theory, 2006
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006
2005
IEICE Trans. Inf. Syst., 2005
Computational Indistinguishability Between Quantum States and Its Cryptographic Application.
Proceedings of the Advances in Cryptology, 2005
2004
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004
2003
Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003
2000
Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000