Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
COMP |
2021-12-03 14:20 |
Ishikawa |
Kanazawa Chamber of Commerce and Industry (Primary: On-site, Secondary: Online) |
Computational Power of Shallow Quantum Circuits with Fan-out Gates Ryoga Araki, Akinori Kawachi (Mie Univ.), Francois Le Gall, Ansis Rosmanis (Nagoya Univ.) COMP2021-26 |
Quantum computers are expected to solve some problems much faster than classical computers. However, today's quantum com... [more] |
COMP2021-26 pp.24-29 |
COMP, IPSJ-AL |
2021-05-08 11:30 |
Online |
Online |
Experimental analysis of a classical algorithm spoofing linear cross-entropy benchmarking Kensuke Suzuki, Akinori Kawachi (Mie Univ.) COMP2021-7 |
Quantum computers are expected to be exponentially faster than classical computers in a specific computational task (qua... [more] |
COMP2021-7 pp.46-53 |
COMP |
2019-12-13 11:15 |
Gunma |
Ikaho Seminar House, Gunma University |
Computational complexity of satisfiability problem with exact number of solutions Hiromu Horiuchi, Naoyuki Morimoto, Toshiyuki Yamada, Akinori Kawachi (Mie Univ.) COMP2019-34 |
Valiant and Vazirani proved the isolation lemma for SAT to show a polynomial-time randomized reduction from SAT to Uniqu... [more] |
COMP2019-34 pp.39-43 |
IT, ISEC, WBS |
2019-03-07 15:05 |
Tokyo |
University of Electro-Communications |
String commitment with output locality Hideaki Miyaji, Akinori Kawachi, Atsuko Miyaji (OU) IT2018-85 ISEC2018-91 WBS2018-86 |
[more] |
IT2018-85 ISEC2018-91 WBS2018-86 pp.65-70 |
IT, ISEC, WBS |
2019-03-08 10:15 |
Tokyo |
University of Electro-Communications |
Secure Comparisonl based on Quasi-Cyclic Code Yiying Qi, Akinori Kawachi, Atsuko Miyaji (Osaka Univ.) IT2018-104 ISEC2018-110 WBS2018-105 |
If practical quantum computers are realized, it is known that most of cryptosystems based on number theory will be broke... [more] |
IT2018-104 ISEC2018-110 WBS2018-105 pp.175-180 |
ICSS, IPSJ-SPT |
2018-03-07 15:15 |
Hokkaido |
Okinawa Hokubu Koyou Nouryoku Kaihatsu Sougou Center |
Evaluation of HIBE based on Universal Sampler Shunsuke Otsuka, Akinori Kawachi, Atsuko Miyaji (Osaka Univ.) ICSS2017-63 |
In a system that participants use common parameters, the setup has to be executed honestly since a
corrupt setup includ... [more] |
ICSS2017-63 pp.73-78 |
LOIS, ISEC, SITE |
2017-11-09 17:00 |
Kyoto |
|
HIBE based on Universal Sampler Shunsuke Otsuka, Akinori Kawachi, Atsuko Miyaji (Osaka Univ.) ISEC2017-60 SITE2017-42 LOIS2017-37 |
In a system that participants use common parameters, the setup has to be executed honestly since a corrupt setup includi... [more] |
ISEC2017-60 SITE2017-42 LOIS2017-37 pp.71-77 |
COMP |
2014-03-10 09:45 |
Tokyo |
|
Quantum-Advised Algorithms for Biased Oracles Akinori Kawachi (Tokyo Inst. of Tech.) COMP2013-61 |
The biased oracles, which were
originally motivated from cryptographic
quantum reductions for the quantum Goldreich-... [more] |
COMP2013-61 pp.9-15 |
COMP, IPSJ-AL |
2013-05-17 13:35 |
Hokkaido |
Otaru University of Commerce |
Query Complexity of Witness Finding Akinori Kawachi (Tokyo Inst. of Tech.), Benjamin Rossman (NII), Osamu Watanabe (Tokyo Inst. of Tech.) COMP2013-11 |
For any polynomial-time relation L subset_of {0,1}^m x {0,1}^n where n = m^{O(1)}, the classic search-to-decision reduct... [more] |
COMP2013-11 pp.39-46 |
COMP |
2013-03-18 10:55 |
Gifu |
Gifu University |
[Tutorial Lecture]
Introduction to Computational Complexity Theory (2):Algorithmic Approaches to Lower Bounds of Computational Complexity Akinori Kawachi (Tokyo Inst. of Tech.) COMP2012-54 |
[more] |
COMP2012-54 p.13 |
IT |
2012-05-25 17:15 |
Fukuoka |
|
Rational Secret Sharing for Non-Simultaneous Channels Akinori Kawachi (Tokyo Inst. of Tech.), Yoshio Okamoto (Univ. of Electro-Comm.), Keisuke Tanaka (Tokyo Inst. of Tech.), Kenji Yasunaga (ISIT) IT2012-8 |
[more] |
IT2012-8 pp.41-46 |
COMP |
2012-04-27 10:00 |
Osaka |
Osaka Prefecture University |
Query Complexity for List Decoding Akinori Kawachi (Tokyo Inst. of Tech.) COMP2012-1 |
[more] |
COMP2012-1 pp.1-5 |
COMP |
2010-12-03 10:30 |
Fukuoka |
Kyutech Plaza, Kyushu Institute of Technology |
Hard Functions for Low-degree Polynomials over Prime Fields (Extended Abstract) Andrej Bogdanov (Chinese Univ. of Hong Kong), Akinori Kawachi, Hidetoki Tanaka (Tokyo Inst. of Tech.) COMP2010-39 |
In this paper, we present a new hardness amplification for low-degree polynomials over prime fields, namely, we prove th... [more] |
COMP2010-39 pp.1-6 |
COMP |
2010-12-03 13:00 |
Fukuoka |
Kyutech Plaza, Kyushu Institute of Technology |
Constant-round reconstruction for rational secret sharing Akinori Kawachi (Tokyo Inst. of Tech.), Yoshio Okamoto (JAIST), Keisuke Tanaka, Kenji Yasunaga (Tokyo Inst. of Tech.) COMP2010-41 |
[more] |
COMP2010-41 pp.15-21 |
COMP |
2010-10-15 13:55 |
Miyagi |
Tohoku Univ. |
Robust Quantum Codeword-State Decoding and Pseudorandomness of the Legendre Sequence (Extended Abstract) Akinori Kawachi (Tokyo Inst. of Tech.), Keita Xagawa (NTT) COMP2010-35 |
[more] |
COMP2010-35 pp.27-33 |
COMP |
2007-06-29 10:30 |
Hokkaido |
Hokkaido University |
Towards closing a gap between worst-case and average-case NP hardness Akinori Kawachi, Osamu Watanabe (Tokyo Inst. of Tech.) COMP2007-21 |
It is significant in the computational complexity theory and the foundations
of cryptography to construct problems har... [more] |
COMP2007-21 pp.25-32 |
COMP |
2005-09-15 13:20 |
Osaka |
Osaka Univ., Toyonaka Campus |
[Tutorial Lecture]
NA Akinori Kawachi (Tokyo Tech.) |
Applications of quantum information processing to cryptography has played a central role in the quantum information scie... [more] |
|
COMP |
2005-03-18 09:25 |
Tokyo |
Tokyo Institute of Technology |
A General Construction of Hard-Core Predicates for Any Quantum One-Way Function Akinori Kawachi (Tokyo Inst. Tech.), Tomoyuki Yamakami (Trent Univ.) |
We propose a general construction of hard-core predicates for any quantum one-way function in this paper. Our constructi... [more] |
COMP2004-74 pp.9-16 |