A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
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
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
Efficient Group Signature Schemes for Large Groups (Extended Abstract)
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Unlinkable Serial Transactions
FC '97 Proceedings of the First International Conference on Financial Cryptography
A Practical and Provably Secure Coalition-Resistant Group Signature Scheme
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Group signatures with verifier-local revocation
Proceedings of the 11th ACM conference on Computer and communications security
How to win the clonewars: efficient periodic n-times anonymous authentication
Proceedings of the 13th ACM conference on Computer and communications security
Tor: the second-generation onion router
SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
Enhanced privacy id: a direct anonymous attestation scheme with enhanced revocation capabilities
Proceedings of the 2007 ACM workshop on Privacy in electronic society
Blacklistable anonymous credentials: blocking misbehaving users without ttps
Proceedings of the 14th ACM conference on Computer and communications security
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
PEREA: towards practical TTP-free revocation in anonymous authentication
Proceedings of the 15th ACM conference on Computer and communications security
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Efficient concurrent zero-knowledge in the auxiliary string model
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Quasi-efficient revocation of group signatures
FC'02 Proceedings of the 6th international conference on Financial cryptography
A signature scheme with efficient protocols
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
Nymble: anonymous IP-address blocking
PET'07 Proceedings of the 7th international conference on Privacy enhancing technologies
Zero-knowledge sets with short proofs
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
Dynamic k-times anonymous authentication
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Accumulators from bilinear pairings and applications
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Group signatures with efficient concurrent join
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Separable linkable threshold ring signatures
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
Proceedings of the 5th international conference on Security and Cryptography for Networks
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
Balancing accountability and privacy using e-cash (extended abstract)
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
k-times anonymous authentication with a constant proving cost
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
PEREA: Practical TTP-free revocation of repeatedly misbehaving anonymous users
ACM Transactions on Information and System Security (TISSEC)
FAUST: efficient, TTP-free abuse prevention by anonymous whitelisting
Proceedings of the 10th annual ACM workshop on Privacy in the electronic society
Poster: arbitrators in the security infrastructure, supporting positive anonymity
Proceedings of the 18th ACM conference on Computer and communications security
PERM: practical reputation-based blacklisting without TTPS
Proceedings of the 2012 ACM conference on Computer and communications security
VeSPA: vehicular security and privacy-preserving architecture
Proceedings of the 2nd ACM workshop on Hot topics on wireless network security and privacy
Thinking inside the BLAC box: smarter protocols for faster anonymous blacklisting
Proceedings of the 12th ACM workshop on Workshop on privacy in the electronic society
Batch proofs of partial knowledge
ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security
Hi-index | 0.00 |
Several credential systems have been proposed in which users can authenticate to service providers anonymously. Since anonymity can give users the license to misbehave, some variants allow the selective deanonymization (or linking) of misbehaving users upon a complaint to a Trusted Third Party (TTP). The ability of the TTP to revoke a user’s privacy at any time, however, is too strong a punishment for misbehavior. To limit the scope of deanonymization, some systems have been proposed in which users can be deanonymized only if they authenticate “too many times,” such as “double spending” with electronic cash. While useful in some applications, such techniques cannot be generalized to more subjective definitions of misbehavior, for example, using such schemes it is not possible to block anonymous users who “deface too many Web pages” on a Web site. We present BLAC, the first anonymous credential system in which service providers can revoke the credentials of misbehaving users without relying on a TTP . Since revoked users remain anonymous, misbehaviors can be judged subjectively without users fearing arbitrary deanonymization by a TTP . Additionally, our construction supports a d-strikes-out revocation policy, whereby users who have been subjectively judged to have repeatedly misbehaved at least d times are revoked from the system. Thus, for the first time, it is indeed possible to block anonymous users who have “defaced too many Web pages” using our scheme.