[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

BNymble: More Anonymous Blacklisting at Almost No Cost (A Short Paper)

  • Conference paper
Financial Cryptography and Data Security (FC 2011)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 7035))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
GBP 19.95
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
GBP 35.99
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 44.99
Price includes VAT (United Kingdom)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Bellare, M., Namprempre, C., Pointcheval, D., Semanko, M.: The one-more-rsa-inversion problems and the security of chaum’s blind signature scheme. J. Cryptology 16(3), 185–215 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  2. Brickell, E., Li, J.: Enhanced privacy id: a direct anonymous attestation scheme with enhanced revocation capabilities. In: WPES 2007: Proceedings of the 2007 ACM Workshop on Privacy in Electronic Society, pp. 21–30. ACM, New York (2007)

    Chapter  Google Scholar 

  3. Chaum, D.: Security without identification: transaction systems to make big brother obsolete. Commun. ACM 28(10), 1030–1044 (1985)

    Article  Google Scholar 

  4. Dingledine, R., Mathewson, N., Syverson, P.: Tor: the second-generation onion router. In: SSYM 2004: Proceedings of the 13th Conference on USENIX Security Symposium, pp. 21–21. USENIX Association, Berkeley (2004)

    Google Scholar 

  5. GmbH, J.: Jondonym: Private and secure web surfing (September 2010), http://anonymous-proxy-servers.net/

  6. Henry, R., Goldberg, I.: Extending nymble-like systems. Tech. Rep. Technical Report CACR 2010-23, Unviersity of Waterloo (2010)

    Google Scholar 

  7. Henry, R., Henry, K., Goldberg, I.: Making a nymbler nymble using verbs. Tech. rep., University of Waterloo Technical Report CACR 2010-05 (2010)

    Google Scholar 

  8. Holt, J.E., Seamons, K.E.: Nym: Practical pseudonymity for anonymous networks. Tech. Rep. 4, BYU Internet Security Research Lab (2006)

    Google Scholar 

  9. Johnson, P.C., Kapadia, A., Tsang, P.P., Smith, S.W.: Nymble: Anonymous IP-Address Blocking. In: Borisov, N., Golle, P. (eds.) PET 2007. LNCS, vol. 4776, pp. 113–133. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  10. Lin, Z., Hopper, N.: Jack: Scalable accumulator-based nymble system. In: WPES 2010: Proceedings of the 9th ACM Workshop on Privacy in the Electronic Society. ACM (2010)

    Google Scholar 

  11. Tsang, P.P., Au, M.H., Kapadia, A., Smith, S.W.: Blacklistable anonymous credentials: blocking misbehaving users without ttps. In: CCS 2007: Proceedings of the 14th ACM Conference on Computer and Communications Security, pp. 72–81. ACM, New York (2007)

    Google Scholar 

  12. Tsang, P.P., Au, M.H., Kapadia, A., Smith, S.W.: BLAC: Revoking Repeatedly Misbehaving Anonymous Users Without Relying on TTPs. Tech. rep., Dartmouth Computer Science TR2008-635 (2008)

    Google Scholar 

  13. Tsang, P.P., Au, M.H., Kapadia, A., Smith, S.W.: Perea: Towards practical ttp-free revocation in anonymous authentication. In: CCS 2008: Proceedings of the 14th ACM Conference on Computer and Communications Security, pp. 333–344. ACM (2008)

    Google Scholar 

  14. Tsang, P.P., Kapadia, A., Cornelius, C., Smith, S.W.: Nymble: Blocking Misbehaving Users in Anonymizing Networks. IEEE Transactions on Dependable and Secure Computing (TDSC) (September 2009)

    Google Scholar 

  15. Tsang, P.P., Kapadia, A., Cornelius, C., Smith, S.W.: Nymble: Blocking misbehaving users in anonymizing networks. Tech. rep., Dartmouth Computer Science TR2008-637 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

George Danezis

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lofgren, P., Hopper, N. (2012). BNymble: More Anonymous Blacklisting at Almost No Cost (A Short Paper). In: Danezis, G. (eds) Financial Cryptography and Data Security. FC 2011. Lecture Notes in Computer Science, vol 7035. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27576-0_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-27576-0_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-27575-3

  • Online ISBN: 978-3-642-27576-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics