Signatures on randomizable ciphertexts

DOI10.1007/978-3-642-19379-8_25MaRDI QIDQ3084361zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Olivier Blazy, Georg Fuchsbauer, David Pointcheval, Damien Vergnaud

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)

Recommendations

• Efficient signatures on randomizable ciphertexts
• Verifiable encrypted signatures without random oracles
• Security in Communication Networks
• Practical verifiably encrypted signatures without random oracles
• Security of Verifiably Encrypted Signatures and a Construction without Random Oracles

Cited in

(28)

• On rejection sampling in Lyubashevsky's signature scheme
• Updatable privacy-preserving blueprints
• Signature schemes with randomized verification
• Interactive threshold mercurial signatures and applications
• Signcryption from randomness recoverable public key encryption
• Practical Round-Optimal Blind Signatures in the Standard Model
• Programmable hash functions and their applications
• On the security of RSA textbook signature scheme on Paillier ciphertext
• Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
• Confidential Signatures and Deterministic Signcryption
• Improving the efficiency of re-randomizable and replayable CCA secure public key encryption
• Skipping the \(q\) in group signatures
• Efficient round-optimal blind signatures in the standard model
• Linearly-homomorphic signatures and scalable mix-nets
• Round-optimal blind signatures in the plain model from classical and quantum standard assumptions
• Signcryption Schemes Based on the RSA Problem
• Pairing-free blind signatures from standard assumptions in the ROM
• Efficient signatures on randomizable ciphertexts
• On the cryptographic deniability of the Signal protocol
• Traceable receipt-free encryption
• Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions
• Practical traceable receipt-free encryption
• Unified, Minimal and Selectively Randomizable Structure-Preserving Signatures
• Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions
• Anonymous tokens with private metadata bit
• Encryption mechanisms for receipt-free and perfectly private verifiable elections
• Adaptive oblivious transfer and generalization
• CyclicRainbow – A Multivariate Signature Scheme with a Partially Cyclic Public Key

This page was built for publication: Signatures on randomizable ciphertexts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3084361)