Hiroki Shizuya

According to our database, Hiroki Shizuya authored at least 43 papers between 1990 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

On the Higher bit Version of Approximate Inhomogeneous Short Integer Solution Problem.

Anaëlle Le Dévéhat, Hiroki Shizuya, Shingo Hasegawa

IACR Cryptol. ePrint Arch., 2022

Preimage Sampling in the Higher-bit Approximate Setting with a Non-spherical Gaussian Sampler.

Anaëlle Le Dévéhat, Shingo Hasegawa, Hiroki Shizuya

Proceedings of the Information Security and Cryptology - ICISC 2022, 2022

2021

Public-Key Projective Arithmetic Functional Encryption.

Shingo Hasegawa, Masashi Hisai, Hiroki Shizuya

Int. J. Netw. Comput., 2021

On a Relation between Knowledge-of-Exponent Assumptions and the DLog vs. CDH Question.

Firas Kraiem, Shuji Isobe, Eisuke Koizumi, Hiroki Shizuya

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021

2020

How to Implement a Non-uniform or Non-closed Shuffle.

Takahiro Saito, Daiki Miyahara, Yuta Abe, Takaaki Mizuki, Hiroki Shizuya

Proceedings of the Theory and Practice of Natural Computing - 9th International Conference, 2020

2017

Computational Model of Card-Based Cryptographic Protocols and Its Applications.

Takaaki Mizuki, Hiroki Shizuya

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017

2016

A construction of attribute-based aggregate signatures.

Shingo Hasegawa, Shuji Isobe, Eisuke Koizumi, Hiroki Shizuya, Ryo Takahashi

Proceedings of the 2016 International Symposium on Information Theory and Its Applications, 2016

2015

A Strengthened Security Notion for Password-Protected Secret Sharing Schemes.

Shingo Hasegawa, Shuji Isobe, Jun-ya Iwazaki, Eisuke Koizumi, Hiroki Shizuya

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015

2014

A formalization of card-based cryptographic protocols via abstract machine.

Takaaki Mizuki, Hiroki Shizuya

Int. J. Inf. Sec., 2014

On the Complexity of Computing Discrete Logarithms over Algebraic Tori.

Shuji Isobe, Eisuke Koizumi, Yuji Nishigaki, Hiroki Shizuya

IEICE Trans. Inf. Syst., 2014

The RSA Group Is Adaptive Pseudo-Free under the RSA Assumption.

Masayuki Fukumitsu, Shingo Hasegawa, Shuji Isobe, Hiroki Shizuya

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014

Password-protected secret-sharing schemes without random oracles.

Shingo Hasegawa, Shuji Isobe, Jun-ya Iwazaki, Eisuke Koizumi, Hiroki Shizuya

Proceedings of the International Symposium on Information Theory and its Applications, 2014

Practical Card-Based Cryptography.

Takaaki Mizuki, Hiroki Shizuya

Proceedings of the Fun with Algorithms - 7th International Conference, 2014

On the Impossibility of Proving Security of Strong-RSA Signatures via the RSA Assumption.

Masayuki Fukumitsu, Shingo Hasegawa, Shuji Isobe, Hiroki Shizuya

Proceedings of the Information Security and Privacy - 19th Australasian Conference, 2014

2013

On the Length-Decreasing Self-Reducibility and the Many-One-Like Reducibilities for Partial Multivalued Functions.

Ji-Won Huh, Shuji Isobe, Eisuke Koizumi, Hiroki Shizuya

IEICE Trans. Inf. Syst., 2013

Toward Separating the Strong Adaptive Pseudo-freeness from the Strong RSA Assumption.

Masayuki Fukumitsu, Shingo Hasegawa, Shuji Isobe, Eisuke Koizumi, Hiroki Shizuya

Proceedings of the Information Security and Privacy - 18th Australasian Conference, 2013

2009

On the pseudo-freeness and the CDH assumption.

Shingo Hasegawa, Shuji Isobe, Hiroki Shizuya, Katsuhiro Tashiro

Int. J. Inf. Sec., 2009

2008

NPMV-Complete Functions That Compute Discrete Logarithms and Integer Factorization.

Shingo Hasegawa, Shuji Isobe, Hiroki Shizuya

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008

Making Cryptographic Primitives Harder.

Shingo Hasegawa, Hiroyuki Hatanaka, Shuji Isobe, Eisuke Koizumi, Hiroki Shizuya

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008

2007

Toward Separating Integer Factoring from Discrete Logarithm mod <i>p</i>.

