Logarithmic-size (linkable) threshold ring signatures in the plain model

DOI10.1007/978-3-030-97131-1_15zbMath1519.94222MaRDI QIDQ6113965

Daniel Slamanig, Christoph Striecks, Stephan Krenn, Abida Haque

Publication date: 10 August 2023

Published in: Public-Key Cryptography – PKC 2022 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-97131-1_15

zbMATH Keywords

threshold ring signatures; 1-out-of-\(N\) ring signature scheme

Mathematics Subject Classification ID

94A60: Cryptography

94A62: Authentication, digital signatures and secret sharing

Related Items

Extendable threshold ring signatures with enhanced anonymity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ring signatures: Stronger definitions, and constructions without random oracles
• More efficient (almost) tightly secure structure-preserving signatures
• Kurosawa-Desmedt meets tight security
• A generic approach to constructing and proving verifiable random functions
• Statistical ZAP arguments
• Statistical Zaps and new oblivious transfer protocols
• Efficient redactable signature and application to anonymous credentials
• Compact ring signatures from learning with errors
• Stronger notions and a more efficient construction of threshold ring signatures
• Structure-preserving signatures on equivalence classes from standard assumptions
• Ring signatures: logarithmic-size, no setup -- from standard assumptions
• It wasn't me! Repudiability and claimability of ring signatures
• MoniPoly -- an expressive \(q\)-SDH-based anonymous attribute-based credential system
• Verifiable Random Functions from Standard Assumptions
• Formal Treatment of Privacy-Enhancing Credential Systems
• New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators
• Learning with Rounding, Revisited
• Structure-Preserving Signatures on Equivalence Classes and Their Application to Anonymous Credentials
• Zero-Knowledge Accumulators and Set Algebra
• The Kernel Matrix Diffie-Hellman Assumption
• On the Security of the Winternitz One-Time Signature Scheme
• Constant-Size Commitments to Polynomials and Their Applications
• Better Key Sizes (and Attacks) for LWE-Based Encryption
• Structure-Preserving Signatures from Standard Assumptions, Revisited
• Optimal Verification of Operations on Dynamic Sets
• Stretching Groth-Sahai: NIZK Proofs of Partial Satisfiability
• Adaptive Partitioning
• Advances in Cryptology - EUROCRYPT 2004
• Information Security and Privacy
• Information Security Practice and Experience
• Zaps and Their Applications
• Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
• Topics in Cryptology – CT-RSA 2005
• Public Key Cryptography - PKC 2005
• Traceable Ring Signature
• Efficient verifiable delay functions
• Traceable constant-size multi-authority credentials