- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j10 |      | Akinori Kawachi, Takeshi Koshiba, Harumichi Nishimura, Tomoyuki Yamakami: Computational Indistinguishability Between Quantum States and Its Cryptographic Application. J. Cryptology 25(3): 528-555 (2012) |
| 2010 | ||
| c20 | | Takeshi Koshiba, Shinya Sawada: Public Discussion Must Be Back and Forth in Secure Message Transmission. ICISC 2010: 325-337 |
| 2009 | ||
| c19 | | K. Y. Cheong, Takeshi Koshiba, Shohei Nishiyama: Strengthening the Security of Distributed Oblivious Transfer. ACISP 2009: 377-388 |
| c18 | | K. Y. Cheong, Takeshi Koshiba: Reducing Complexity Assumptions for Oblivious Transfer. IWSEC 2009: 110-124 |
| c17 | | Takeshi Koshiba, Takanori Odaira: Statistically-Hiding Quantum Bit Commitment from Approximable-Preimage-Size Quantum One-Way Function. TCQ 2009: 33-46 |
| 2008 | ||
| j9 | | Kaoru Kurosawa, Wataru Kishimoto, Takeshi Koshiba: A Combinatorial Approach to Deriving Lower Bounds for Perfectly Secure Oblivious Transfer Reductions. IEEE Transactions on Information Theory 54(6): 2566-2571 (2008) |
| c16 | | Kaoru Kurosawa, Takeshi Koshiba: Simple Direct Reduction of String (1, 2)-OT to Rabin's OT without Privacy Amplification. ICITS 2008: 199-209 |
| i7 | | K. Y. Cheong, Takeshi Koshiba: Reducing Complexity Assumptions for Oblivious Transfer. IACR Cryptology ePrint Archive 2008: 140 (2008) |
| 2007 | ||
| j8 | | Tetsuya Izu, Jun Kogure, Takeshi Koshiba, Takeshi Shimoyama: Low-density attack revisited. Des. Codes Cryptography 43(1): 47-59 (2007) |
| i6 | | Kaoru Kurosawa, Takeshi Koshiba: Direct Reduction of String (1, 2)-OT to Rabin's OT. IACR Cryptology ePrint Archive 2007: 46 (2007) |
| i5 | | Kaoru Kurosawa, Wataru Kishimoto, Takeshi Koshiba: How to Derive Lower Bound on Oblivious Transfer Reduction. IACR Cryptology ePrint Archive 2007: 65 (2007) |
| i4 | | Tetsuya Izu, Jun Kogure, Takeshi Koshiba, Takeshi Shimoyama: Low-Density Attack Revisited. IACR Cryptology ePrint Archive 2007: 66 (2007) |
| 2006 | ||
| j7 | | Akinori Kawachi, Takeshi Koshiba: Progress in Quantum Computational Cryptography. J. UCS 12(6): 691-709 (2006) |
| i3 | | Takeshi Koshiba, Yoshiharu Seri: Round-Efficient One-Way Permutation Based Perfectly Concealing Bit Commitment Scheme. Electronic Colloquium on Computational Complexity (ECCC) 13(093) (2006) |
| i2 | | Akinori Kawachi, Takeshi Koshiba, Harumichi Nishimura, Tomoyuki Yamakami: Computational Indistinguishability between Quantum States and Its Cryptographic Application. IACR Cryptology ePrint Archive 2006: 148 (2006) |
| 2005 | ||
| j6 | | Akinori Kawachi, Hirotada Kobayashi, Takeshi Koshiba, Raymond H. Putra: Universal test for quantum one-way permutations. Theor. Comput. Sci. 345(2-3): 370-385 (2005) |
| c15 | | Akinori Kawachi, Takeshi Koshiba, Harumichi Nishimura, Tomoyuki Yamakami: Computational Indistinguishability Between Quantum States and Its Cryptographic Application. EUROCRYPT 2005: 268-284 |
| 2004 | ||
| j5 | | Masahiko Takenaka, Takeshi Shimoyama, Takeshi Koshiba: Theoretical Analysis of chi2 Attack on RC6. IEICE Transactions 87-A(1): 28-36 (2004) |
| c14 | | Akinori Kawachi, Hirotada Kobayashi, Takeshi Koshiba, Raymond H. Putra: Universal Test for Quantum One-Way Permutations. MFCS 2004: 839-850 |
| c13 | | Takeshi Koshiba, Kaoru Kurosawa: Short Exponent Diffie-Hellman Problems. Public Key Cryptography 2004: 173-186 |
| 2003 | ||
| c12 | | Masahiko Takenaka, Takeshi Shimoyama, Takeshi Koshiba: Theoretical Analysis of chi2 Attack on RC6. ACISP 2003: 142-153 |
| 2002 | ||
| c11 | | Takeshi Shimoyama, Masahiko Takenaka, Takeshi Koshiba: Multiple Linear Cryptanalysis of a Reduced Round RC6. FSE 2002: 76-88 |
| c10 | | Takeshi Koshiba: On Sufficient Randomness for Secure Public-Key Cryptosystems. Public Key Cryptography 2002: 34-47 |
| i1 | | Masahiko Takenaka, Takeshi Shimoyama, Takeshi Koshiba: Theoretical Analysis of "Correlations in RC6". IACR Cryptology ePrint Archive 2002: 176 (2002) |
| 2001 | ||
| c9 | | Takeshi Koshiba: Polynomial-Time Algorithms for the Equivalence for One-Way Quantum Finite Automata. ISAAC 2001: 268-278 |
| c8 | | Takeshi Koshiba: A New Aspect for Security Notions: Secure Randomness in Public-Key Encryption Schemes. Public Key Cryptography 2001: 87-103 |
| 2000 | ||
| j4 | | Takeshi Koshiba, Erkki Mäkinen, Yuji Takada: Inferring pure context-free languages from positive data. Acta Cybern. 14(3): 469-477 (2000) |
| c7 |  | Takeshi Koshiba, Kunihiko Hiraishi: A Note on Finding One-Variable Patterns Consistent with Examples and Counterexamples. Words, Languages & Combinatorics 2000: 253-265 |
| 1999 | ||
| c6 | | Takeshi Koshiba: A Technique for Boosting the Security of Cryptographic Systems with One-Way Hash Functions. ICISC 1999: 76-81 |
| 1998 | ||
| c5 | | Kazuo Misue, Kiyoshi Nitta, Kozo Sugiyama, Takeshi Koshiba, R. Inder: Enhancing D-ABDUCTOR towards a diagrammatic user interface platform. KES (1) 1998: 359-368 |
| 1997 | ||
| j3 | | Takeshi Koshiba: On a Hierarchy of Slender Languages Based on Control Sets. Fundam. Inform. 31(1): 41-47 (1997) |
| j2 | | Takeshi Koshiba, Erkki Mäkinen, Yuji Takada: Learning Deterministic even Linear Languages From Positive Examples. Theor. Comput. Sci. 185(1): 63-79 (1997) |
| c4 | | Takeshi Koshiba: Computational learning theoretic cryptanalysis of language theoretic cryptosystems. ICICS 1997: 28-38 |
| 1996 | ||
| j1 | | Yasubumi Sakakibara, Kazuo Misue, Takeshi Koshiba: A machine learning approach to knowledge acquisitions from text databases. Int. J. Hum. Comput. Interaction 8(3): 309-324 (1996) |
| c3 | | Takeshi Koshiba: Decision Tree Learning Systems with Switching Evaluators. Canadian Conference on AI 1996: 349-361 |
| 1995 | ||
| c2 | | Takeshi Koshiba, Erkki Mäkinen, Yuji Takada: Learning Strongly Deterministic Even Linear Languages from Positive Examples. ALT 1995: 41-54 |
| c1 | | |
Colors in the list of coauthors
Last update Sun May 19 01:25:50 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page