default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHiroki Shizuya
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c24]Anaëlle Le Dévéhat
, Shingo Hasegawa, Hiroki Shizuya:
Preimage Sampling in the Higher-bit Approximate Setting with a Non-spherical Gaussian Sampler. ICISC 2022: 472-490- [i1]Anaëlle Le Dévéhat, Hiroki Shizuya, Shingo Hasegawa:
On the Higher bit Version of Approximate Inhomogeneous Short Integer Solution Problem. IACR Cryptol. ePrint Arch. 2022: 1144 (2022) - 2021
- [j22]Firas Kraiem, Shuji Isobe, Eisuke Koizumi, Hiroki Shizuya:
On a Relation between Knowledge-of-Exponent Assumptions and the DLog vs. CDH Question. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 104-A(1): 20-24 (2021) - [j21]Shingo Hasegawa, Masashi Hisai, Hiroki Shizuya:
Public-Key Projective Arithmetic Functional Encryption. Int. J. Netw. Comput. 11(2): 299-318 (2021) - [c23]Anaëlle Le Dévéhat, Hiroki Shizuya, Shingo Hasegawa:
On the Higher-Bit Version of Approximate Inhomogeneous Short Integer Solution Problem. CANS 2021: 253-272 - 2020
- [c22]Shingo Hasegawa, Masashi Hisai, Hiroki Shizuya:
Public-key Projective Arithmetic Functional Encryption. CANDAR 2020: 115-121 - [c21]Takahiro Saito, Daiki Miyahara, Yuta Abe, Takaaki Mizuki, Hiroki Shizuya:
How to Implement a Non-uniform or Non-closed Shuffle. TPNC 2020: 107-118
2010 – 2019
- 2017
- [j20]Takaaki Mizuki, Hiroki Shizuya:
Computational Model of Card-Based Cryptographic Protocols and Its Applications. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100-A(1): 3-11 (2017) - 2016
- [c20]Shingo Hasegawa, Shuji Isobe, Eisuke Koizumi, Hiroki Shizuya, Ryo Takahashi:
A construction of attribute-based aggregate signatures. ISITA 2016: 76-80 - 2015
- [j19]Shingo Hasegawa, Shuji Isobe, Jun-ya Iwazaki, Eisuke Koizumi, Hiroki Shizuya:
A Strengthened Security Notion for Password-Protected Secret Sharing Schemes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(1): 203-212 (2015) - 2014
- [j18]Masayuki Fukumitsu, Shingo Hasegawa, Shuji Isobe, Hiroki Shizuya:
The RSA Group Is Adaptive Pseudo-Free under the RSA Assumption. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(1): 200-214 (2014) - [j17]Shuji Isobe, Eisuke Koizumi, Yuji Nishigaki, Hiroki Shizuya:
On the Complexity of Computing Discrete Logarithms over Algebraic Tori. IEICE Trans. Inf. Syst. 97-D(3): 442-447 (2014) - [j16]Takaaki Mizuki, Hiroki Shizuya:
A formalization of card-based cryptographic protocols via abstract machine. Int. J. Inf. Sec. 13(1): 15-23 (2014) - [c19]Masayuki Fukumitsu, Shingo Hasegawa, Shuji Isobe, Hiroki Shizuya:
On the Impossibility of Proving Security of Strong-RSA Signatures via the RSA Assumption. ACISP 2014: 290-305 - [c18]Takaaki Mizuki, Hiroki Shizuya:
Practical Card-Based Cryptography. FUN 2014: 313-324 - [c17]Shingo Hasegawa, Shuji Isobe, Jun-ya Iwazaki, Eisuke Koizumi, Hiroki Shizuya:
Password-protected secret-sharing schemes without random oracles. ISITA 2014: 566-570 - 2013
- [j15]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 Trans. Inf. Syst. 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
- [j14]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
- [j13]Shingo Hasegawa, Hiroyuki Hatanaka, Shuji Isobe, Eisuke Koizumi, Hiroki Shizuya:
Making Cryptographic Primitives Harder. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(1): 330-337 (2008) - [j12]Shingo Hasegawa, Shuji Isobe, Hiroki Shizuya:
NPMV-Complete Functions That Compute Discrete Logarithms and Integer Factorization. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(1): 342-344 (2008) - 2007
- [j11]Shuji Isobe, Wataru Kumagai, Masahiro Mambo, Hiroki Shizuya:
Toward Separating Integer Factoring from Discrete Logarithm mod p. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 90-A(1): 48-53 (2007) - 2005
- [j10]Chisato Konoma, Masahiro Mambo, Hiroki Shizuya:
The Computational Difficulty of Solving Cryptographic Primitive Problems Related to the Discrete Logarithm Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(1): 81-88 (2005) - [j9]Shuji Isobe, Tetsuo Kuriyama, Masahiro Mambo, Hiroki Shizuya:
On the Polynomial Time Computability of Abstract Ray-Tracing Problems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(5): 1209-1213 (2005) - 2003
- [j8]Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki:
Characterization of optimal key set protocols. Discret. Appl. Math. 131(1): 213-236 (2003) - [j7]Shintaro Itagaki, Masahiro Mambo, Hiroki Shizuya:
On the Strength of the Strong RSA Assumption. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(5): 1164-1170 (2003) - [j6]Soohyun Oh, Masahiro Mambo, Hiroki Shizuya, Dongho Won:
On the Security of Girault Key Agreement Protocols against Active Attacks. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(5): 1181-1189 (2003) - [j5]Eikoh Chida, Toshiya Itoh, Hiroki Shizuya:
A Note on the Relationships among Certified Discrete Log Cryptosystems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(5): 1198-1202 (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. Cryptol. 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. Cryptol. 11(1): 29-43 (1998) - [c9]Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki:
Eulerian Secret Key Exchange. COCOON 1998: 349-360 - [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. Cryptol. 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
