Efficient Fully Structure-Preserving Signatures and Shrinking Commitments

Masayuki Abe, Jens Groth, Markulf Kohlweiss, Miyako Ohkubo, Mehdi Tibouchi

Research output: Contribution to journalArticlepeer-review


In structure-preserving signatures, public keys, messages, and signatures are all collections of source group elements of some bilinear groups. In this paper, we introduce fully structure-preserving signature schemes, with the additional requirement that even secret keys are group elements. This strong property allows efficient non-interactive proofs of knowledge of the secret key, which is useful in designing cryptographic protocols under simulation-based security where online extraction of the secret key is needed. We present efficient constructions under simple standard assumptions and pursue even more efficient constructions with the extra property of randomizability based on the generic bilinear group model. An essential building block for our efficient standard model construction is a shrinking structure-preserving trapdoor commitment scheme, which is by itself an important primitive and of independent interest as it appears to contradict a known impossibility result that structure-preserving commitments cannot be shrinking. We argue that a relaxed binding property lets us circumvent the impossibility while still retaining the usefulness of the primitive in important applications as mentioned above.
Original languageEnglish
Pages (from-to)1-53
Number of pages53
JournalJournal of Cryptology
Publication statusPublished - 8 Aug 2018

Fingerprint Dive into the research topics of 'Efficient Fully Structure-Preserving Signatures and Shrinking Commitments'. Together they form a unique fingerprint.

Cite this