Shuji Isobe

According to our database1, Shuji Isobe authored at least 25 papers between 1999 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
On a Relation between Knowledge-of-Exponent Assumptions and the DLog vs. CDH Question.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021

2018
A Construction of Cramer-Shoup Like Encryption Protocols Based on the Anshel-Anshel-Goldfeld Key Exchange Protocol.
Proceedings of the Sixth International Symposium on Computing and Networking, 2018

2017
Autoreducibility and Completeness for Partial Multivalued Functions.
IEICE Trans. Inf. Syst., 2017

A Method for Constructing an Autonomous Decentralized P2P Storage with High Confidentiality and Reliability.
Proceedings of the Fifth International Symposium on Computing and Networking, 2017

2016
A construction of attribute-based aggregate signatures.
Proceedings of the 2016 International Symposium on Information Theory and Its Applications, 2016

2015
A Strengthened Security Notion for Password-Protected Secret Sharing Schemes.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015

2014
On the Complexity of Computing Discrete Logarithms over Algebraic Tori.
IEICE Trans. Inf. Syst., 2014

A Lossy Identification Scheme Using the Subgroup Decision Assumption.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014

The RSA Group Is Adaptive Pseudo-Free under the RSA Assumption.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014

Password-protected secret-sharing schemes without random oracles.
Proceedings of the International Symposium on Information Theory and its Applications, 2014

On the security notions of signcryption.
Proceedings of the International Symposium on Information Theory and its Applications, 2014

Lossy identification schemes from decisional RSA.
Proceedings of the International Symposium on Information Theory and its Applications, 2014

On the Impossibility of Proving Security of Strong-RSA Signatures via the RSA Assumption.
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.
IEICE Trans. Inf. Syst., 2013

Toward Separating the Strong Adaptive Pseudo-freeness from the Strong RSA Assumption.
Proceedings of the Information Security and Privacy - 18th Australasian Conference, 2013

2009
On the pseudo-freeness and the CDH assumption.
Int. J. Inf. Sec., 2009

2008
NPMV-Complete Functions That Compute Discrete Logarithms and Integer Factorization.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008

Making Cryptographic Primitives Harder.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008

2007
Toward Separating Integer Factoring from Discrete Logarithm mod <i>p</i>.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2007

Total Colorings Of Degenerate Graphs.
Comb., 2007

2005
On the Polynomial Time Computability of Abstract Ray-Tracing Problems.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005

2004
Cost Total Colorings of Trees.
IEICE Trans. Inf. Syst., 2004

2001
Total Colorings of Degenerated Graphs.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

1999
A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees.
Int. J. Found. Comput. Sci., 1999

A Linear Algorithm for Finding Total Colorings of Partial k-Trees.
Proceedings of the Algorithms and Computation, 10th International Symposium, 1999


  Loading...