dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Akinori Kawachi Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2012
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAkinori Kawachi, Benjamin Rossman, Osamu Watanabe: Query Complexity and Error Tolerance of Witness Finding Algorithms. Electronic Colloquium on Computational Complexity (ECCC) 19: 2 (2012)
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAkinori Kawachi, Hidetoki Tanaka, Osamu Watanabe: Estimating the Gowers Norm of Modulo Functions over Prime Fields. IEICE Transactions 95-D(3): 755-762 (2012)
32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAkinori Kawachi, Takeshi Koshiba, Harumichi Nishimura, Tomoyuki Yamakami: Computational Indistinguishability Between Quantum States and Its Cryptographic Application. J. Cryptology 25(3): 528-555 (2012)
2011
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAkinori Kawachi, Christopher Portmann, Keisuke Tanaka: Characterization of the Relations between Information-Theoretic Non-malleability, Secrecy, and Authenticity. ICITS 2011: 6-24
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrej Bogdanov, Akinori Kawachi, Hidetoki Tanaka: Hard Functions for Low-Degree Polynomials over Prime Fields. MFCS 2011: 120-131
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBaris Aydinlioglu, Dan Gutfreund, John M. Hitchcock, Akinori Kawachi: Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds. Computational Complexity 20(2): 329-366 (2011)
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAkinori Kawachi, Christopher Portmann, Keisuke Tanaka: Characterization of the relations between information-theoretic non-malleability, secrecy, and authenticity. IACR Cryptology ePrint Archive 2011: 92 (2011)
2010
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDan Gutfreund, Akinori Kawachi: Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds. IEEE Conference on Computational Complexity 2010: 38-49
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAkinori Kawachi, Akira Numayama, Keisuke Tanaka, Keita Xagawa: Security of Encryption Schemes in Weakened Random Oracle Models. Public Key Cryptography 2010: 403-419
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAkinori Kawachi, Akira Numayama, Keisuke Tanaka, Keita Xagawa: Security of Encryption Schemes in Weakened Random Oracle Models. IACR Cryptology ePrint Archive 2010: 122 (2010)
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAkinori Kawachi, Tomoyuki Yamakami: Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding. SIAM J. Comput. 39(7): 2941-2969 (2010)
2009
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDan Gutfreund, Akinori Kawachi: Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds. Electronic Colloquium on Computational Complexity (ECCC) 16: 146 (2009)
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAkinori Kawachi, Osamu Watanabe: Strong Hardness Preserving Reduction from a P-Samplable Distribution to the Uniform Distribution for NP-Search Problems. Electronic Colloquium on Computational Complexity (ECCC) 16: 23 (2009)
2008
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAkinori Kawachi, Keisuke Tanaka, Keita Xagawa: Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems. ASIACRYPT 2008: 372-389
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAkinori Kawachi, Christopher Portmann: On the Power of Quantum Encryption Keys. PQCrypto 2008: 165-180
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMasahito Hayashi, Akinori Kawachi, Hirotada Kobayashi: Quantum measurements for hidden subgroup problems with optimal sample complexity. Quantum Information & Computation 8(3): 345-358 (2008)
2007
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAkinori Kawachi, Keisuke Tanaka, Keita Xagawa: Multi-bit Cryptosystems Based on Lattice Problems. Public Key Cryptography 2007: 315-329
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndris Ambainis, Kazuo Iwama, Akinori Kawachi, Rudy Raymond, Shigeru Yamashita: Improved algorithms for quantum identification of Boolean oracles. Theor. Comput. Sci. 378(1): 41-53 (2007)
2006
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAkinori Kawachi, Tomoyuki Yamakami: Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding. ICALP (2) 2006: 216-227
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndris Ambainis, Kazuo Iwama, Akinori Kawachi, Rudy Raymond Harry Putra, Shigeru Yamashita: Improved Algorithms for Quantum Identification of Boolean Oracles. SWAT 2006: 280-291
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAkinori Kawachi, Tomoyuki Yamakami: Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding CoRR abs/quant-ph/0602088: (2006)
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAkinori Kawachi, Tomoyuki Yamakami: Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding. Electronic Colloquium on Computational Complexity (ECCC) 13(020): (2006)
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAkinori Kawachi, Takeshi Koshiba, Harumichi Nishimura, Tomoyuki Yamakami: Computational Indistinguishability between Quantum States and Its Cryptographic Application. IACR Cryptology ePrint Archive 2006: 148 (2006)
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAkinori Kawachi, Takeshi Koshiba: Progress in Quantum Computational Cryptography. J. UCS 12(6): 691-709 (2006)
2005
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAkinori Kawachi, Takeshi Koshiba, Harumichi Nishimura, Tomoyuki Yamakami: Computational Indistinguishability Between Quantum States and Its Cryptographic Application. EUROCRYPT 2005: 268-284
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKazuo Iwama, Akinori Kawachi, Shigeru Yamashita: Quantum Sampling for Balanced Allocations. IEICE Transactions 88-D(1): 39-46 (2005)
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKazuo Iwama, Akinori Kawachi: Compact Routing with Stretch Factor of Less Than Three. IEICE Transactions 88-D(1): 47-52 (2005)
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAkinori Kawachi, Hirotada Kobayashi, Takeshi Koshiba, Raymond H. Putra: Universal test for quantum one-way permutations. Theor. Comput. Sci. 345(2-3): 370-385 (2005)
2004
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKazuo Iwama, Akinori Kawachi: Approximated Two Choices in Randomized Load Balancing. ISAAC 2004: 545-557
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAkinori Kawachi, Hirotada Kobayashi, Takeshi Koshiba, Raymond H. Putra: Universal Test for Quantum One-Way Permutations. MFCS 2004: 839-850
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndris Ambainis, Kazuo Iwama, Akinori Kawachi, Hiroyuki Masuda, Raymond H. Putra, Shigeru Yamashita: Quantum Identification of Boolean Oracles. STACS 2004: 105-116
2003
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKazuo Iwama, Akinori Kawachi, Shigeru Yamashita: Quantum Sampling for Balanced Allocations. COCOON 2003: 304-318
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKazuo Iwama, Akinori Kawachi: A New Quantum Claw-finding Algorithm for Three Functions. New Generation Comput. 21(4): 319-327 (2003)
2000
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKazuo Iwama, Akinori Kawachi: Compact routing with stretch factor of less than three (brief announcement). PODC 2000: 337

Coauthor Index

1Andris Ambainis [4] [15] [17]
2Baris Aydinlioglu [29]
3Andrej Bogdanov [30]
4Dan Gutfreund (Danny Gutfreund) [23] [27] [29]
5Masahito Hayashi [19]
6John M. Hitchcock [29]
7Kazuo Iwama [1] [2] [3] [4] [6] [8] [9] [15] [17]
8Hirotada Kobayashi [5] [7] [19]
9Takeshi Koshiba [5] [7] [10] [11] [12] [32]
10Hiroyuki Masuda [4]
11Harumichi Nishimura [10] [12] [32]
12Akira Numayama [25] [26]
13Christopher Portmann [20] [28] [31]
14Raymond H. Putra (Rudy Raymond Harry Putra) [4] [5] [7] [15]
15Rudy Raymond [17]
16Benjamin Rossman [34]
17Hidetoki Tanaka [30] [33]
18Keisuke Tanaka [18] [21] [25] [26] [28] [31]
19Osamu Watanabe [22] [33] [34]
20Keita Xagawa [18] [21] [25] [26]
21Tomoyuki Yamakami [10] [12] [13] [14] [16] [24] [32]
22Shigeru Yamashita [3] [4] [9] [15] [17]

Colors in the list of coauthors

Last update Sat Jun 2 20:57:36 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page