Shuji Isobe, Wataru Kumagai, Masahiro Mambo, Hiroki Shizuya

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2007

2005

The Computational Difficulty of Solving Cryptographic Primitive Problems Related to the Discrete Logarithm Problem.

Chisato Konoma, Masahiro Mambo, Hiroki Shizuya

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005

On the Polynomial Time Computability of Abstract Ray-Tracing Problems.

Shuji Isobe, Tetsuo Kuriyama, Masahiro Mambo, Hiroki Shizuya

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005

2003

On the Security of Girault Key Agreement Protocols against Active Attacks.

Soohyun Oh, Masahiro Mambo, Hiroki Shizuya, Dongho Won

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003

On the Strength of the Strong RSA Assumption.

Shintaro Itagaki, Masahiro Mambo, Hiroki Shizuya

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003

A Note on the Relationships among Certified Discrete Log Cryptosystems.

Eikoh Chida, Toshiya Itoh, Hiroki Shizuya

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003

Characterization of optimal key set protocols.

Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki

Discret. Appl. Math., 2003

2002

A complete characterization of a family of key exchange protocols.

Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki

Int. J. Inf. Sec., 2002

Spending Offline Divisible Coins with Combining Capability.

Eikoh Chida, Yosuke Kasai, Masahiro Mambo, Hiroki Shizuya

Proceedings of the Progress in Cryptology, 2002

2001

Evaluation of Tamper-Resistant Software Deviating from Structured Programming Rules.

Hideaki Goto, Masahiro Mambo, Hiroki Shizuya, Yasuyoshi Watanabe

Proceedings of the Information Security and Privacy, 6th Australasian Conference, 2001

2000

An Approach to the Objective and Quantitative Evaluation of Tamper-Resistant Software.

Hideaki Goto, Masahiro Mambo, Kenjiro Matsumura, Hiroki Shizuya

Proceedings of the Information Security, Third International Workshop, 2000

1999

Divertible and Subliminal-Free Zero-Knowledge Proofs for Languages.

Mike Burmester, Yvo Desmedt, Toshiya Itoh, Kouichi Sakurai, Hiroki Shizuya

J. Cryptol., 1999

Dealing Necessary and Sufficient Numbers of Cards for Sharing a One-Bit Secret Key.

Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki

Proceedings of the Advances in Cryptology, 1999

1998

A Structural Comparison of the Computational Difficulty of Breaking Discrete Log Cryptosystems.

Kouichi Sakurai, Hiroki Shizuya

J. Cryptol., 1998

A Note on the Complexity of Breaking Okamoto-Tanaka ID-Based Key Exchange Scheme.

Masahiro Mambo, Hiroki Shizuya

Proceedings of the Public Key Cryptography, 1998

Eulerian Secret Key Exchange.

Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki

Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

1997

A Language-Dependent Cryptographic Primitive.

Toshiya Itoh, Yuji Ohta, Hiroki Shizuya

J. Cryptol., 1997

1996

A Progress Report on Subliminal-Free Channels.

Mike Burmester, Yvo Desmedt, Toshiya Itoh, Kouichi Sakurai, Hiroki Shizuya, Moti Yung

Proceedings of the Information Hiding, First International Workshop, Cambridge, UK, May 30, 1996

1995

Relationships Among the Computational Powers of Breaking Discrete Log Cryptosystems.

Kouichi Sakurai, Hiroki Shizuya

Proceedings of the Advances in Cryptology, 1995

1994

Language Dependent Secure Bit Commitment.

Toshiya Itoh, Yuji Ohta, Hiroki Shizuya

Proceedings of the Advances in Cryptology, 1994

1992

How Intractable Is the Discrete Logarithm for a General Finite Group?

Tatsuaki Okamoto, Kouichi Sakurai, Hiroki Shizuya

Proceedings of the Advances in Cryptology, 1992

1991

On the Complexity of Hyperelliptic Discrete Logarithm Problem.

Hiroki Shizuya, Toshiya Itoh, Kouichi Sakurai

Proceedings of the Advances in Cryptology, 1991

Any Language in IP Has a Divertable ZKIP.

Toshiya Itoh, Kouichi Sakurai, Hiroki Shizuya

Proceedings of the Advances in Cryptology, 1991

1990

Demonstrating Possession without Revealing Factors and its Application.

Hiroki Shizuya, Kenji Koyama, Toshiya Itoh

Proceedings of the Advances in Cryptology, 1990