| 2008 |
|---|
| 24 | EE | Kaoru Kurosawa,
Takeshi Koshiba:
Simple Direct Reduction of String (1, 2)-OT to Rabin's OT without Privacy Amplification.
ICITS 2008: 199-209 |
| 23 | EE | 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) |
| 2007 |
|---|
| 22 | EE | Tetsuya Izu,
Jun Kogure,
Takeshi Koshiba,
Takeshi Shimoyama:
Low-density attack revisited.
Des. Codes Cryptography 43(1): 47-59 (2007) |
| 2006 |
|---|
| 21 | EE | Takeshi Koshiba,
Yoshiharu Seri:
Round-Efficient One-Way Permutation Based Perfectly Concealing Bit Commitment Scheme.
Electronic Colloquium on Computational Complexity (ECCC) 13(093): (2006) |
| 20 | EE | Akinori Kawachi,
Takeshi Koshiba:
Progress in Quantum Computational Cryptography.
J. UCS 12(6): 691-709 (2006) |
| 2005 |
|---|
| 19 | EE | Akinori Kawachi,
Takeshi Koshiba,
Harumichi Nishimura,
Tomoyuki Yamakami:
Computational Indistinguishability Between Quantum States and Its Cryptographic Application.
EUROCRYPT 2005: 268-284 |
| 18 | EE | 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) |
| 2004 |
|---|
| 17 | EE | Akinori Kawachi,
Hirotada Kobayashi,
Takeshi Koshiba,
Raymond H. Putra:
Universal Test for Quantum One-Way Permutations.
MFCS 2004: 839-850 |
| 16 | EE | Takeshi Koshiba,
Kaoru Kurosawa:
Short Exponent Diffie-Hellman Problems.
Public Key Cryptography 2004: 173-186 |
| 15 | EE | Masahiko Takenaka,
Takeshi Shimoyama,
Takeshi Koshiba:
Theoretical Analysis of chi2 Attack on RC6.
IEICE Transactions 87-A(1): 28-36 (2004) |
| 2003 |
|---|
| 14 | EE | Masahiko Takenaka,
Takeshi Shimoyama,
Takeshi Koshiba:
Theoretical Analysis of chi2 Attack on RC6.
ACISP 2003: 142-153 |
| 2002 |
|---|
| 13 | EE | Takeshi Shimoyama,
Masahiko Takenaka,
Takeshi Koshiba:
Multiple Linear Cryptanalysis of a Reduced Round RC6.
FSE 2002: 76-88 |
| 12 | EE | Takeshi Koshiba:
On Sufficient Randomness for Secure Public-Key Cryptosystems.
Public Key Cryptography 2002: 34-47 |
| 2001 |
|---|
| 11 | EE | Takeshi Koshiba:
Polynomial-Time Algorithms for the Equivalence for One-Way Quantum Finite Automata.
ISAAC 2001: 268-278 |
| 10 | EE | Takeshi Koshiba:
A New Aspect for Security Notions: Secure Randomness in Public-Key Encryption Schemes.
Public Key Cryptography 2001: 87-103 |
| 2000 |
|---|
| 9 | EE | Takeshi Koshiba,
Erkki Mäkinen,
Yuji Takada:
Inferring pure context-free languages from positive data.
Acta Cybern. 14(3): 469-477 (2000) |
| 1999 |
|---|
| 8 | | Takeshi Koshiba:
A Technique for Boosting the Security of Cryptographic Systems with One-Way Hash Functions.
ICISC 1999: 76-81 |
| 1998 |
|---|
| 7 | EE | 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 |
|---|
| 6 | | Takeshi Koshiba:
Computational learning theoretic cryptanalysis of language theoretic cryptosystems.
ICICS 1997: 28-38 |
| 5 | | Takeshi Koshiba:
On a Hierarchy of Slender Languages Based on Control Sets.
Fundam. Inform. 31(1): 41-47 (1997) |
| 4 | EE | Takeshi Koshiba,
Erkki Mäkinen,
Yuji Takada:
Learning Deterministic even Linear Languages From Positive Examples.
Theor. Comput. Sci. 185(1): 63-79 (1997) |
| 1996 |
|---|
| 3 | | Takeshi Koshiba:
Decision Tree Learning Systems with Switching Evaluators.
Canadian Conference on AI 1996: 349-361 |
| 1995 |
|---|
| 2 | | Takeshi Koshiba,
Erkki Mäkinen,
Yuji Takada:
Learning Strongly Deterministic Even Linear Languages from Positive Examples.
ALT 1995: 41-54 |
| 1 | | Takeshi Koshiba:
Typed pattern languages and their learnability.
EuroCOLT 1995: 367-379 |
