default search action
Akinori Kawachi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j22]Víctor Gabriel Reyes Macedo, Akinori Kawachi, Gina Gallegos-García
, Moisés Salinas-Rosales
A Threshold-Blind Signature Scheme and Its Application in Blockchain-Based Systems. IEEE Access 12: 138239-138251 (2024) - 2023
- [c25]Akinori Kawachi, Yuki Naito:
Quantum Query Lower Bounds for Key Recovery Attacks on the Even-Mansour Cipher. COCOON (2) 2023: 3-16 - [i13]Akinori Kawachi, Yuki Naito:
Quantum Query Lower Bounds for Key Recovery Attacks on the Even-Mansour Cipher. CoRR abs/2308.10418 (2023) - 2021
- [c24]Akinori Kawachi, Harumichi Nishimura:
Communication Complexity of Private Simultaneous Quantum Messages Protocols. ITC 2021: 20:1-20:19 - [c23]Akinori Kawachi:
Recent Progress in Private Simultaneous Messages Protocols. ITW 2021: 1-5 - [i12]Akinori Kawachi, Harumichi Nishimura:
Communication Complexity of Private Simultaneous Quantum Messages Protocols. CoRR abs/2105.07120 (2021) - [i11]Akinori Kawachi, Harumichi Nishimura:
Communication Complexity of Private simultaneous Quantum Messages Protocols. IACR Cryptol. ePrint Arch. 2021: 636 (2021) - [i10]Akinori Kawachi, Maki Yoshida:
Randomness Bounds for Private Simultaneous Messages and Conditional Disclosure of Secrets. IACR Cryptol. ePrint Arch. 2021: 1037 (2021) - 2020
- [j21]Akinori Kawachi:
Foreword. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 103-A(10): 1133 (2020) - [c22]Akinori Kawachi:
Hamming Weight of Product of Random Sparse Polynomials. ISITA 2020: 368-371 - [p1]Akinori Kawachi, Atsuko Miyaji, Kazuhisa Nakasho, Yiying Qi, Yuuki Takano:
Secure Primitive for Big Data Utilization. Security Infrastructure Technology for Integrated Utilization of Big Data 2020: 35-63
2010 – 2019
- 2019
- [j20]Akinori Kawachi, Kenichi Kawano, Francois Le Gall, Suguru Tamaki:
Quantum Query Complexity of Unitary Operator Discrimination. IEICE Trans. Inf. Syst. 102-D(3): 483-491 (2019) - [j19]Akinori Kawachi, Mitsunori Ogihara
Generalized predecessor existence problems for Boolean finite dynamical systems on directed graphs. Theor. Comput. Sci. 762: 25-40 (2019) - [c21]Hideaki Miyaji, Akinori Kawachi, Atsuko Miyaji
String commitment scheme with low output locality. AsiaJCIS 2019: 32-39 - 2018
- [j18]Akinori Kawachi:
Circuit lower bounds from learning-theoretic approaches. Theor. Comput. Sci. 733: 83-98 (2018) - 2017
- [j17]Akinori Kawachi, Yoshio Okamoto
General Constructions of Rational Secret Sharing with Expected Constant-Round Reconstruction. Comput. J. 60(5): 711-728 (2017) - [j16]Akinori Kawachi, Benjamin Rossman, Osamu Watanabe
The Query Complexity of Witness Finding. Theory Comput. Syst. 61(2): 305-321 (2017) - [c20]Akinori Kawachi, Kenichi Kawano, François Le Gall, Suguru Tamaki:
Quantum Query Complexity of Unitary Operator Discrimination. COCOON 2017: 309-320 - [c19]Akinori Kawachi, Mitsunori Ogihara
Generalized Predecessor Existence Problems for Boolean Finite Dynamical Systems. MFCS 2017: 8:1-8:13 - 2016
- [c18]Akinori Kawachi, Hirotoshi Takebe, Keisuke Tanaka:
Lower Bounds for Key Length of k-wise Almost Independent Permutations and Certain Symmetric-Key Encryption Schemes. IWSEC 2016: 195-211 - 2015
- [j15]Akinori Kawachi, Ikko Yamane:
A Fourier-Analytic Approach to List-Decoding for Sparse Random Linear Codes. IEICE Trans. Inf. Syst. 98-D(3): 532-540 (2015) - [j14]Eiichiro Fujisaki, Akinori Kawachi, Ryo Nishimaki, Keisuke Tanaka, Kenji Yasunaga:
Post-Challenge Leakage Resilient Public-Key Cryptosystem in Split State Model. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(3): 853-862 (2015) - 2014
- [c17]Akinori Kawachi, Benjamin Rossman, Osamu Watanabe
The Query Complexity of Witness Finding. CSR 2014: 218-231 - 2013
- [j13]Andrej Bogdanov, Akinori Kawachi, Hidetoki Tanaka:
Hard Functions for Low-Degree Polynomials over Prime Fields. ACM Trans. Comput. Theory 5(2): 5:1-5:15 (2013) - [i9]Akinori Kawachi, Yoshio Okamoto, Keisuke Tanaka, Kenji Yasunaga:
General Constructions of Rational Secret Sharing with Expected Constant-Round Reconstruction. IACR Cryptol. ePrint Arch. 2013: 874 (2013) - 2012
- [j12]Akinori Kawachi, Hidetoki Tanaka, Osamu Watanabe:
Estimating the Gowers Norm of Modulo Functions over Prime Fields. IEICE Trans. Inf. Syst. 95-D(3): 755-762 (2012) - [j11]Akinori Kawachi, Takeshi Koshiba
Computational Indistinguishability Between Quantum States and Its Cryptographic Application. J. Cryptol. 25(3): 528-555 (2012) - [c16]Akinori Kawachi, Hirotoshi Takebe, Keisuke Tanaka:
Symmetric-Key Encryption Scheme with Multi-ciphertext Non-malleability. IWSEC 2012: 123-137 - [i8]Akinori Kawachi, Benjamin Rossman, Osamu Watanabe:
Query Complexity and Error Tolerance of Witness Finding Algorithms. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j10]Baris Aydinlioglu, Dan Gutfreund, John M. Hitchcock
Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds. Comput. Complex. 20(2): 329-366 (2011) - [c15]Akinori Kawachi, Christopher Portmann, Keisuke Tanaka:
Characterization of the Relations between Information-Theoretic Non-malleability, Secrecy, and Authenticity. ICITS 2011: 6-24 - [c14]Andrej Bogdanov, Akinori Kawachi, Hidetoki Tanaka:
Hard Functions for Low-Degree Polynomials over Prime Fields. MFCS 2011: 120-131 - [i7]Akinori Kawachi, Christopher Portmann, Keisuke Tanaka:
Characterization of the relations between information-theoretic non-malleability, secrecy, and authenticity. IACR Cryptol. ePrint Arch. 2011: 92 (2011) - 2010
- [j9]Akinori Kawachi, Tomoyuki Yamakami:
Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding. SIAM J. Comput. 39(7): 2941-2969 (2010) - [c13]Dan Gutfreund, Akinori Kawachi:
Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds. CCC 2010: 38-49 - [c12]Akinori Kawachi, Akira Numayama, Keisuke Tanaka, Keita Xagawa
Security of Encryption Schemes in Weakened Random Oracle Models. Public Key Cryptography 2010: 403-419 - [i6]Akinori Kawachi, Akira Numayama, Keisuke Tanaka, Keita Xagawa:
Security of Encryption Schemes in Weakened Random Oracle Models. IACR Cryptol. ePrint Arch. 2010: 122 (2010)
2000 – 2009
- 2009
- [i5]Dan Gutfreund, Akinori Kawachi:
Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds. Electron. Colloquium Comput. Complex. TR09 (2009) - [i4]Akinori Kawachi, Osamu Watanabe:
Strong Hardness Preserving Reduction from a P-Samplable Distribution to the Uniform Distribution for NP-Search Problems. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j8]Masahito Hayashi, Akinori Kawachi, Hirotada Kobayashi:
Quantum measurements for hidden subgroup problems with optimal sample complexity. Quantum Inf. Comput. 8(3): 345-358 (2008) - [c11]Akinori Kawachi, Keisuke Tanaka, Keita Xagawa
Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems. ASIACRYPT 2008: 372-389 - [c10]Akinori Kawachi, Christopher Portmann:
On the Power of Quantum Encryption Keys. PQCrypto 2008: 165-180 - 2007
- [j7]Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Rudy Raymond
Improved algorithms for quantum identification of Boolean oracles. Theor. Comput. Sci. 378(1): 41-53 (2007) - [c9]Akinori Kawachi, Keisuke Tanaka, Keita Xagawa
Multi-bit Cryptosystems Based on Lattice Problems. Public Key Cryptography 2007: 315-329 - 2006
- [j6]Kazuo Iwama, Akinori Kawachi, Shigeru Yamashita:
Quantum Biased Oracles. Inf. Media Technol. 1(1): 169-177 (2006) - [j5]Akinori Kawachi, Takeshi Koshiba:
Progress in Quantum Computational Cryptography. J. Univers. Comput. Sci. 12(6): 691-709 (2006) - [c8]Akinori Kawachi, Tomoyuki Yamakami:
Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding. ICALP (2) 2006: 216-227 - [c7]Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Rudy Raymond Harry Putra
Improved Algorithms for Quantum Identification of Boolean Oracles. SWAT 2006: 280-291 - [i3]Akinori Kawachi, Tomoyuki Yamakami:
Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding. CoRR abs/quant-ph/0602088 (2006) - [i2]Akinori Kawachi, Tomoyuki Yamakami:
Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding. Electron. Colloquium Comput. Complex. TR06 (2006) - [i1]Akinori Kawachi, Takeshi Koshiba, Harumichi Nishimura, Tomoyuki Yamakami:
Computational Indistinguishability between Quantum States and Its Cryptographic Application. IACR Cryptol. ePrint Arch. 2006: 148 (2006) - 2005
- [j4]Kazuo Iwama, Akinori Kawachi, Shigeru Yamashita:
Quantum Sampling for Balanced Allocations. IEICE Trans. Inf. Syst. 88-D(1): 39-46 (2005) - [j3]Kazuo Iwama, Akinori Kawachi:
Compact Routing with Stretch Factor of Less Than Three. IEICE Trans. Inf. Syst. 88-D(1): 47-52 (2005) - [j2]Akinori Kawachi, Hirotada Kobayashi, Takeshi Koshiba
Universal test for quantum one-way permutations. Theor. Comput. Sci. 345(2-3): 370-385 (2005) - [c6]Akinori Kawachi, Takeshi Koshiba, Harumichi Nishimura, Tomoyuki Yamakami:
Computational Indistinguishability Between Quantum States and Its Cryptographic Application. EUROCRYPT 2005: 268-284 - 2004
- [c5]Kazuo Iwama, Akinori Kawachi:
Approximated Two Choices in Randomized Load Balancing. ISAAC 2004: 545-557 - [c4]Akinori Kawachi, Hirotada Kobayashi, Takeshi Koshiba, Raymond H. Putra:
Universal Test for Quantum One-Way Permutations. MFCS 2004: 839-850 - [c3]Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Hiroyuki Masuda, Raymond H. Putra, Shigeru Yamashita:
Quantum Identification of Boolean Oracles. STACS 2004: 105-116 - 2003
- [j1]Kazuo Iwama, Akinori Kawachi:
A New Quantum Claw-finding Algorithm for Three Functions. New Gener. Comput. 21(4): 319-327 (2003) - [c2]Kazuo Iwama, Akinori Kawachi, Shigeru Yamashita:
Quantum Sampling for Balanced Allocations. COCOON 2003: 304-318 - 2000
- [c1]Kazuo Iwama, Akinori Kawachi:
Compact routing with stretch factor of less than three (brief announcement). PODC 2000: 337
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 20:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: