Watermarking Data Cubes

来源 :上海交通大学学报(英文版) | 被引量 : 0次 | 上传用户:dizenxu
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
We propose a robust watermarking scheme and several extensions for digital right management of data cubes. The ownership information is hidden into a data cube by modifying a set of selected cell values. Its owner can use his private key to control all the watermarking parameters freely. Neither original data cube nor the watermark is required in watermark detection. Detailed analysis and extensive experiments are conducted for the proposed schemes in terms of watermark detectability, robustness and efficiency. Our results show that the scheme performs well in actual applications.
其他文献
This paper proposes an adaptively secure solution to certificateless distributed key encapsulation mechanism from pairings by using Canetti\'s adaptive secure key generation scheme based on discrete logarithm. The proposed scheme can withstand adaptive
This paper presents a concrete democratic group signature scheme which holds (t, n)-threshold trace-ability. In the scheme, the capability of tracing the actual signer is distributed among n group members. It gives a valid democratic group signature such
The universal composability framework is a new approach for designing and analyzing the security of cryptographic protocols. In this framework, the security of protocols is maintained under a general protocol composition operation. In the paper, we propos
This paper proposes an efficient batch secret sharing protocol among n players resilient to t < n/4 players in asynchronous network. The construction of our protocol is along the line of Hirt\'s protocol which works in synchronous model. Compared with t
A new algorithm for linear instantaneous independent component analysis is proposed based on max-imizing the log-likelihood contrast function which can be changed into a gradient equation. An iterative method is introduced to solve this equation efficient