Efficient Signatures on Randomizable Ciphertexts

Balthazar Bauer and Georg Fuchsbauer

Abstract

Randomizable encryption lets anyone randomize a ciphertext so it is distributed like a fresh encryption of the same plaintext. Signatures on randomizable ciphertexts (SoRC), introduced by Blazy et al. (PKC'11), let one adapt a signature on a ciphertext to a randomization of the latter. Since signatures can only be adapted to ciphertexts that encrypt the same message as the signed ciphertext, signatures obliviously authenticate plaintexts. SoRC have been used as a building block in e-voting, blind signatures and (delegatable) anonymous credentials. We observe that SoRC can be seen as signatures on equivalence classes (JoC'19), another primitive with many applications to anonymous authentication, and that SoRC provide better anonymity guarantees. We first strengthen the unforgeability notion for SoRC and then give a scheme that provably achieves it in the generic group model. Signatures in our scheme consist of only 4 bilinear-group elements, which is considerably more efficient than prior schemes.

Available format(s)
Category
Public-key cryptography
Publication info
Preprint. MINOR revision.
Keywords
anonymitydigital signatures
Contact author(s)
georg fuchsbauer @ tuwien ac at
History
2020-05-06: revised
See all versions
Short URL
https://ia.cr/2020/524

CC BY

BibTeX

@misc{cryptoeprint:2020/524,
author = {Balthazar Bauer and Georg Fuchsbauer},
title = {Efficient Signatures on Randomizable Ciphertexts},
howpublished = {Cryptology ePrint Archive, Paper 2020/524},
year = {2020},
note = {\url{https://eprint.iacr.org/2020/524}},
url = {https://eprint.iacr.org/2020/524}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.