DualDory: logarithmic-verifier linkable ring signatures through preprocessing
From MaRDI portal
Recommendations
Cites work
- 1-out-of-n Signatures from a Variety of Keys
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
- DualRing: generic construction of ring signatures with efficient instantiations
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- Escrowed Linkability of Ring Signatures and Its Applications
- Group Signatures
- scientific article; zbMATH DE number 2081086 (Why is no real title available?)
- scientific article; zbMATH DE number 1759783 (Why is no real title available?)
- Information Security and Privacy
- Information Security Practice and Experience
- On Signatures of Knowledge
- One-out-of-many proofs: or how to leak a secret and spend a coin
- Pairing-Friendly Elliptic Curves of Prime Order
- Practical threshold signatures
- Ring Signatures of Sub-linear Size Without Random Oracles
- Ring signatures: logarithmic-size, no setup -- from standard assumptions
- Short randomizable signatures
- Structure-preserving certificateless encryption and its application
- Structure-preserving signatures and commitments to group elements
- Theory of Cryptography
- Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \({\varSigma }\)-protocols
- Transitive Signatures: New Schemes and Proofs
Cited in
(5)
This page was built for publication: DualDory: logarithmic-verifier linkable ring signatures through preprocessing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6109447)