Shingo Hasegawa

Orcid: 0000-0001-9715-5495

According to our database1, Shingo Hasegawa authored at least 42 papers between 2008 and 2023.

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

2023
On Multi-user Security of Schnorr Signature in Algebraic Group Model.
Int. J. Netw. Comput., 2023

Dynamic Group Signatures with Message Dependent Opening and Non-Interactive Signing.
Int. J. Netw. Comput., 2023

Accountable Ring Signatures from Symmetric-Key Primitives.
Proceedings of the Eleventh International Symposium on Computing and Networking, CANDAR 2023, Matsue, Japan, November 28, 2023

2022
Group Signatures with Designated Traceability over Openers' Attributes.
Int. J. Netw. Comput., 2022

On the Higher bit Version of Approximate Inhomogeneous Short Integer Solution Problem.
IACR Cryptol. ePrint Arch., 2022

Group Signatures with Designated Traceability over Openers' Attributes in Bilinear Groups.
Proceedings of the Information Security Applications - 23rd International Conference, 2022

Preimage Sampling in the Higher-bit Approximate Setting with a Non-spherical Gaussian Sampler.
Proceedings of the Information Security and Cryptology - ICISC 2022, 2022

Group Signatures with Equality Test on Signers.
Proceedings of the 2022 Tenth International Symposium on Computing and Networking, CANDAR 2022, 2022

2021
Public-Key Projective Arithmetic Functional Encryption.
Int. J. Netw. Comput., 2021

A Tightly Secure DDH-based Multisignature with Public-Key Aggregation.
Int. J. Netw. Comput., 2021

Tighter Reduction for Lattice-Based Multisignature.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021

Impossibility on the Schnorr Signature from the One-More DL Assumption in the Non-Programmable Random Oracle Model.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021

A Lattice-based Provably Secure Multisignature Scheme in Quantum Random Oracle Model.
IACR Cryptol. ePrint Arch., 2021

An Aggregate Signature with Pre-communication in the Plain Public Key Model.
Proceedings of the Security and Trust Management - 17th International Workshop, 2021

Group Signatures with Designated Traceability.
Proceedings of the Ninth International Symposium on Computing and Networking, 2021

2020
One-More Assumptions Do Not Help Fiat-Shamir-type Signature Schemes in NPROM.
Proceedings of the Topics in Cryptology - CT-RSA 2020, 2020

Linear Lossy Identification Scheme derives Tightly-Secure Multisignature.
Proceedings of the 15th Asia Joint Conference on Information Security, 2020

2019
Motions of Propelling a Wheelchair Based on the Movement Function of People with Spinal Cord Injury.
Proceedings of the IEEE/SICE International Symposium on System Integration, 2019

A Tightly-Secure Lattice-Based Multisignature.
Proceedings of the 6th on ASIA Public-Key Cryptography Workshop, 2019

2018
Black-Box Separations on Fiat-Shamir-Type Signatures in the Non-Programmable Random Oracle Model.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

A Generic Construction of an Identity-based Signature from a Sigma Protocol.
Proceedings of the International Symposium on Information Theory and Its Applications, 2018

A Galindo-Garcia-Like Identity-Based Signature with Tight Security Reduction, Revisited.
Proceedings of the Sixth International Symposium on Computing and Networking, 2018

2017
Impossibility of the Provable Security of the Schnorr Signature from the One-More DL Assumption in the Non-programmable Random Oracle Model.
Proceedings of the Provable Security, 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

A Galindo-Garcia-Like Identity-Based Signature with Tight Security Reduction.
Proceedings of the Fifth International Symposium on Computing and Networking, 2017

A Proposal of a Secure P2P-Type Storage Scheme by Using the Secret Sharing and the Blockchain.
Proceedings of the 31st IEEE International Conference on Advanced Information Networking and Applications, 2017

2016
Motion analysis of wheelchair considering the pectoral girdle mechanism.
Proceedings of the 2016 IEEE/SICE International Symposium on System Integration, 2016

Impossibility on the Provable Security of the Fiat-Shamir-Type Signatures in the Non-programmable Random Oracle Model.
Proceedings of the Information Security - 19th International Conference, 2016

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

A generic construction of tight security signatures in the non-programmable random oracle model.
Proceedings of the 2016 International Symposium on Information Theory and Its Applications, 2016

A Proposal of a Password Manager Satisfying Security and Usability by Using the Secret Sharing and a Personal Server.
Proceedings of the 30th IEEE International Conference on Advanced Information Networking and Applications, 2016

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

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
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


  Loading...