Hiroki Shizuya

International Association for Cryptologic Research

Hiroki Shizuya Search web for home page

	year	title	booktitle	pages
1	1999	Divertible and Subliminal-Free Zero-Knowledge Proofs for Languages	jofc	197-223
2	1999	Dealing Necessary and Sufficient Numbers of Cards for Sharing a One-Bit Secret Key	eurocrypt	389-401
3	1998	A Note on the Complexity of Breaking Okamoto-Tanaka ID-Based Key Exchange Scheme	pkc	258-262
4	1998	A Structural Comparison of the Computational Difficulty of Breaking Discrete Log Cryptosystems	jofc	29-43
5	1997	A Language-Dependent Cryptographic Primitive	jofc	37-50
6	1995	Relationships Among the Computational Powers of Breaking Discrete Log Cryptosystems	eurocrypt	341-355
7	1994	Language Dependent Secure Bit Commitment	crypto	188-201
8	1992	How Intractable Is the Discrete Logarithm for a General Finite Group?	eurocrypt	420-428
9	1991	Any Language in IP Has a Divertable ZKIP	asiacrypt	382-396
10	1991	On the Complexity of Hyperelliptic Discrete Logarithm Problem	eurocrypt	337-351
11	1990	Demonstrating Possession without Revealing Factors and its Application	auscrypt	273-293