How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Admission Control in Peer Groups
NCA '03 Proceedings of the Second IEEE International Symposium on Network Computing and Applications
Admission control in Peer-to-Peer: design and performance evaluation
Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks
Proceedings of the 11th ACM conference on Computer and communications security
Efficient Node Admission for Short-lived Mobile Ad Hoc Networks
ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
Usable presentation of secure pseudonyms
Proceedings of the 2005 workshop on Digital identity management
Intra-Application Partitioning in an eLearning Environment - A Discussion of Critical Aspects
ARES '06 Proceedings of the First International Conference on Availability, Reliability and Security
SybilGuard: defending against sybil attacks via social networks
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
User centricity: a taxonomy and open issues
Proceedings of the second ACM workshop on Digital identity management
How to win the clonewars: efficient periodic n-times anonymous authentication
Proceedings of the 13th ACM conference on Computer and communications security
Rapid demonstration of linear relations connected by boolean operators
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Efficient proofs that a committed number lies in an interval
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
A signature scheme with efficient protocols
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
Efficient proofs of knowledge of discrete logarithms and representations in groups with hidden order
PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
A verifiable random function with short proofs and keys
PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Cryptanalysis of an efficient proof of knowledge of discrete logarithm
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
Unclonable group identification
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
| Hi-index | 0.00 |
An attacker who can control arbitrarily many user identitiescan break the security properties of most conceivable systems. This iscalled a "Sybil attack". We present a solution to this problem that doesnot require online communication with a trusted third party and that inaddition preserves the privacy of honest users. Given an initial so-called Sybil-free identity domain, our proposal can be used for deriving Sybilfreeunlinkable pseudonyms associated with other identity domains. Thepseudonyms are self-certified and computed by the users themselves fromtheir cryptographic long-term identities.