Information theory and the security of binary data perturbation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3348, Issue , 2004, Pages 136-147

  Vora, Poorvi L ^a  

^a GEORGE WASHINGTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; DATA PRIVACY; ENTROPY; CRYPTOGRAPHY; INFORMATION THEORY;

BINARY DATA; DATA PERTURBATION; ESTIMATION ERRORS; FINITE NUMBER; INFERENCE ATTACKS; PRIVACY MEASURES; PUBLIC SURVEYS; RANDOM DATA; STATISTICAL DATABASE;

INFORMATION THEORY; DATA PRIVACY;

EID: 35048843809     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30556-9_12     Document Type: Article

References (16)

1. Nabil R. Adam and John G. Worthmann. Security-control methods for statistical databases: a comparative study. ACM Computing Surveys, Vol. 21, No. 4, pp. 515-556, December 1989.
2. D. Agrawal and C. C. Aggarwal. On the design and quantification of privacy preserving data mining algorithms. Proceedings of the Twenteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Santa Barbara, California, USA, May 21-23 2001.
3. R. Agrawal and R. Srikant. Privacy-Preserving Data Mining. Proc. of the ACM SIGMOD Conference on Management of Data, Dallas, May 2000.
4. G. R. Blakley and C. Meadows. Security of ramp schemes. Proc. of Crypto'84, Lecture Notes on Comput. Sci., 196, pp. 242-268, Springer Verlag, 1984.
5. Thomas M. Cover and Joy A. Thomas. Elements of Information Theory. John Wiley and Sons, 1991.
6. Csilla Farkas and Sushil Jajodia. The inference problem: a survey. ACM SIGKDD Explorations Newsletter Volume 4, Issue 2, pp. 6-11, December 2003.
7. David G. Forney. Concatenated Codes, MIT Press, Cambridge, Mass., 1966.
8. Diane Lambert. Measures of Disclosure Risk and Harm. Journal of Official Statistics, 9, pp. 313-331, 1993.
9. Y. Lindell and B. Pinkas. Privacy Preserving Data Mining. Journal of Cryptology, 15 (3), 177-206, 2002.
10. Michael Luby. Pseudorandomness and cryptographic applications. Princeton Computer Science Notes, 1996.
11. Rajeev Motwani and Prabhakar Raghavan. Randomized Algorithms, pp. 67-73, Cambridge University Press, New York, NY, 1995.
12. Krishnamurty Muralidhar and Rathindra Sarathy. Security of random data perturbation methods. ACM Transactions on Database Systems (TODS) vol. 24, no. 4, Dec. 1999, pp. 487 - 493
13. Michael K. Reiter and Aviel Rubin. Crowds: Anonymity for Web Transactions. ACM Transactions on Information and System Security, Vol. 1, No. 1, pp. 66-92, November 1998.
14. Claude Shannon. A mathematical theory of communication. Bell Systems Technical Journal, vol. 27, pp. 379-423, July 1948.
15. Daniel A. Spielman. Linear-time encodable and decodable error-correcting codes. IEEE Transactions on Information Theory, Vol 42, No 6, pp. 1723-1732, 1996.
16. Poorvi Vora. The channel coding theorem and the security of binary randomization. Proc., 2003 IEEE International Symposium of Information Theory, Yokohama, Japan, June 30 - July 4, pp. 306, 2003.