Signatures on Randomizable Ciphertexts

DOI10.1007/978-3-642-19379-8_25zbMath1291.94180OpenAlexW2282463261WikidataQ56921080 ScholiaQ56921080MaRDI QIDQ3084361

Georg Fuchsbauer, Olivier Blazy, Damien Vergnaud, David Pointcheval

Publication date: 15 March 2011

Published in: Public Key Cryptography – PKC 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-19379-8_25

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (12)

Practical Round-Optimal Blind Signatures in the Standard Model ⋮ Skipping the \(q\) in group signatures ⋮ Adaptive Oblivious Transfer and Generalization ⋮ Structure-preserving signatures on equivalence classes and constant-size anonymous credentials ⋮ Traceable receipt-free encryption ⋮ Programmable hash functions and their applications ⋮ Improving the efficiency of re-randomizable and replayable CCA secure public key encryption ⋮ Linearly-homomorphic signatures and scalable mix-nets ⋮ Round-optimal blind signatures in the plain model from classical and quantum standard assumptions ⋮ Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions ⋮ Efficient Round-Optimal Blind Signatures in the Standard Model ⋮ Anonymous tokens with private metadata bit

This page was built for publication: Signatures on Randomizable Ciphertexts