Ryo Nishimaki

TL;DR: This paper first gives two general frameworks for constructing fully secure signature schemes from weaker building blocks such as variations of one-time signatures and random-message secure signatures, and instantiate them based on simple assumptions over symmetric and asymmetric bilinear groups.

TL;DR: In this article, the authors presented an efficient structure-preserving tagged one-time signature scheme with tight security reductions to the decision-linear assumption, which is the state-of-the-art.

TL;DR: In this article, it was shown that subexponentially secure secret-key functional encryption is powerful enough to construct indistinguishability obfuscation if they additionally assume the existence of subexponential secure plain public-key encryption.

TL;DR: Barak et al. as mentioned in this paper studied the problem of watermarking various cryptographic programs such as pseudorandom function (PRF) evaluation, decryption, and signing, and showed that, assuming indistinguishability obfuscation (iO), such water-marking is impossible if the marked program C evaluates the original program with perfect correctness.

TL;DR: In this paper, the authors presented an efficient structure-preserving tagged one-time signature scheme with tight security reductions to the decision-linear assumption and gave rise to the currently most efficient structurepreserving signature scheme based on the decisionliner assumption with constant-size signatures of only 14 group elements.