Thinking inside the BLAC box: Smarter protocols for faster anonymous blacklisting

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2013, Pages 71-81

  Henry, Ryan ^a   Goldberg, Ian ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

anonymous blacklisting; batch zero knowledge proofs; efficiency

Indexed keywords

ACCESS STRUCTURE; ANONYMOUS BLACKLISTING; ANONYMOUS CREDENTIAL; PARTIAL KNOWLEDGE; TRUSTED THIRD PARTIES; VERIFICATION TECHNIQUES; ZERO KNOWLEDGE PROOF; ZERO-KNOWLEDGE PROTOCOLS;

EFFICIENCY;

SECURITY OF DATA;

EID: 84888993079     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2517840.2517855     Document Type: Conference Paper

References (34)

1. M. H. Au and A. Kapadia. PERM: Practical reputation-based blacklisting without TTPs. In Proceedings of CCS 2012, pages 929-940, Raleigh, NC, USA, October 2012.
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, February 2012.
3. M. H. Au, W. Susilo, and Y. Mu. Constant-size dynamic k-TAA. In Proceedings of SCN 2006, volume 4116 of LNCS, pages 111-125, Maiori, Italy, September 2006.
4. M. H. Au, P. P. Tsang, and A. Kapadia. PEREA: Practical TTP-free revocation of repeatedly misbehaving anonymous users. ACM Transactions on Information and System Security, 14(4):29, December 2011.
5. M. Bellare, J. A. Garay, and T. Rabin. Fast batch verification for modular exponentiation and digital signatures. In Proceedings of EUROCRYPT 1998, volume 1403 of LNCS, pages 236-250, Espoo, Finland, June 1998.
6. D. Boneh and X. Boyen. Short signatures without random oracles and the SDH assumption in bilinear groups. Journal of Cryptology, 21(2):149-177, April 2008.
7. J. N. Bos and M. J. Coster. Addition chain heuristics. In Proceedings of CRYPTO 1989, volume 435 of LNCS, pages 400-407, Santa Barbara, CA, USA, August 1989.
8. E. Brickell and J. Li. Enhanced Privacy ID: A direct anonymous attestation scheme with enhanced revocation capabilities. IEEE Transactions on Dependable and Secure Computing (TDSC), 9(3):345-360, May 2012.
9. E. F. Brickell, D. M. Gordon, K. S. McCurley, and D. B. Wilson. Fast exponentiation with precomputation (extended abstract). In Proceedings of EUROCRYPT 1992, volume 658 of LNCS, pages 200-207, Balatonfüred, Hungary, May 1992.
10. J. Camenisch and V. Shoup. Practical verifiable encryption and decryption of discrete logarithms. In Proceedings of CRYPTO 2003, volume 2729 of LNCS, pages 126-144, Santa Barbara, CA, USA, August 2003.
11. J. Camenisch and M. Stadler. Efficient group signature schemes for large groups (extended abstract). In Proceedings of CRYPTO 1997, volume 1294 of LNCS, pages 410-424, Santa Barbara, CA, USA, August 1997.
12. D. Chaum and T. P. Pedersen. Wallet databases with observers. In Proceedings of CRYPTO 1992, volume 740 of LNCS, pages 89-105, Santa Barbara, CA, USA, August 1992.
13. R. Cramer, I. Damgård, and B. Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. In Proceedings of CRYPTO 1994, volume 839 of LNCS, pages 174-187, Santa Barbara, CA, USA, August 1994.
14. I. Damgård. On Σ-protocols. Technical report, Aarhus Universitet, March 2011. CPT 2011; Available from http://www.daimi.au.dk/~ivan/ Sigma.pdf.
15. J. R. Douceur. The Sybil attack. In Proceedings of IPTPS 2002, volume 2429 of LNCS, pages 251-260, Cambridge, MA, USA, March 2002.
16. A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In Proceedings of CRYPTO 1986, volume 263 of LNCS, pages 186-194, Santa Barbara, CA, USA, August 1986.
17. R. Henry and I. Goldberg. Formalizing anonymous blacklisting systems. In Proceedings of IEEE S&P 2011, pages 81-95, Berkeley, CA, USA, May 2011.
18. R. Henry and I. Goldberg. All-but-k mercurial commitments and their applications. Technical Report CACR 2012-26, University of Waterloo, Waterloo, ON, Canada, December 2012. Available from http://cacr.uwaterloo.ca/techreports/ 2012/cacr2012-26.pdf.
19. R. Henry and I. Goldberg. Batch proofs of partial knowledge. In Proceedings of ACNS 2012, volume 7954 of LNCS, pages 502-517, Banff, AB, Canada, June 2013.
20. R. Henry and I. Goldberg. Thinking inside the BLAC box: Smarter protocols for faster anonymous blacklisting (extended version). Technical Report CACR 2013-26, University of Waterloo, Waterloo, ON, Canada, August 2013. Available from http://cacr.uwaterloo.ca/techreports/2013/cacr2013-26.pdf.
21. R. Henry, K. Henry, and I. Goldberg. Making a Nymbler Nymble using VERBS. In Proceedings of PETS 2010, volume 6205 of LNCS, pages 111-129, Berlin, Germany, July 2010.
22. T. Icart. How to hash into elliptic curves. In Proceedings of CRYPTO 2009, volume 5677 of LNCS, pages 303-316, Santa Barbara, CA, USA, August 2009.
23. P. C. Johnson, A. Kapadia, P. P. Tsang, and S. W. Smith. Nymble: Anonymous IP-address blocking. In Proceedings of PETS 2007, volume 4776 of LNCS, pages 113-133, Ottawa, ON, Canada, June 2007.
24. C. H. Lim. Efficient multi-exponentiation and application to batch verification of digital signatures. Technical report, Sejong University, August 2000. Available from http://dasan.sejong.ac.kr/~chlim/pub/multi-exp.ps.
25. C. H. Lim and P. J. Lee. More flexible exponentiation with precomputation. In Proceedings of CRYPTO 1994, volume 839 of LNCS, pages 95-107, Santa Barbara, CA, USA, August 1994.
26. Z. Lin and N. Hopper. Jack: Scalable accumulator-based nymble system. In Proceedings of WPES 2010, pages 53-62, Chicago, IL, USA, October 2010.
27. P. Lofgren and N. Hopper. BNymble: More anonymous blacklisting at almost no cost (a short paper). In Proceedings of FC 2011, volume 7035 of LNCS, pages 268-275, Gros Islet, St. Lucia, February 2011.
28. A. Menezes, P. C. van Oorschot, and S. A. Vanstone. Handbook of Applied Cryptography. CRC Press, Boca Raton, FL, USA, October 1996. Fifth Printing, August 2001.
29. J. Sauerbrey and A. Dietel. Resource requirements for the application of addition chains in modulo exponentiation. In Proceedings of EUROCRYPT 1992, volume 658 of LNCS, pages 174-182, Balatonfüred, Hungary, May 1992.
30. C.-P. Schnorr. Efficient identification and signatures for smart cards. In Proceedings of CRYPTO 1989, volume 435 of LNCS, pages 239-252, Santa Barbara, CA, USA, August 1989.
31. E. J. Schwartz, D. Brumley, and J. M. McCune. Contractual anonymity. In Proceedings of NDSS 2010, San Diego, CA, USA, February 2010.
32. The Tor Project. List of IRC/chat networks that block or support Tor. https://trac.torproject.org/projects/tor/wiki/doc/BlockingIrc (Retrieved: 2013-04-08).
33. P. P. Tsang, M. H. Au, A. Kapadia, and S. W. Smith. Blacklistable Anonymous Credentials: Blocking misbehaving users without TTPs. In Proceedings of CCS 2007, pages 72-81, Alexandria, VA, USA, October 2007.
34. 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:1-39:33, December 2010.