Identity-based cryptosystems and signature schemes
Proceedings of CRYPTO 84 on Advances in cryptology
How to construct pseudorandom permutations from pseudorandom functions
SIAM Journal on Computing - Special issue on cryptography
The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Communications of the ACM
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Threshold Ring Signatures and Applications to Ad-hoc Groups
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
ID-Based Blind Signature and Ring Signature from Pairings
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
1-out-of-n Signatures from a Variety of Keys
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
Foundations of Cryptography: Volume 2, Basic Applications
Foundations of Cryptography: Volume 2, Basic Applications
On monotone formula closure of SZK
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Designated verifier proofs and their applications
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Efficient and generalized group signatures
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Aggregate and verifiably encrypted signatures from bilinear maps
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Ring signature schemes for general ad-hoc access structures
ESAS'04 Proceedings of the First European conference on Security in Ad-hoc and Sensor Networks
Separable linkable threshold ring signatures
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
On the Definitions of Anonymity for Ring Signatures
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Efficient ring signatures without random oracles
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Identity-committable signatures and their extension to group-oriented ring signatures
ACISP'07 Proceedings of the 12th Australasian conference on Information security and privacy
Wireless Personal Communications: An International Journal
Non-interactive confirmer signatures
CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
On the definition of anonymity for ring signatures
VIETCRYPT'06 Proceedings of the First international conference on Cryptology in Vietnam
Escrowed linkability of ring signatures and its applications
VIETCRYPT'06 Proceedings of the First international conference on Cryptology in Vietnam
Short linkable ring signatures revisited
EuroPKI 2006 Proceedings of the Third European conference on Public Key Infrastructure: theory and Practice
Computing on authenticated data
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
An improved threshold ring signature scheme based on error correcting codes
WAIFI'12 Proceedings of the 4th international conference on Arithmetic of Finite Fields
Ring signatures of sub-linear size without random oracles
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Certificate-free ad hoc anonymous authentication
Information Sciences: an International Journal
Hi-index | 5.23 |
In this work we formalize the notion of a ring signature, which makes it possible to specify a set of possible signers without revealing which member actually produced the signature. Unlike group signatures, ring signatures have no group managers, no setup procedures, no revocation procedures, and no coordination: any user can choose any set of possible signers that includes himself, and sign any message by using his secret key and the others' public keys, without getting their approval or assistance. Ring signatures provide an elegant way to leak authoritative secrets in an anonymous way, to sign casual email in a way that can only be verified by its intended recipient, and to solve other problems in multiparty computations. Our main contribution lies in the presentation of efficient constructions of ring signatures; the general concept itself (under different terminology) was first introduced by Cramer et al. [CDS94]. Our constructions of such signatures are unconditionally signer-ambiguous, secure in the random oracle model, and exceptionally efficient: adding each ring member increases the cost of signing or verifying by a single modular multiplication and a single symmetric encryption. We also describe a large number of extensions, modifications and applications of ring signatures which were published after the original version of this work (in Asiacrypt 2001).