skip to main content
10.1145/2665943.2665947acmconferencesArticle/Chapter ViewAbstractPublication PagesccsConference Proceedingsconference-collections
research-article

FARB: Fast Anonymous Reputation-Based Blacklisting without TTPs

Authors Info & Claims
Published:03 November 2014Publication History

ABSTRACT

Anonymous blacklisting schemes that do not rely on trusted third parties (TTPs) are desirable as they can block misbehaving users while protecting user privacy. Recent TTP-free schemes such as BLACR and PERM present reputation-based blacklisting, for which the service provider (SP) can assign positive or negative scores to anonymous sessions and block users whose reputations are not high enough. Though being the state of the art in anonymous blacklisting, these schemes are heavyweight and only able to support tens of authentications per minute in practical settings. We present FARB, the first reputation-based blacklisting scheme which has constant computational complexity both on the SP and user side. FARB thus supports a reputation list with billions of entries and is efficient enough for heavy-loaded SPs with thousands of authentications per minute. On the user side, FARB is fast enough even for mobile devices and supports flexible rate-limiting. We also present a novel fine-grained weighted extension which allows the SP to ramp up penalties for repeated misbehaviors according to the severity of the misbehaving user's past sessions.

References

  1. M. H. Au and A. Kapadia. PERM: Practical reputation-based blacklisting without TTPs. In Proceedings of ACM CCS 2012, pages 929--940. ACM, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. M. H. Au, A. Kapadia, and W. Susilo. BLACR: TTP-free blacklistable anonymous credentials with reputation. In Proceedings of NDSS 2012, San Diego, CA, USA,.Google ScholarGoogle Scholar
  3. M. H. Au, W. Susilo, and Y. Mu. Constant-size dynamic k-TAA. In Security and Cryptography for Networks, pages 111--125. Springer, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. D. Boneh, X. Boyen, and H. Shacham. Short group signatures. In CRYPTO 2004, pages 41--55. Springer, 2004.Google ScholarGoogle ScholarCross RefCross Ref
  5. E. Brickell and J. Li. Enhanced privacy ID: A direct anonymous attestation scheme with enhanced revocation capabilities. In Proceedings of WPES 2007, pages 21--30. ACM, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. J. Camenisch, R. Chaabouni, et al. Efficient protocols for set membership and range proofs. In ASIACRYPT 2008, pages 234--252. Springer, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. J. Camenisch, S. Hohenberger, M. Kohlweiss, A. Lysyanskaya, and M. Meyerovich. How to win the clonewars: efficient periodic n-times anonymous authentication. In Proceedings of ACM CCS 2006, pages 201--210. ACM, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. J. Camenisch and A. Lysyanskaya. Signature schemes and anonymous credentials from bilinear maps. In CRYPTO'04, volume 3152 of LNCS, pages 56--72. Springer, 2004.Google ScholarGoogle Scholar
  9. J. Camenisch and M. Stadler. Efficient group signature schemes for large groups. In CRYPTO'97, pages 410--424. Springer, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. I. Damgard. On σ-protocols. Lecture notes for CPT, 2002.Google ScholarGoogle Scholar
  11. R. Dingledine, N. Mathewson, and P. Syverson. Tor: The second-generation onion router. Technical report, DTIC Document, 2004.Google ScholarGoogle Scholar
  12. R. Henry and I. Goldberg. Thinking inside the BLAC box: smarter protocols for faster anonymous blacklisting. In Proceedings of WPES 2013, pages 71--82. ACM, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. R. Henry, K. Henry, and I. Goldberg. Making a Nymbler Nymble using VERBS. In Privacy Enhancing Technologies, pages 111--129. Springer, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. R. Kohavi and R. Longbotham. Online experiments: Lessons learned. Computer, 40(9):103--105, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Z. Lin and N. Hopper. Jack: Scalable accumulator-based nymble system. In Proceedings of WPES 2010, pages 53--62. ACM, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. P. Lofgren and N. Hopper. FAUST: efficient, TTP-free abuse prevention by anonymous whitelisting. In Proceedings of WPES 2011, pages 125--130. ACM, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. T. P. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In CRYPTO'91, pages 129--140. Springer, 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. P. P. Tsang, M. H. Au, A. Kapadia, and S. W. Smith. PEREA: Towards practical TTP-free revocation in anonymous authentication. In Proceedings of ACM CCS 2008, pages 333--344. ACM, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. P. P. Tsang, M. H. Au, A. Kapadia, and S. W. Smith. BLAC: Revoking repeatedly misbehaving anonymous users without relying on TTPs. ACM Transactions on Information and System Security (TISSEC), 13(4):39, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. P. P. Tsang, A. Kapadia, C. Cornelius, and S. W. Smith. Nymble: Blocking misbehaving users in anonymizing networks. IEEE Transactions on Dependable and Secure Computing, 8(2):256--269, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. K. Y. Yu, T. H. Yuen, S. S. Chow, S. M. Yiu, and L. C. Hui. PE(AR)2: Privacy-enhanced anonymous authentication with reputation and revocation. In Proceedings of ESORICS 2012, pages 679--696. Springer, 2012.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. FARB: Fast Anonymous Reputation-Based Blacklisting without TTPs

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      WPES '14: Proceedings of the 13th Workshop on Privacy in the Electronic Society
      November 2014
      218 pages
      ISBN:9781450331487
      DOI:10.1145/2665943

      Copyright © 2014 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 3 November 2014

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      WPES '14 Paper Acceptance Rate26of67submissions,39%Overall Acceptance Rate106of355submissions,30%

      Upcoming Conference

      CCS '24
      ACM SIGSAC Conference on Computer and Communications Security
      October 14 - 18, 2024
      Salt Lake City , UT , USA

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader