DualDory: logarithmic-verifier linkable ring signatures through preprocessing
From MaRDI portal
Publication:6109447
DOI10.1007/978-3-031-17146-8_21zbMath1524.94077OpenAlexW4296966007MaRDI QIDQ6109447
Kaoutar Elkhiyaoui, Jonathan Bootle, Yacov Manevich, Julia Hesse
Publication date: 28 July 2023
Published in: Computer Security – ESORICS 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-17146-8_21
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \({\varSigma }\)-protocols
- DualRing: generic construction of ring signatures with efficient instantiations
- Structure-preserving certificateless encryption and its application
- Ring signatures: logarithmic-size, no setup -- from standard assumptions
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
- Short Randomizable Signatures
- Escrowed Linkability of Ring Signatures and Its Applications
- One-Out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin
- Transitive Signatures: New Schemes and Proofs
- Structure-Preserving Signatures and Commitments to Group Elements
- Group Signatures
- 1-out-of-n Signatures from a Variety of Keys
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Information Security and Privacy
- Information Security Practice and Experience
- Pairing-Friendly Elliptic Curves of Prime Order
- Ring Signatures of Sub-linear Size Without Random Oracles
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
- On Signatures of Knowledge
- Theory of Cryptography
This page was built for publication: DualDory: logarithmic-verifier linkable ring signatures through preprocessing