TY - GEN
T1 - Resilient Rights Protection for Sensor Streams
AU - Sion, Radu
AU - Atallah, Mikhail
AU - Prabhakar, Sunil
N1 - Publisher Copyright:
© VLDB 2004 - Proceedings of the 30th International Conference on Very Large Data Bases.
PY - 2004
Y1 - 2004
N2 - Today's world of increasingly dynamic computing 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 non-exclusive, single-use customer license. One major concern, especially given the digital nature of the valuable stream, is the ability to easily record and potentially “re-play” parts of it in the future. If there is value associated with such future re-plays, it could constitute enough incentive for a malicious customer (Mallory) to duplicate segments of such recorded data, subsequently re-selling them for profit. Being able to protect against such infringements becomes a necessity. In this paper 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, 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% confidence watermark from a highly down-sampled (e.g. less than 8%) stream or survive stream summarization (e.g. 20%) and random alteration attacks with very high confidence levels, often above 99%.
AB - Today's world of increasingly dynamic computing 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 non-exclusive, single-use customer license. One major concern, especially given the digital nature of the valuable stream, is the ability to easily record and potentially “re-play” parts of it in the future. If there is value associated with such future re-plays, it could constitute enough incentive for a malicious customer (Mallory) to duplicate segments of such recorded data, subsequently re-selling them for profit. Being able to protect against such infringements becomes a necessity. In this paper 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, 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% confidence watermark from a highly down-sampled (e.g. less than 8%) stream or survive stream summarization (e.g. 20%) and random alteration attacks with very high confidence levels, often above 99%.
UR - https://www.scopus.com/pages/publications/105030497162
U2 - 10.1016/b978-012088469-8.50065-6
DO - 10.1016/b978-012088469-8.50065-6
M3 - Conference contribution
AN - SCOPUS:105030497162
T3 - VLDB 2004 - Proceedings of the 30th International Conference on Very Large Data Bases
SP - 732
EP - 743
BT - VLDB 2004 - Proceedings of the 30th International Conference on Very Large Data Bases
A2 - Nascimento, Mario A.
A2 - Ozsu, M. Tamer
A2 - Kossmann, Donald
A2 - Miller, Renee J.
A2 - Blakeley, Jose A.
A2 - Schiefer, K. Bernhard
PB - Morgan Kaufmann Publishers, Inc.
T2 - 30th International Conference on Very Large Data Bases, VLDB 2004
Y2 - 31 August 2004 through 3 September 2004
ER -