Match!
Hasegawa Shingo
38Publications
3H-index
37Citations
Publications 38
Newest
Published on Jan 1, 2019in Interdisciplinary Information Sciences
Hasegawa Shingo3
Estimated H-index: 3
(CIT: Center for Information Technology),
Shuji Isobe3
Estimated H-index: 3
(CIT: Center for Information Technology)
Published on Jan 1, 2019
Masayuki Fukumitsu (Hokkaido Information University), Hasegawa Shingo3
Estimated H-index: 3
(Tohoku University)
Published on Nov 1, 2018
Masayuki Fukumitsu3
Estimated H-index: 3
(Hokkaido Information University),
Hasegawa Shingo3
Estimated H-index: 3
(CIT: Center for Information Technology)
Galindo-Garcia identity-based signature (GG09 IBS) is an efficient identity-based signature (IBS) based on Schnorr signature scheme. The security of GG09 IBS is proven in the random oracle model under the discrete-log assumption, however, the security proof achieves a loose security only. In CANDAR'17, Fukumitsu and Hasegawa proposed a GG09-like IBS (FH17 IBS). Although their scheme achieves a tight security in the random oracle model under the DDH assumption, the size of components and the comp...
Published on Oct 1, 2018
Masayuki Fukumitsu3
Estimated H-index: 3
(Hokkaido Information University),
Masayuki Fukumitsu (Hokkaido Information University), Hasegawa Shingo3
Estimated H-index: 3
(CIT: Center for Information Technology)
Galindo and Garcia introduced a light-wight identity-based signature (IBS) based on Schnorr signature in AFRICACRYPT 2009. Despite the simple construction and the ef-ficiency of Galindo-Garcia IBS, to the best of our knowledge, their followers do not appear except the IBS scheme by Fukumitsu and Hasegawa in CANDAR’17. Although their IBS achieves the tight security, the efficiency is worse than Galindo-Garcia IBS. Their result suggests that Galindo-Garcia IBS utilizes some special properties of S...
Published on Nov 1, 2017
Masayuki Fukumitsu3
Estimated H-index: 3
(Hokkaido Information University),
Hasegawa Shingo3
Estimated H-index: 3
(Tohoku University)
Galindo and Garcia proposed an identity-based signature based on the Schnorr signature. Although their scheme is proven to be secure in the random oracle model, the security reduction is loose. Later, the security reduction is improved by Chatterjee, Kamath and Kumar, however, the reduction is still loose. In this paper, we propose an identity-based signature scheme which is based on the Schnorr signature. Our scheme follows the idea of the construction of the Galindo and Garcia's one. The secur...
Published on Nov 1, 2017
Masayuki Fukumitsu3
Estimated H-index: 3
(Hokkaido Information University),
Hasegawa Shingo3
Estimated H-index: 3
(Tohoku University)
+ 3 AuthorsMasao Sakai5
Estimated H-index: 5
(Tohoku University)
We have proposed a decentralized Peer-to-Peer (P2P) cloud storage scheme achieving high confidentiality by using a large number of unspecified P2P nodes. There is one crucial problem in the scheme: it is generally difficult to maintain the reliability of the stored data since there is no designated central server which supervises the whole system, and hence, it will be infeasible to certainly restore the stored data if the P2P nodes are to be less reliable. In this paper, we propose a method to ...
Published on Oct 23, 2017
Masayuki Fukumitsu3
Estimated H-index: 3
(Hokkaido Information University),
Hasegawa Shingo3
Estimated H-index: 3
(Tohoku University)
The security of the Schnorr signature was widely discussed. In the random oracle model (ROM), it is provable from the DL assumption, whereas there is a negative circumstantial evidence in the standard model. Fleischhacker, Jager and Schroder showed that the tight security of the Schnorr signature is unprovable from a strong cryptographic assumption, such as the One-more DL (OM-DL) assumption and the computational and decisional Diffie-Hellman assumption, in the ROM via a generic reduction as lon...
Published on Mar 1, 2017 in AINA (Advanced Information Networking and Applications)
Masayuki Fukumitsu3
Estimated H-index: 3
(Hokkaido Information University),
Hasegawa Shingo3
Estimated H-index: 3
(Tohoku University)
+ 2 AuthorsDaiki Takahashi2
Estimated H-index: 2
We propose a new secure online storage scheme based on an open P2P network without a central server. In the proposed scheme, attackers cannot detect target user data in the online storage because the user data is divided into some parts by the secret sharing, and they are distributed to P2P nodes via the anonymous communication. The proposed scheme can prevent the direct attack on the target user node because metadata for the reconstruction also hidden in the online storage, hence nothing remain...
Published on Oct 1, 2016 in ISITA (International Symposium on Information Theory and its Applications)
Masayuki Fukumitsu3
Estimated H-index: 3
(Hokkaido Information University),
Hasegawa Shingo3
Estimated H-index: 3
(Tohoku University)
We propose a generic construction of tightly secure signature schemes in the non-programmable random oracle model. Our construction employs the dual-mode commitment and the lossy identification schemes. Since there are many instantiation of lossy identification schemes, we can obtain many tightly secure signature schemes in the non-programmable random oracle model.
1234