Nothing Special   »   [go: up one dir, main page]

skip to main content
research-article

Rights Protection for Discrete Numeric Streams

Published: 01 May 2006 Publication History

Abstract

Today's world of increasingly dynamic environments naturally results in more and more data being available as fast streams. Applications such as stock market analysis, environmental sensing, Web clicks, and intrusion detection are just a few of the examples where valuable data is streamed. Often, streaming information is offered on the basis of a nonexclusive, single-use customer license. One major concern, especially given the digital nature of the valuable stream, is the ability to easily record and potentially "replay” parts of it in the future. If there is value associated with such future replays, it could constitute enough incentive for a malicious customer (Mallory) to record and duplicate data segments, subsequently reselling them for profit. Being able to protect against such infringements becomes a necessity. In this work, we introduce the issue of rights protection for discrete streaming data through watermarking. This is a novel problem with many associated challenges including: operating in a finite window, single-pass, (possibly) high-speed streaming model, and surviving natural domain specific transforms and attacks (e.g., extreme sparse sampling and summarizations), while at the same time keeping data alterations within allowable bounds. We propose a solution and analyze its resilience to various types of attacks as well as some of the important expected domain-specific transforms, such as sampling and summarization. We implement a proof of concept software (wms.*) and perform experiments on real sensor data from the NASA Infrared Telescope Facility at the University of Hawaii, to assess encoding resilience levels in practice. Our solution proves to be well suited for this new domain. For example, we can recover an over 97 percent confidence watermark from a highly down-sampled (e.g., less than 8 percent) stream or survive stream summarization (e.g., 20 percent) and random alteration attacks with very high confidence levels, often above 99 percent.

References

[1]
R. Agrawal, P.J. Haas, and J. Kiernan, “Watermarking Relational Data: Framework, Algorithms and Analysis,” The VLDB J., vol. 12, no. 2, pp. 157-169, 2003.
[2]
M. Arnold, S.D. Wolthusen, and M. Schmucker, Techniques and Applications of Digital Watermarking and Content Protection. Artech House Publishers, 2003.
[3]
M.J. Atallah and S.S. Wagstaff Jr., “Watermarking with Quadratic Residues,” Proc. IS-T/SPIE Conf. Security and Watermarking of Multimedia Contents, SPIE, vol. 3657, pp. 283-288, 1999.
[4]
B. Babcock, S. Babu, M. Datar, and R. Motwani, “Models and Issues in Data Stream Systems,” Proc. ACM Symp. Principles of Database Systems (PODS), pp. 1-16, 2002.
[5]
M. Barni and F. Bartolini, Watermarking Systems Engineering: Enabling Digital Assets Security and Other Applications. Marcel Dekker, 2004.
[6]
D. Carney, U. Cetintemel, M. Cherniack, C. Convey, S. Lee, G. Seidman, N. Stonebraker, M. Tatbul, and S. Zdonik, “Monitoring Streams— A New Class of Data Management Applications,” Proc. Int'l Conf. Very Large Data Bases (VLDB), 2002.
[7]
S. Chandrasekaran and M.J. Franklin, “Streaming Queries over Streaming Data,” Proc. Int'l Conf. Very Large Data Bases (VLDB), pp. 203-214, 2002.
[8]
I. Cox, J. Bloom, and M. Miller, “Digital Watermarking,” Digital Watermarking, Morgan Kaufmann, 2001.
[9]
M. Datar, A. Gionis, P. Indyk, and R. Motwani, “Maintaining Stream Statistics over Sliding Windows,” Proc. ACM-SIAM Symp. Discrete Algorithms, pp. 635-644, 2002.
[10]
J. Eggers and B. Girod, Informed Watermarking. Kluwer Academic Publishers, 2002.
[11]
N.F. Johnson, Z. Duric, and S. Jajodia, Information Hiding: Steganography and Watermarking-Attacks and Countermeasures. Kluwer Academic Publishers, 2001.
[12]
J. Kang, J.F. Naughton, and S.D. Viglas, “Evaluating Window Joins over Unbounded Streams,” Proc. Int'l Conf. Design Eng., 2003.
[13]
Information Hiding Techniques for Steganography and Digital Watermarking, S. Katzenbeisser and F. Petitcolas, eds., Artech House, 2001.
[14]
J. Kiernan and R. Agrawal, “Watermarking Relational Databases,” Proc. 28th Int'l Conf. Very Large Databases (VLDB), 2002.
[15]
F. Korn, S. Muthukrishnan, and D. Srivastava, “Reverse Nearest Neighbor Aggregates over Streams,” Proc. Int'l Conf. Very Large Data Bases (VLDB), 2002.
[16]
Y. Li, V. Swarup, and S. Jajodia, “A Robust Watermarking Scheme for Relational Data,” Proc. Workshop Information Technology and Systems (WITS), pp. 195-200, 2003.
[17]
C.-S. Lu, Multimedia Security: Steganography and Digital Watermarking Techniques for Protection of Intellectual Property, Idea Group Publishing, 2004.
[18]
NASA, The Hawaii Univ. Infrared Telescope Facility,
[19]
B. Schneier, Applied Cryptography: Protocols, Algorithms and Source Code in C. Wiley&Sons, 1996.
[20]
H.T. Sencar, M. Ramkumar, and A.N. Akansu, Data Hiding Fundamentals and Applications: Content Security in Digital Multimedia. Elsevier Science and Technology Books, 2004.
[21]
R. Sion, “Proving Ownership over Categorical Data,” Proc. IEEE Int'l Conf. Data Eng. (ICDE), 2004.
[22]
R. Sion, M. Atallah, and S. Prabhakar, “Rights Protection for Relational Data,” Proc. ACM Special Interest Group on Management of Data Conf. (SIGMOD), 2003.
[23]
R. Sion, M. Atallah, and S. Prabhakar, “Relational Data Rights Protection through Watermarking,” IEEE Trans. Knowledge and Data Eng., vol. 16, no. 6, June 2004.
[24]
R. Sion, M. Atallah, and S. Prabhakar, “Resilient Rights Protection for Sensor Streams,” Proc. Very Large Databases Conf. (VLDB), 2004.

