Eisuke Koizumi

  • Citations Per Year
Learn More
We propose a password-protected secret sharing scheme which is provably secure without the random oracles. Three tools enable us to achieve this property: the IND-CCA secure threshold encryption scheme of Libert and Yung, the linear encryption scheme and the technique for constructing a simulation-sound non-interactive zero knowledge proof for any language(More)
In this paper, we investigate a relationship between manyone-like autoreducibility and completeness for classes of functions computed by polynomial-time nondeterministic Turing transducers. We prove two results. One is that any many-one complete function for these classes is metric many-one autoreducible. The other is that any strict metric manyone complete(More)
For the identity-based aggregate signatures, Hohenberger, Sahai and Waters proposed the first scheme that admits unrestricted aggregation, using multilinear maps. On the other hand, for the attribute based-signatures, which is an extended notion of the identity-based signatures, the ones with aggregation are not known to exist so far. This paper studies the(More)
  • 1