Logarithmic-size ring signatures with tight security from the DDH assumption

DOI10.1007/978-3-319-98989-1_15zbMath1500.94073OpenAlexW2885382470MaRDI QIDQ2167754

Yanyan Li

Publication date: 25 August 2022

Full work available at URL: https://hal.inria.fr/hal-01848134/file/tight-ring-sig-full-version.pdf

zbMATH Keywords

anonymityrandom oraclestight securityring signatures

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (10)

DualRing: generic construction of ring signatures with efficient instantiations ⋮ Compact ring signatures from learning with errors ⋮ One-time traceable ring signatures ⋮ Identity based linkable ring signature with logarithmic size ⋮ One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model ⋮ On tightly-secure (linkable) ring signatures ⋮ Ring signatures with user-controlled linkability ⋮ Universal ring signatures in the standard model ⋮ Non-interactive composition of sigma-protocols via Share-then-Hash ⋮ Tightly secure ring signatures in the standard model

Cites Work

• Security Proofs for Signature Schemes
• The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
• Optimal Security Proofs for Full Domain Hash, Revisited
• Tightly-Secure Signatures from Lossy Identification Schemes
• One-Out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin
• A Framework for Efficient and Composable Oblivious Transfer
• Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Group Signatures
• 1-out-of-n Signatures from a Variety of Keys
• Short Accountable Ring Signatures Based on DDH
• Advances in Cryptology - EUROCRYPT 2004
• Ring Signatures of Sub-linear Size Without Random Oracles
• Mesh Signatures
• Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors
• Efficient Ring Signatures Without Random Oracles
• On Signatures of Knowledge
• Theory of Cryptography
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Logarithmic-size ring signatures with tight security from the DDH assumption