Eisuke Koizumi

According to our database1, Eisuke Koizumi authored at least 13 papers between 2008 and 2025.

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

2025
Ownership Verification of DNN Models Using White-Box Adversarial Attacks with Specified Probability Manipulation.
CoRR, May, 2025

2023
A construction of encryption protocols over some semidirect products.
J. Math. Cryptol., 2023

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
Password-protected secret-sharing schemes without random oracles.
Proceedings of the International Symposium on Information Theory and its Applications, 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 Complexity of Computing Discrete Logarithms over Algebraic Tori.
Proceedings of the Cryptology and Network Security, 8th International Conference, 2009

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


  Loading...