default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 27 matches
- 2021
- 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) - 2018
- Shuji Isobe, Jun-ya Iwazaki, Eisuke Koizumi, Atsushi Suda:
A Construction of Cramer-Shoup Like Encryption Protocols Based on the Anshel-Anshel-Goldfeld Key Exchange Protocol. CANDAR Workshops 2018: 410-416 - 2017
- Shuji Isobe, Eisuke Koizumi:
Autoreducibility and Completeness for Partial Multivalued Functions. IEICE Trans. Inf. Syst. 100-D(3): 422-427 (2017) - Masayuki Fukumitsu, Shingo Hasegawa, Shuji Isobe, Jun-ya Iwazaki, Eisuke Koizumi, Masao Sakai:
A Method for Constructing an Autonomous Decentralized P2P Storage with High Confidentiality and Reliability. CANDAR 2017: 439-444 - 2016
- Shingo Hasegawa, Shuji Isobe, Eisuke Koizumi, Hiroki Shizuya, Ryo Takahashi:
A construction of attribute-based aggregate signatures. ISITA 2016: 76-80 - 2015
- 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
- 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) - Shingo Hasegawa, Shuji Isobe:
A Lossy Identification Scheme Using the Subgroup Decision Assumption. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(6): 1296-1306 (2014) - 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) - 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 - Shingo Hasegawa, Shuji Isobe:
Lossy identification schemes from decisional RSA. ISITA 2014: 143-147 - Shingo Hasegawa, Shuji Isobe:
On the security notions of signcryption. ISITA 2014: 231-235 - Shingo Hasegawa, Shuji Isobe, Jun-ya Iwazaki, Eisuke Koizumi, Hiroki Shizuya:
Password-protected secret-sharing schemes without random oracles. ISITA 2014: 566-570 - 2013
- 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) - 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 - 2009
- 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) - Shuji Isobe, Eisuke Koizumi, Yuji Nishigaki, Hiroki Shizuya:
On the Complexity of Computing Discrete Logarithms over Algebraic Tori. CANS 2009: 433-442 - 2008
- 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) - 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
- Shuji Isobe, Xiao Zhou, Takao Nishizeki:
Total Colorings Of Degenerate Graphs. Comb. 27(2): 167-182 (2007) - 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
- 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) - 2004
- Shuji Isobe, Xiao Zhou, Takao Nishizeki:
Cost Total Colorings of Trees. IEICE Trans. Inf. Syst. 87-D(2): 337-342 (2004) - 2001
- Shuji Isobe, Xiao Zhou, Takao Nishizeki:
Total Colorings of Degenerated Graphs. ICALP 2001: 506-517 - 1999
- Shuji Isobe, Xiao Zhou, Takao Nishizeki:
A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees. Int. J. Found. Comput. Sci. 10(2): 171-194 (1999) - Shuji Isobe, Xiao Zhou, Takao Nishizeki:
A Linear Algorithm for Finding Total Colorings of Partial k-Trees. ISAAC 1999: 347-356 - 1998
- Shuji Isobe, Xiao Zhou, Takao Nishizeki:
A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees. WG 1998: 100-113
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-10-20 19:55 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint