Efficient Ring Signatures Without Random Oracles
From MaRDI portal
Publication:5756532
Recommendations
- Efficient and random oracle-free conditionally anonymous ring signature
- Ring Signatures of Sub-linear Size Without Random Oracles
- Ring signatures of constant size without random oracles
- Efficient traceable ring signature scheme without pairings
- An efficient certificateless ring signature scheme
- Sub-linear size traceable ring signatures without random oracles
- Efficient digital signatures from RSA without random oracles
- Constant size ring signature without random oracle
- An efficient ring signature scheme from pairings
Cited in
(44)- Compact Group Signatures Without Random Oracles
- Attribute-based optimistic fair exchange: how to restrict brokers with policies
- A certificateless ring signature scheme with high efficiency in the random oracle model
- Shorter ring signatures from standard assumptions
- A Suite of Non-pairing ID-Based Threshold Ring Signature Schemes with Different Levels of Anonymity (Extended Abstract)
- Logarithmic-size ring signatures with tight security from the DDH assumption
- Two new identity-based threshold ring signature schemes
- Anonymizable ring signature without pairing
- Blind Ring Signatures Secure Under the Chosen-Target-CDH Assumption
- Identity-based quotable ring signature
- Finding composite order ordinary elliptic curves using the Cocks-Pinch method
- Fully Anonymous Group Signatures Without Random Oracles
- Sub-linear Blind Ring Signatures without Random Oracles
- Universal ring signatures in the standard model
- Sub-linear size traceable ring signatures without random oracles
- Efficient traceable ring signature scheme without pairings
- Information Security and Cryptology - ICISC 2005
- \textsf{ZKAttest}: ring and group signatures for existing ECDSA keys
- scientific article; zbMATH DE number 1942438 (Why is no real title available?)
- Unconditionally anonymous ring and mesh signatures
- Tightly secure ring signatures in the standard model
- Constant size ring signature without random oracle
- Count me in! Extendability for threshold ring signatures
- Progress in Cryptology - INDOCRYPT 2003
- Ring Signatures of Sub-linear Size Without Random Oracles
- Policy controlled system with anonymity
- Converting pairing-based cryptosystems from composite to prime order setting -- a comparative analysis
- Theory of Cryptography
- Revocable attribute-based signatures with adaptive security in the standard model
- Property-Based Attestation without a Trusted Third Party
- Decentralized attribute-based signatures
- A note on an identity-based ring signature scheme with signer verifiability
- One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model
- Non-interactive composition of sigma-protocols via Share-then-Hash
- Compact ring signatures from learning with errors
- Ring signatures: Stronger definitions, and constructions without random oracles
- Strongly unforgeable ring signature scheme from lattices in the standard model
- Hidden attribute-based signatures without anonymity revocation
- Ring signatures of constant size without random oracles
- Applied Cryptography and Network Security
- Efficient ring signatures in the standard model
- Identity-based ring signatures from RSA
- A New Efficient Threshold Ring Signature Scheme Based on Coding Theory
- An efficient ring signature scheme from pairings
This page was built for publication: Efficient Ring Signatures Without Random Oracles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756532)
