Efficient Ring Signatures Without Random Oracles

DOI10.1007/978-3-540-71677-8_12zbMath1127.94027OpenAlexW1828411905MaRDI QIDQ5756532

Hovav Shacham, Brent Waters

Publication date: 4 September 2007

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

Full work available at URL: https://doi.org/10.1007/978-3-540-71677-8_12

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Related Items (26)

Compact ring signatures from learning with errors ⋮ Unconditionally anonymous ring and mesh signatures ⋮ Constant Size Ring Signature Without Random Oracle ⋮ Logarithmic-size ring signatures with tight security from the DDH assumption ⋮ One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model ⋮ Count me in! Extendability for threshold ring signatures ⋮ Universal ring signatures in the standard model ⋮ Finding composite order ordinary elliptic curves using the Cocks-Pinch method ⋮ Non-interactive composition of sigma-protocols via Share-then-Hash ⋮ Attribute-based optimistic fair exchange: how to restrict brokers with policies ⋮ A New Efficient Threshold Ring Signature Scheme Based on Coding Theory ⋮ Two new identity-based threshold ring signature schemes ⋮ Property-Based Attestation without a Trusted Third Party ⋮ Tightly secure ring signatures in the standard model ⋮ Identity-based ring signatures from RSA ⋮ Revocable Attribute-Based Signatures with Adaptive Security in the Standard Model ⋮ Identity-based quotable ring signature ⋮ A certificateless ring signature scheme with high efficiency in the random oracle model ⋮ Decentralized Attribute-Based Signatures ⋮ An efficient ring signature scheme from pairings ⋮ Hidden attribute-based signatures without anonymity revocation ⋮ A Suite of Non-pairing ID-Based Threshold Ring Signature Schemes with Different Levels of Anonymity (Extended Abstract) ⋮ Policy controlled system with anonymity ⋮ Converting pairing-based cryptosystems from composite to prime order setting -- a comparative analysis ⋮ Sub-linear Size Traceable Ring Signatures without Random Oracles ⋮ Strongly unforgeable ring signature scheme from lattices in the standard model

This page was built for publication: Efficient Ring Signatures Without Random Oracles