Efficient anonymous message submission

Proceedings - IEEE INFOCOM

Volumn , Issue , 2012, Pages 2228-2236

  Zhao, Xinxin ^a   Li, Lingjun ^a   Xue, Guoliang ^a   Silva, Gabriel ^a  

^a ARIZONA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION ROUNDS; COMPUTATIONAL OVERHEADS; GROUP SIZE; HIGH PROBABILITY; MALICIOUS ATTACK; ONLINE SURVEYS; PRIVACY CONCERNS; SECRET SHARING SCHEMES; SYMMETRIC-KEY CRYPTOSYSTEM;

COMMUNICATION;

CRYPTOGRAPHY;

EID: 84861631303     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2012.6195608     Document Type: Conference Paper

References (28)

1. R. Agrawal and R. Srikant, "Privacy-preserving data mining," in SIGMOD, vol. 29, no. 2. ACM, 2000, pp. 439-450.
2. M. Bellare, A. Desai, E. Jokipii, and P. Rogaway, "A concrete security treatment of symmetric encryption," in focs. Published by the IEEE Computer Society, 1997, p. 394.
3. J. Benaloh, "Secret sharing homomorphisms: Keeping shares of a secret secret (extended abstract)," in Advances in Cryptology?CRYPTO?86. Springer, 1987, pp. 251-260.
4. M. Bodrato, "Towards optimal toom-cook multiplication for univariate and multivariate polynomials in characteristic 2 and 0," Arithmetic of Finite Fields, pp. 116-133, 2007.
5. J. Brickell and V. Shmatikov, "Efficient anonymity-preserving data collection," in Proceedings of the 12th ACM SIGKDD. ACM, 2006, pp. 76-85.
6. N. Cao, C. Wang, M. Li, K. Ren, and W. Lou, "Privacy-preserving multikeyword ranked search over encrypted cloud data," in INFOCOM, 2011 Proceedings IEEE. IEEE, 2011, pp. 829-837.
7. D. Chaum, "Untraceable electronic mail, return addresses, and digital pseudonyms," Communications of the ACM, vol. 24, no. 2, pp. 84-90, 1981.
8. D. Chaum, "The dining cryptographers problem: Unconditional sender and recipient untraceability," Journal of cryptology, vol. 1, no. 1, pp. 65-75, 1988.
9. H. Corrigan-Gibbs and B. Ford, "Dissent: accountable anonymous group messaging," in ACM CCS. ACM, 2010, pp. 340-350.
10. Crypto++, http://www.cryptopp.com/, 2010.
11. W. Du and M. Atallah, "Secure multi-party computation problems and their applications: a review and open problems," in Proceedings of the 2001 workshop on New security paradigms. ACM, 2001, pp. 13-22.
12. M. Freedman, K. Nissim, and B. Pinkas, "Efficient private matching and set intersection," in Advances in Cryptology-EUROCRYPT 2004. Springer, 2004, pp. 1-19.
13. O. Goldreich, "Secure multi-party computation," Working Draft, 2000.
14. S. Goldwasser and S. Micali, Probabilistic encryption* 1," Journal of computer and system sciences, vol. 28, no. 2, pp. 270-299, 1984.
15. P. Golle and A. Juels, "Dining cryptographers revisited," in Advances in Cryptology-Eurocrypt 2004. Springer, 2004, pp. 456-473.
16. M. Li, N. Cao, S. Yu, and W. Lou, "Findu: Privacy-preserving personal profile matching in mobile social networks," in Proc. of Infocom, 2011.
17. Y. Lindell and B. Pinkas, "Privacy preserving data mining," in Advances in Cryptology?CRYPTO 2000. Springer, 2000, pp. 36-54.
18. A. Narayanan, N. Thiagarajan, M. Lakhani, M. Hamburg, and D. Boneh, "Location privacy via private proximity testing," in Proc. of NDSS, 2011.
19. T. Nishide and K. Ohta, "Multiparty computation for interval, equality, and comparison without bit-decomposition protocol," Public Key Cryptography-PKC 2007, pp. 343-360, 2007.
20. ns 2, http://www.isi.edu/nsnam/ns/.
21. A. Shamir, "How to share a secret," Communications of the ACM, vol. 22, no. 11, pp. 612-613, 1979.
22. E. Sirer, S. Goel, M. Robson, and D. Engin, "Eluding carnivores: File sharing with strong anonymity," in Proceedings of the 11th workshop on ACM SIGOPS European workshop. ACM, 2004, pp. 19-es.
23. D. Stinson, Cryptography: theory and practice. CRC press, 2006.
24. P. Syverson, D. Goldschlag, and M. Reed, "Onion routing for anonymous and private internet connections," 1999.
25. M.Waidner, B. Pfitzmann et al., "The dining cryptographers in the disco: Unconditional sender and recipient untraceability with computationally secure serviceability."
26. W. Wong, D. Cheung, B. Kao, and N. Mamoulis, "Secure knn computation on encrypted databases," in SIGMOD. ACM, 2009, pp. 139-152.
27. Z. Yang, S. Zhong, and R. Wright, "Anonymity-preserving data collection,"in ACM SIGKDD. ACM, 2005, pp. 334-343.
28. A. Yao, "How to generate and exchange secrets," in FOCS. IEEE, 1986, pp. 162-167.