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
One-way accumulators: a decentralized alternative to digital signatures
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques 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
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
A Practical and Provably Secure Coalition-Resistant Group Signature Scheme
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Tor: the second-generation onion router
SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
Blacklistable anonymous credentials: blocking misbehaving users without ttps
Proceedings of the 14th ACM conference on Computer and communications security
PEREA: towards practical TTP-free revocation in anonymous authentication
Proceedings of the 15th ACM conference on Computer and communications security
Efficient Protocols for Set Membership and Range Proofs
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
EUROCRYPT'91 Proceedings of the 10th annual 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
Nymble: anonymous IP-address blocking
PET'07 Proceedings of the 7th international conference on Privacy enhancing technologies
Jack: scalable accumulator-based nymble system
Proceedings of the 9th annual ACM workshop on Privacy in the electronic society
BLAC: Revoking Repeatedly Misbehaving Anonymous Users without Relying on TTPs
ACM Transactions on Information and System Security (TISSEC)
Making a nymbler nymble using VERBS
PETS'10 Proceedings of the 10th international conference on Privacy enhancing technologies
Nymble: Blocking Misbehaving Users in Anonymizing Networks
IEEE Transactions on Dependable and Secure Computing
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
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
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
Hi-index | 0.00 |
Some users may misbehave under the cover of anonymity by, e.g., defacing webpages on Wikipedia or posting vulgar comments on YouTube. To prevent such abuse, a few anonymous credential schemes have been proposed that revoke access for misbehaving users while maintaining their anonymity such that no trusted third party (TTP) is involved in the revocation process. Recently we proposed BLACR, a TTP-free scheme that supports `reputation-based blacklisting' --- the service provider can score users' anonymous sessions (e.g., good vs. inappropriate comments) and users with insufficient reputation are denied access. The major drawback of BLACR is the linear computational overhead in the size of the reputation list, which allows it to support reputation for only a few thousand user sessions in practical settings. We propose PERM, a revocation-window-based scheme (misbehaviors must be caught within a window of time), which makes computation independent of the size of the reputation list. PERM thus supports millions of user sessions and makes reputation-based blacklisting practical for large-scale deployments.