Proceedings chapter
Open access

Trading-off privacy-complexity of identification problem

Presented at San Francisco (USA), 23-26 Jan. 2011
Publication date2011

In this paper, we consider an information-theoretic formulation of the content identification under search complexity constrain. The proposed framework is based on soft fingerprinting, i.e., joint consideration of sign and magnitude of fingerprint coefficients. The fingerprint magnitude is analyzed in the scope of communications with side information that results in channel decomposition, where all bits of fingerprints are classified to be communicated via several channels with distinctive characteristics. We demonstrate that under certain conditions the channels with low identification capacity can be neglected without considerable rate loss. This is a basis for the analysis of fast identification techniques trading-off theoretical performance in terms of achievable rate and search complexity.

  • content identification
  • identification rate
  • complexity
  • storage memory
  • privacy
  • soft fingerprinting
  • bit reliability
  • channel polarization
Citation (ISO format)
HOLOTYAK, Taras et al. Trading-off privacy-complexity of identification problem. In: Proceedings of SPIE Photonics West, Electronic Imaging, Media Forensics and Security XIII. San Francisco (USA). [s.l.] : [s.n.], 2011.
Main files (1)
Proceedings chapter (Published version)
  • PID : unige:47630

Technical informations

Creation03/06/2015 5:12:03 PM
First validation03/06/2015 5:12:03 PM
Update time03/14/2023 10:58:14 PM
Status update03/14/2023 10:58:13 PM
Last indexation08/29/2023 3:08:10 PM
All rights reserved by Archive ouverte UNIGE and the University of GenevaunigeBlack