Cited By

View all
  • (2015)On Data Publishing with Clustering PreservationACM Transactions on Knowledge Discovery from Data10.1145/27004039:3(1-30)Online publication date: 1-Apr-2015
  • (2015)Self-Identifying Data for Fair UseJournal of Data and Information Quality10.1145/26874225:3(1-30)Online publication date: 2-Mar-2015
  • (2012)Right-protected data publishing with hierarchical clustering preservationProceedings of the 21st ACM international conference on Information and knowledge management10.1145/2396761.2396845(654-663)Online publication date: 29-Oct-2012
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering  Volume 18, Issue 5
May 2006
143 pages

Publisher

IEEE Educational Activities Department

United States

Publication History

Published: 01 May 2006

Author Tags

  1. Rights protection
  2. discrete streams
  3. sensor networks
  4. watermarking.

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 19 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2015)On Data Publishing with Clustering PreservationACM Transactions on Knowledge Discovery from Data10.1145/27004039:3(1-30)Online publication date: 1-Apr-2015
  • (2015)Self-Identifying Data for Fair UseJournal of Data and Information Quality10.1145/26874225:3(1-30)Online publication date: 2-Mar-2015
  • (2012)Right-protected data publishing with hierarchical clustering preservationProceedings of the 21st ACM international conference on Information and knowledge management10.1145/2396761.2396845(654-663)Online publication date: 29-Oct-2012
  • (2010)Watermarking-based intellectual property protection for sensor streaming dataInternational Journal of Computer Applications in Technology10.1504/IJCAT.2010.03602539:4(213-223)Online publication date: 1-Oct-2010
  • (2010)Rights protection of trajectory datasets with nearest-neighbor preservationThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-010-0178-619:4(531-556)Online publication date: 1-Aug-2010
  • (2009)Embedding and Retrieving Private Metadata in ElectrocardiogramsJournal of Medical Systems10.1007/s10916-008-9185-133:4(241-259)Online publication date: 1-Aug-2009
  • (2009)Online pairing of VoIP conversationsThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-007-0087-518:1(77-98)Online publication date: 1-Jan-2009
  • (2008)Ownership protection of shape datasets with geodesic distance preservationProceedings of the 11th international conference on Extending database technology: Advances in database technology10.1145/1353343.1353379(276-286)Online publication date: 25-Mar-2008
  • (2007)Time series compressibility and privacyProceedings of the 33rd international conference on Very large data bases10.5555/1325851.1325905(459-470)Online publication date: 23-Sep-2007
  • (2007)Proof-infused streamsProceedings of the 33rd international conference on Very large data bases10.5555/1325851.1325871(147-158)Online publication date: 23-Sep-2007
  • Show More Cited By

View Options

View options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media