Privacy preserving data sharing with anonymous ID assignment

IEEE Transactions on Information Forensics and Security

Volumn 8, Issue 2, 2013, Pages 402-413

  Dunning, Larry A ^a   Kresman, Ray ^a  

^a BOWLING GREEN STATE UNIVERSITY   (United States)

Author keywords

Anonymization and deanonymization; Cloud and distributed computing systems; Multiparty computation; Privacy preserving data mining; Privacy protection; Security and trust in cooperative communications

Indexed keywords

ANONYMIZATION; DISTRIBUTED COMPUTING SYSTEMS; MULTIPARTY COMPUTATION; PRIVACY PRESERVING DATA MINING; PRIVACY PROTECTION;

ALGORITHMS; DATA PRIVACY; INFORMATION THEORY; ITERATIVE METHODS; MARKOV PROCESSES; POLYNOMIALS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 84872696068     PISSN: 15566013     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIFS.2012.2235831     Document Type: Article

References (42)

1. Sarbanes-Oxley Act of 2002, Title 29, Code of Federal Regulations, Part 1980, 2003.
2. White Paper - The EssentialGuide toWeb AnalyticsVendor Selection, IBM [Online]. Available: http://measure.coremetrics.com/corem/getform/ reg/wp-evaluation-guide
3. A. Shamir, "How to share a secret," Commun. ACM, vol. 22, no. 11, pp. 612-613, 1979.
4. A. Friedman, R. Wolff, and A. Schuster, "Providing k-anonymity in data mining," VLDB Journal, vol. 17, no. 4, pp. 789-804, Jul. 2008.
5. F. Baiardi, A. Falleni, R. Granchi, F. Martinelli, M. Petrocchi, and A. Vaccarelli, "Seas, a secure e-voting protocol: Design and implementation," Comput. Security, vol. 24, no. 8, pp. 642-652, Nov. 2005. (Pubitemid 41690977)
6. D. Chaum, "Untraceable electronic mail, return address and digital pseudonyms," Commun. ACM, vol. 24, no. 2, pp. 84-88, Feb. 1981. (Pubitemid 11480996)
7. Q. Xie and U. Hengartner, "Privacy-preserving matchmaking for mobile social networking secure against malicious users," in Proc. 9th Ann. IEEE Conf. Privacy, Security and Trust, Jul. 2011, pp. 252-259.
8. O. Goldreich, S. Micali, and A. Wigderson, "How to play any mental game," in Proc. 19th Ann. ACM Conf. Theory of Computing, Jan. 1987, pp. 218-229, ACM Press.
9. A. Yao, "Protocols for secure computations," in Proc. 23rd Ann. IEEE Symp. Foundations of Computer Science, 1982, pp. 160-164, IEEE Computer Society.
10. C. Clifton, M. Kantarcioglu, J. Vaidya, X. Lin, and M. Y. Zhu, "Tools for privacy preserving distributed data mining," ACM SIGKDD Explorations Newsletter, vol. 4, no. 2, pp. 28-34, Dec. 2002.
11. J. Wang, T. Fukasama, S. Urabe, and T. Takata, "A collusion-resistant approach to privacy-preserving distributed data mining," IEICE Trans. Inf. Syst. (Inst. Electron. Inf. Commun. Eng.), vol. E89-D, no. 11, pp. 2739-2747, 2006.
12. J. Smith, "Distributing identity [symmetry breaking distributed access protocols]," IEEE Robot. Autom. Mag., vol. 6, no. 1, pp. 49-56, Mar. 1999.
13. D. Jana, A. Chaudhuri, and B. B. Bhaumik, "Privacy and anonymity protection in computational grid services," Int. J. Comput. Sci. Applicat., vol. 6, no. 1, pp. 98-107, Jan. 2009.
14. D. M. Goldschlag,M. G. Reed, and P. F. Syverson, "Hiding routing information," in Proc. Information Hiding, 1996, pp. 137-150, Springer- Verlag.
15. L. Willenborg and T. Waal, Elements of Statistical Disclosure Control, ser. Lecture Notes in Statistics. New York: Springer, 2001, vol. 155.
16. S. S. Shepard, R. Dong, R. Kresman, and L. Dunning, "Anonymous id assignment and opt-out," in Lecture Notes in Electrical Engineering, S. Ao and L. Gleman, Eds. New York: Springer, 2010, pp. 420-431.
17. A. Karr, "Secure statistical analysis of distributed databases, emphasizing what we don't know," J. Privacy Confidentiality, vol. 1, no. 2, pp. 197-211, 2009.
18. D.Angluin, "Local and global properties in networks of processors (extended abstract)," in Proc. 12th Ann. ACM Symp. Theory of Computing (STOC '80), New York, 1980, pp. 82-93.
19. W. Fokkink and J. Pang, "Variations on itai-rodeh leader election for anonymous rings and their analysis in prism," J. Universal Comput. Sci., vol. 12, no. 8, pp. 981-1006, Aug. 2006. (Pubitemid 44413382)
20. J. W. Yoon and H. Kim, "A new collision-free pseudonym scheme in mobile ad hoc networks," in Proc. 7th Int. Conf. Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOPT'09), Piscataway, NJ, 2009, pp. 376-380, IEEE Press.
21. J.W. Yoon and H. Kim, "A perfect collision-free pseudonym system," IEEE Commun. Lett., vol. 15, no. 6, pp. 686-688, Jun. 2011.
22. A. Shamir, R. L. Rivest, and L. M. Adleman, Mental Poker Massachusetts Institute of Technology, Tech. Rep. MIT-LCS-TM-125, 1979.
23. J. Castellà-Roca, V. Daza, J. Domingo-Ferrer, and F. Sebé, "Privacy homomorphisms for e-gambling and mental poker," in Proc. IEEE Int. Conf. Granular Computing, 2006, pp. 788-791. (Pubitemid 44762026)
24. R. Canetti, "Security and composition of multi-party cryptographic protocols," J. Cryptol., vol. 13, no. 1, pp. 143-202, 2000.
25. U. Maurer, "Secure multi-party computation made simple," in Proc. 3rd Int. Conf. Security in Communication Networks (SCN'02), Berlin, Heidelberg, 2003, pp. 14-28, Springer-Verlag.
26. T. M. Cover and J.A. Thomas, Elements of Information Theory. New York: Wiley-Interscience, 1991.
27. R. Cramer and S. Fehr, The Mathematical Theory of Information, and Applications ver. 2.0 [Online]. Available: http://homepages. cwi.nl/~bouman/icc/InfTheory2.pdf
28. C. Crépeau, G. Savvides, C. Schaffner, and J. Wullschleger, Information- Theoretic Conditions for Two-Party Secure Function Evaluation, ser. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 2006, vol. 4004, ch. 32, pp. 538-554.
29. S. Urabe, J. Wang, and T. Takata, "A collusion-resistant approach to distributed privacy-preserving data mining," in Parallel and Distributed Computing and Systems, T. Gonzalez, Ed. MIT Cambridge: ACTA Press, Nov. 2004, vol. 436, no. 088, pp. 626-631. (Pubitemid 40088194)
30. J. A. Eidswick, "A proof of Newton's power sum formulas," Amer. Math. Monthly, vol. 75, no. 4, pp. 396-396, Apr. 1968.
31. D. G. Mead, "Newton's identities," Amer. Math. Monthly, vol. 99, no. 8, pp. 749-749, Oct. 1992.
32. H. Dörrie, "Sturm's problem of the number of roots," in 100 Great Problems of Elementary Mathematics: Their History and Solutions. New York: Dover, 1965, pp. 112-116.
33. V. Prasolov and S. Ivanov, Problems and Theorems in Linear Algebra, ser. Translations of Mathematical Monographs. Providence, RI: Amer. Math. Society, 1994.
34. C. M. Grinstead and J. L. Snell, "Chapter 11:Markov chains," in Introduction to Probability, 2nd ed. Providence, RI: Amer. Math. Society, 1997, pp. 510-510.
35. P.-J. Courtois and P. Semal, "Bounds for transient characteristics of Markov chains with large or infinite state spaces," in Proc. First Int. Conf. Numerical Solutions of Markov Chains, Raleigh, NC, Jan. 8-10, 1990, Numerical Solution ofMarkov Chains, W. J. Stewart, Ed. New York: Marcel Dekker, 1991, pp. 413-434.
36. V. I. Romanovskii, DiscreteMarkov Chains. Translated From the Russian by E. Seneta. Groningen: Wolters-Noordhoff, 1970.
37. T. P. Pedersen, "A threshold cryptosystem without a trusted party," in Proc. 10th Ann. Int. Conf. Theory and Application of Cryptographic Techniques (EUROCRYPT'91), Berlin, Heidelberg, 1991, pp. 522-526, Springer-Verlag.
38. R. Canetti, C. Dwork, M. Naor, and R. Ostrovsky, "Deniable encryption," in CRYPTO, ser. Lecture Notes in Computer Science, B. S. K. Jr., Ed. New York: Springer, 1997, vol. 1294, pp. 90-104. (Pubitemid 127112546)
39. E. R. Berlekamp, "Factoring polynomials over large finite fields," Math. Computat., vol. 24, no. 111, pp. 713-713, Sep. 1970.
40. D. G. Cantor and H. Zassenhaus, "A new algorithm for factoring polynomials over finite fields," Math. Computat., vol. 36, no. 154, pp. 587-592, May 1981.
41. R. Crandall and C. B. Pomerance, Prime Numbers: A Computational Perspective, 2nd ed. New York: Springer, 2005.
42. D. E. Knuth, The Art of Computer Programming: Seminumerical Algorithms. Reading, MA: Addison-Wesley, 1969, vol. 2, pp. 429-430.