Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Hiroki Shizuya
2010 – today
- 2013
[j12]Ji-Won Huh, Shuji Isobe, Eisuke Koizumi, Hiroki Shizuya: On the Length-Decreasing Self-Reducibility and the Many-One-Like Reducibilities for Partial Multivalued Functions. IEICE Transactions 96-D(3): 465-471 (2013)- [c16]Masayuki Fukumitsu, Shingo Hasegawa, Shuji Isobe, Eisuke Koizumi, Hiroki Shizuya: Toward Separating the Strong Adaptive Pseudo-freeness from the Strong RSA Assumption. ACISP 2013: 72-87
2000 – 2009
- 2009
- [j11]Shingo Hasegawa, Shuji Isobe, Hiroki Shizuya, Katsuhiro Tashiro: On the pseudo-freeness and the CDH assumption. Int. J. Inf. Sec. 8(5): 347-355 (2009)
- [c15]Shuji Isobe, Eisuke Koizumi, Yuji Nishigaki, Hiroki Shizuya: On the Complexity of Computing Discrete Logarithms over Algebraic Tori. CANS 2009: 433-442
- 2008
- [j10]Shingo Hasegawa, Hiroyuki Hatanaka, Shuji Isobe, Eisuke Koizumi, Hiroki Shizuya: Making Cryptographic Primitives Harder. IEICE Transactions 91-A(1): 330-337 (2008)
- [j9]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
- [j8]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
- [j7]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)
- [j6]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
- [j5]Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki: Characterization of optimal key set protocols. Discrete Applied Mathematics 131(1): 213-236 (2003)
- 2002
- [j4]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)
- [c14]Eikoh Chida, Yosuke Kasai, Masahiro Mambo, Hiroki Shizuya: Spending Offline Divisible Coins with Combining Capability. INDOCRYPT 2002: 339-353
- 2001
- [c13]Hideaki Goto, Masahiro Mambo, Hiroki Shizuya, Yasuyoshi Watanabe: Evaluation of Tamper-Resistant Software Deviating from Structured Programming Rules. ACISP 2001: 145-158
- 2000
- [c12]Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki: Characterization of Optimal Key Set Protocols. IFIP TCS 2000: 273-285
- [c11]Hideaki Goto, Masahiro Mambo, Kenjiro Matsumura, Hiroki Shizuya: An Approach to the Objective and Quantitative Evaluation of Tamper-Resistant Software. ISW 2000: 82-96
1990 – 1999
- 1999
- [j3]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)
- [c10]Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki: Dealing Necessary and Sufficient Numbers of Cards for Sharing a One-Bit Secret Key. EUROCRYPT 1999: 389-401
- 1998
- [j2]Kouichi Sakurai, Hiroki Shizuya: A Structural Comparison of the Computational Difficulty of Breaking Discrete Log Cryptosystems. J. Cryptology 11(1): 29-43 (1998)
- [c9]
- [c8]Masahiro Mambo, Hiroki Shizuya: A Note on the Complexity of Breaking Okamoto-Tanaka ID-Based Key Exchange Scheme. Public Key Cryptography 1998: 258-262
- 1997
- [j1]Toshiya Itoh, Yuji Ohta, Hiroki Shizuya: A Language-Dependent Cryptographic Primitive. J. Cryptology 10(1): 37-50 (1997)
- 1996
- [c7]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
- [c6]Kouichi Sakurai, Hiroki Shizuya: Relationships Among the Computational Powers of Breaking Discrete Log Cryptosystems. EUROCRYPT 1995: 341-355
- 1994
- [c5]Toshiya Itoh, Yuji Ohta, Hiroki Shizuya: Language Dependent Secure Bit Commitment. CRYPTO 1994: 188-201
- 1992
- [c4]Tatsuaki Okamoto, Kouichi Sakurai, Hiroki Shizuya: How Intractable Is the Discrete Logarithm for a General Finite Group? EUROCRYPT 1992: 420-428
- 1991
- [c3]Toshiya Itoh, Kouichi Sakurai, Hiroki Shizuya: Any Language in IP Has a Divertable ZKIP. ASIACRYPT 1991: 382-396
- [c2]Hiroki Shizuya, Toshiya Itoh, Kouichi Sakurai: On the Complexity of Hyperelliptic Discrete Logarithm Problem. EUROCRYPT 1991: 337-351
- 1990
- [c1]Hiroki Shizuya, Kenji Koyama, Toshiya Itoh: Demonstrating Possession without Revealing Factors and its Application. AUSCRYPT 1990: 273-293
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18 22:41 CEST by the dblp team