TY - GEN
T1 - BNymble
T2 - 15th International Conference on Financial Cryptography and Data Security, FC 2011
AU - Lofgren, Peter
AU - Hopper, Nick
N1 - Copyright:
Copyright 2012 Elsevier B.V., All rights reserved.
PY - 2012
Y1 - 2012
N2 - Anonymous blacklisting schemes allow online service providers to prevent future anonymous access by abusive users while preserving the privacy of all anonymous users (both abusive and non-abusive). The first scheme proposed for this purpose was Nymble, an extremely efficient scheme based only on symmetric primitives; however, Nymble relies on trusted third parties who can collude to de-anonymize users of the scheme. Two recently proposed schemes, Nymbler and Jack, reduce the trust placed in these third parties at the expense of using less-efficient asymmetric crypto primitives. We present BNymble, a scheme which matches the anonymity guarantees of Nymbler and Jack while (nearly) maintaining the efficiency of the original Nymble. The key insight of BNymble is that we can achieve the anonymity goals of these more recent schemes by replacing only the infrequent "User Registration" protocol from Nymble with asymmetric primitives. We prove the security of BNymble, and report on its efficiency.
AB - Anonymous blacklisting schemes allow online service providers to prevent future anonymous access by abusive users while preserving the privacy of all anonymous users (both abusive and non-abusive). The first scheme proposed for this purpose was Nymble, an extremely efficient scheme based only on symmetric primitives; however, Nymble relies on trusted third parties who can collude to de-anonymize users of the scheme. Two recently proposed schemes, Nymbler and Jack, reduce the trust placed in these third parties at the expense of using less-efficient asymmetric crypto primitives. We present BNymble, a scheme which matches the anonymity guarantees of Nymbler and Jack while (nearly) maintaining the efficiency of the original Nymble. The key insight of BNymble is that we can achieve the anonymity goals of these more recent schemes by replacing only the infrequent "User Registration" protocol from Nymble with asymmetric primitives. We prove the security of BNymble, and report on its efficiency.
UR - http://www.scopus.com/inward/record.url?scp=84857081450&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84857081450&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-27576-0_22
DO - 10.1007/978-3-642-27576-0_22
M3 - Conference contribution
AN - SCOPUS:84857081450
SN - 9783642275753
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 268
EP - 275
BT - Financial Cryptography and Data Security - 15th International Conference, FC 2011, Revised Selected Papers
Y2 - 28 February 2011 through 4 March 2011
ER -