2008 |
24 | EE | Shingo Hasegawa,
Hiroyuki Hatanaka,
Shuji Isobe,
Eisuke Koizumi,
Hiroki Shizuya:
Making Cryptographic Primitives Harder.
IEICE Transactions 91-A(1): 330-337 (2008) |
23 | EE | Shingo Hasegawa,
Shuji Isobe,
Hiroki Shizuya:
NPMV-Complete Functions That Compute Discrete Logarithms and Integer Factorization.
IEICE Transactions 91-A(1): 342-344 (2008) |
2007 |
22 | EE | Shuji Isobe,
Wataru Kumagai,
Masahiro Mambo,
Hiroki Shizuya:
Toward Separating Integer Factoring from Discrete Logarithm mod p.
IEICE Transactions 90-A(1): 48-53 (2007) |
2005 |
21 | EE | Chisato Konoma,
Masahiro Mambo,
Hiroki Shizuya:
The Computational Difficulty of Solving Cryptographic Primitive Problems Related to the Discrete Logarithm Problem.
IEICE Transactions 88-A(1): 81-88 (2005) |
20 | EE | Shuji Isobe,
Tetsuo Kuriyama,
Masahiro Mambo,
Hiroki Shizuya:
On the Polynomial Time Computability of Abstract Ray-Tracing Problems.
IEICE Transactions 88-A(5): 1209-1213 (2005) |
2003 |
19 | EE | Takaaki Mizuki,
Hiroki Shizuya,
Takao Nishizeki:
Characterization of optimal key set protocols.
Discrete Applied Mathematics 131(1): 213-236 (2003) |
2002 |
18 | EE | Eikoh Chida,
Yosuke Kasai,
Masahiro Mambo,
Hiroki Shizuya:
Spending Offline Divisible Coins with Combining Capability.
INDOCRYPT 2002: 339-353 |
17 | EE | Takaaki Mizuki,
Hiroki Shizuya,
Takao Nishizeki:
A complete characterization of a family of key exchange protocols.
Int. J. Inf. Sec. 1(2): 131-142 (2002) |
2001 |
16 | EE | Hideaki Goto,
Masahiro Mambo,
Hiroki Shizuya,
Yasuyoshi Watanabe:
Evaluation of Tamper-Resistant Software Deviating from Structured Programming Rules.
ACISP 2001: 145-158 |
2000 |
15 | EE | Takaaki Mizuki,
Hiroki Shizuya,
Takao Nishizeki:
Characterization of Optimal Key Set Protocols.
IFIP TCS 2000: 273-285 |
14 | EE | Hideaki Goto,
Masahiro Mambo,
Kenjiro Matsumura,
Hiroki Shizuya:
An Approach to the Objective and Quantitative Evaluation of Tamper-Resistant Software.
ISW 2000: 82-96 |
1999 |
13 | EE | Takaaki Mizuki,
Hiroki Shizuya,
Takao Nishizeki:
Dealing Necessary and Sufficient Numbers of Cards for Sharing a One-Bit Secret Key.
EUROCRYPT 1999: 389-401 |
12 | EE | Mike Burmester,
Yvo Desmedt,
Toshiya Itoh,
Kouichi Sakurai,
Hiroki Shizuya:
Divertible and Subliminal-Free Zero-Knowledge Proofs for Languages.
J. Cryptology 12(3): 197-223 (1999) |
1998 |
11 | EE | Takaaki Mizuki,
Hiroki Shizuya,
Takao Nishizeki:
Eulerian Secret Key Exchange.
COCOON 1998: 349-360 |
10 | EE | Masahiro Mambo,
Hiroki Shizuya:
A Note on the Complexity of Breaking Okamoto-Tanaka ID-Based Key Exchange Scheme.
Public Key Cryptography 1998: 258-262 |
9 | EE | Kouichi Sakurai,
Hiroki Shizuya:
A Structural Comparison of the Computational Difficulty of Breaking Discrete Log Cryptosystems.
J. Cryptology 11(1): 29-43 (1998) |
1997 |
8 | | Toshiya Itoh,
Yuji Ohta,
Hiroki Shizuya:
A Language-Dependent Cryptographic Primitive.
J. Cryptology 10(1): 37-50 (1997) |
1996 |
7 | | Mike Burmester,
Yvo Desmedt,
Toshiya Itoh,
Kouichi Sakurai,
Hiroki Shizuya,
Moti Yung:
A Progress Report on Subliminal-Free Channels.
Information Hiding 1996: 157-168 |
1995 |
6 | EE | Kouichi Sakurai,
Hiroki Shizuya:
Relationships Among the Computational Powers of Breaking Discrete Log Cryptosystems.
EUROCRYPT 1995: 341-355 |
1994 |
5 | EE | Toshiya Itoh,
Yuji Ohta,
Hiroki Shizuya:
Language Dependent Secure Bit Commitment.
CRYPTO 1994: 188-201 |
1992 |
4 | EE | Tatsuaki Okamoto,
Kouichi Sakurai,
Hiroki Shizuya:
How Intractable Is the Discrete Logarithm for a General Finite Group?
EUROCRYPT 1992: 420-428 |
1991 |
3 | | Toshiya Itoh,
Kouichi Sakurai,
Hiroki Shizuya:
Any Language in IP Has a Divertable ZKIP.
ASIACRYPT 1991: 382-396 |
2 | EE | Hiroki Shizuya,
Toshiya Itoh,
Kouichi Sakurai:
On the Complexity of Hyperelliptic Discrete Logarithm Problem.
EUROCRYPT 1991: 337-351 |
1990 |
1 | | Hiroki Shizuya,
Kenji Koyama,
Toshiya Itoh:
Demonstrating Possession without Revealing Factors and its Application.
AUSCRYPT 1990: 273-293 |