Effective Fingerprinting Codes for Database

Though customer databases are so important, they can be sold under 95/46/EC and Data Protection Act law. This is a potential business. However, this business are encountering a big problem that purchaser wants to illegally distribute his database. We call them attacker. Attacker can use many schemes such as attribute, collusion and complimentary attack to achieve his goal. We have improved the technique of Thach V. Bui et. al., in which fingerprints are embedded into columns by anonymizing specific columns so that it is effective against attribute and collusion attacks. We have also proved that d-disjunct matrices are effective fingerprinting codes.

[1]  Thach V. Bui,et al.  Efficiently Preserving Data Privacy Range Queries in Two-Tiered Wireless Sensor Networks , 2012, 2012 9th International Conference on Ubiquitous Intelligence and Computing and 9th International Conference on Autonomic and Trusted Computing.

[2]  Paul Wang,et al.  Strategic database marketing , 1994 .

[3]  Rakesh Agrawal,et al.  Watermarking Relational Databases , 2002, Very Large Data Bases Conference.

[4]  R. Blattberg,et al.  Database marketing , 1997 .

[5]  M. Alekhnovich.  Linear Diophantine equations over polynomials and soft decoding of Reed-Solomon codes , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[6]  Thach V. Bui,et al.  A Variant of Non-Adaptive Group Testing and Its Application in Pay-Television via Internet , 2013, ICT-EurAsia.

[7]  Ely Porat,et al.  Search Methodologies , 2022 .

[8]  Alexander Vardy,et al.  Correcting errors beyond the Guruswami-Sudan radius in polynomial time , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[9]  Madhu Sudan,et al.  Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..

[10]  Jean-Pierre Corriveau,et al.  A globally optimal k-anonymity method for the de-identification of health data. , 2009, Journal of the American Medical Informatics Association : JAMIA.

[11]  D. Zwick,et al.  Whose Identity Is It Anyway? Consumer Representation in the Age of Database Marketing , 2004 .

[12]  Venkatesan Guruswami,et al.  Improved decoding of Reed-Solomon and algebraic-geometric codes , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[13]  Pierangela Samarati,et al.  Protecting Respondents' Identities in Microdata Release , 2001, IEEE Trans. Knowl. Data Eng..

[14]  Jessica Staddon,et al.  Applications of list decoding to tracing traitors , 2003, IEEE Trans. Inf. Theory.

[15]  D. Du,et al.  Combinatorial Group Testing and Its Applications , 1993 .

[16]  Graham Cormode,et al.  What's hot and what's not: tracking most frequent items dynamically , 2003, TODS.

[17]  James L. Massey,et al.  Shift-register synthesis and BCH decoding , 1969, IEEE Trans. Inf. Theory.

[18]  Noboru Sonehara,et al.  An Algorithm for k-Anonymity-Based Fingerprinting , 2011, IWDW.

[19]  R. Dorfman.  The Detection of Defective Members of Large Populations , 1943 .

[20]  Atri Rudra,et al.  Efficiently decodable non-adaptive group testing , 2010, SODA '10.

[21]  Stephen B. Wicker,et al.  Reed-Solomon Codes and Their Applications , 1999 .

[22]  Mahdi Cheraghchi.  Noise-resilient group testing: Limitations and constructions , 2013, Discret. Appl. Math..

[23]  G. David Forney,et al.  Concatenated codes , 2009, Scholarpedia.

[24]  Noboru Sonehara,et al.  Robust Fingerprinting Codes for Database , 2013, ICA3PP.

[25]  A. Sterrett.  On the Detection of Defective Members of Large Populations , 1957 .

[26]  M. Sudan,et al.  Coding theory: tutorial & survey , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[27]  Ding-Zhu Du,et al.  New Constructions of One- and Two-Stage Pooling Designs , 2008, J. Comput. Biol..

[28]  Mikhail J. Atallah,et al.  Indexing Information for Data Forensics , 2005, ACNS.

[29]  Madhu Sudan.  Coding Theory: Tutorial and Survey , 2001, FOCS 2001.

[30]  Latanya Sweeney,et al.  Achieving k-Anonymity Privacy Protection Using Generalization and Suppression , 2002, Int. J. Uncertain. Fuzziness Knowl. Based Syst..

[31]  Richard C. Singleton,et al.  Nonrandom binary superimposed codes , 1964, IEEE Trans. Inf. Theory.

[32]  Peter Beelen,et al.  Key equations for list decoding of Reed-Solomon codes and how to solve them , 2010, J. Symb. Comput..

[33]  Peter Elias,et al.  List decoding for noisy channels , 1957 .

[34]  Graham Cormode,et al.  What's hot and what's not: tracking most frequent items dynamically , 2003, PODS '03.

[35]  Jianmin Wang,et al.  Fingerprinting relational databases , 2006, SAC '06.

[36]  Ding-Zhu Du,et al.  A survey on combinatorial group testing algorithms with applications to DNA Library Screening , 1999, Discrete Mathematical Problems with Medical Applications.