Count me in! Extendability for threshold ring signatures
From MaRDI portal
Publication:6113963
DOI10.1007/978-3-030-97131-1_13zbMath1519.94211MaRDI QIDQ6113963
Anca Nitulescu, Sophia Yakoubov, Mathias Hall-Andersen, Elena Pagnin, Diego F. Aranha
Publication date: 10 August 2023
Published in: Public-Key Cryptography – PKC 2022 (Search for Journal in Brave)
Related Items
Extendable threshold ring signatures with enhanced anonymity, The state of the union: union-only signatures for data aggregation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient ring signatures in the standard model
- Threshold ring signatures: new definitions and post-quantum security
- Blind polynomial evaluation and data trading
- Stronger notions and a more efficient construction of threshold ring signatures
- Valiant's universal circuits revisited: an overall improvement and a lower bound
- Short lattice-based one-out-of-many proofs and applications to ring signatures
- Raptor: a practical lattice-based (linkable) ring signature
- Calamari and Falafl: logarithmic (linkable) ring signatures from isogenies and lattices
- Actively Secure Private Function Evaluation
- Number-theoretic constructions of efficient pseudo-random functions
- Constant Size Ring Signature Without Random Oracle
- ID-Based Blind Signature and Ring Signature from Pairings
- How to Hide Circuits in MPC an Efficient Framework for Private Function Evaluation
- Improved Lattice-Based Threshold Ring Signature Scheme
- Short Accountable Ring Signatures Based on DDH
- A New Efficient Threshold Ring Signature Scheme Based on Coding Theory
- Advances in Cryptology - EUROCRYPT 2004
- Ring Signatures of Sub-linear Size Without Random Oracles
- On the Security Models of (Threshold) Ring Signature Schemes
- Oblivious Polynomial Evaluation
- Progress in Cryptology - INDOCRYPT 2004
- Efficient Ring Signatures Without Random Oracles
- On Signatures of Knowledge
- Theory of Cryptography
