Optimal security proofs for signatures from identification schemes
We perform a concrete security treatment of digital signature schemes obtained from
canonical identification schemes via the Fiat-Shamir transform. If the identification scheme is …
canonical identification schemes via the Fiat-Shamir transform. If the identification scheme is …
Black-box separations of hash-and-sign signatures in the non-programmable random oracle model
A popular methodology of designing cryptosystems with practical efficiency is to give a
security proof in the random oracle (RO) model. The work of Fischlin and Fleischhacker …
security proof in the random oracle (RO) model. The work of Fischlin and Fleischhacker …
Impossibility on the provable security of the Fiat-Shamir-type signatures in the non-programmable random oracle model
M Fukumitsu, S Hasegawa - … Conference, ISC 2016, Honolulu, HI, USA …, 2016 - Springer
On the security of Fiat-Shamir (FS) type signatures, some negative circumstantial evidences
were given in the non-programmable random oracle model (NPROM). Fischlin and …
were given in the non-programmable random oracle model (NPROM). Fischlin and …
Black-box separations on Fiat-Shamir-type signatures in the non-programmable random oracle model
M Fukumitsu, S Hasegawa - IEICE Transactions on Fundamentals …, 2018 - search.ieice.org
In recent years, Fischlin and Fleischhacker showed the impossibility of proving the security
of specific types of FS-type signatures, the signatures constructed by the Fiat-Shamir …
of specific types of FS-type signatures, the signatures constructed by the Fiat-Shamir …
Impossibility of the provable security of the Schnorr signature from the one-more DL assumption in the non-programmable random oracle model
M Fukumitsu, S Hasegawa - … Conference, ProvSec 2017, Xi'an, China …, 2017 - Springer
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 …
(ROM), it is provable from the DL assumption, whereas there is a negative circumstantial …
Tighter reductions for deterministic identity-based signatures
N Yanai, T Fujiwara - IEICE Transactions on Fundamentals of …, 2018 - search.ieice.org
Deterministic ID-based signatures are digital signatures where secret keys are
probabilistically generated by a key generation center while the signatures are generated …
probabilistically generated by a key generation center while the signatures are generated …
A generic construction of tight security signatures in the non-programmable random oracle model
M Fukumitsu, S Hasegawa - 2016 International Symposium on …, 2016 - ieeexplore.ieee.org
We propose a generic construction of tightly secure signature schemes in the non-
programmable random oracle model. Our construction employs the dual-mode commitment …
programmable random oracle model. Our construction employs the dual-mode commitment …