Short randomizable signatures
From MaRDI portal
Recommendations
Cited in
(47)- Shorter double-authentication preventing signatures for small address spaces
- Efficient redactable signature and application to anonymous credentials
- Improving revocation for group signature with redactable signature
- Updatable signatures and message authentication codes
- Partially structure-preserving signatures: lower bounds, constructions and more
- An efficient certificate-based signature scheme in the standard model
- Improved threshold signatures, proactive secret sharing, and input certification from LSS isomorphisms
- More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds
- Rerandomizable signatures under standard assumption
- Reassessing security of randomizable signatures
- Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
- MoniPoly -- an expressive \(q\)-SDH-based anonymous attribute-based credential system
- Practical dynamic group signatures without knowledge extractors
- Short 2-Move Undeniable Signatures
- Fair Exchange of Short Signatures without Trusted Third Party
- Compact privacy protocols from post-quantum and timed classical assumptions
- Advances in Cryptology – CRYPTO 2004
- Efficient round-optimal blind signatures in the standard model
- Unlinkable policy-based sanitizable signatures
- Revisiting BBS signatures
- A Revocable Group Signature Scheme with Scalability from Simple Assumptions and Its Implementation
- DualDory: logarithmic-verifier linkable ring signatures through preprocessing
- Pointcheval-Sanders signature-based synchronized aggregate signature
- Credential transparency system
- Lattice signature with efficient protocols, application to anonymous credentials
- Snowblind: a threshold blind signature in pairing-free groups
- Curves with Fast Computations in the First Pairing Group
- Generalised asynchronous remote key generation for pairing-based cryptosystems
- Threshold structure-preserving signatures
- Short concurrent covert authenticated key exchange (short cAKE)
- Synchronized aggregate signature under standard assumption in the random oracle model
- Improved lattice blind signatures from recycled entropy
- Multi-Holder anonymous credentials from BBS signatures
- Non-interactive blind signatures from RSA assumption and more
- Non-interactive threshold BBS+ from pseudorandom correlations
- The brave new world of global generic groups and UC-secure zero-overhead SNARKs
- Compute, but verify: efficient multiparty computation over authenticated inputs
- Interactive threshold mercurial signatures and applications
- Share the \textsf{MAYO}: thresholdizing \textsf{MAYO}
- SoK: signatures with randomizable keys
- Fully dynamic group signatures from subset difference methods under simple assumptions
- Tight security for BBS signatures
- Device-bound anonymous credentials with(out) trusted hardware
- A short-list of pairing-friendly curves resistant to the special TNFS algorithm at the 192-bit security level
- EPID with malicious revocation
- Balancing privacy and accountability in blockchain identity management
This page was built for publication: Short randomizable signatures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2799009)