• Home
  1. Home
  2. Security Analysis of Robust Perceptual Hashing
Proceedings chapter
English

Security Analysis of Robust Perceptual Hashing

Contributors

Koval, Oleksiy; Voloshynovskyy, Svyatoslav; Beekhof, Fokko Pieter; Pun, Thierry

Presented at

San Jose, CA, Jan. 27

Published in

Edward J. Delp III and Ping Wah Wong and Nasir D. Memon Jana Dittmann (Ed.), Security, Forensics, Steganography, and Watermarking of Multimedia Contents X

Publisher

SPIE

Collection

  • SPIE Proceedings; 6819

Publication date

2008

Abstract

In this paper we considered the problem of security analysis of robust perceptual hashing in authentication application. The main goal of our analysis was to estimate the amount of trial efforts of the attacker, who is acting within the Kerckhoffs security principle, to reveal a secret key. For this purpose, we proposed to use Shannon equivocation that provides an estimate of complexity of the key search performed based on all available prior information and presented its application to security evaluation of particular robust perceptual hashing algorithms.

Keywords

  • Algorithms

UNIGE affiliation entities

UNIGE research groups

Citation (ISO format)

KOVAL, Oleksiy et al. Security Analysis of Robust Perceptual Hashing. In: Security, Forensics, Steganography, and Watermarking of Multimedia Contents X. Edward J. Delp III and Ping Wah Wong and Nasir D. Memon Jana Dittmann (Ed.). San Jose, CA. [s.l.] : SPIE, 2008. (SPIE Proceedings) doi: 10.1117/12.764846

Identifiers

Additional URL for this publication

http://www.spie.org/Publications/Proceedings/Paper/10.1117/12.764846
754views
0downloads

Technical informations

Creation

06/03/2015 17:12:15

First validation

06/03/2015 17:12:15

Update

14/03/2023 22:59:13

Status update

14/03/2023 22:59:13

Last indexation

30/10/2024 23:20:37
All rights reserved by Archive ouverte UNIGE and the University of Geneva
OpenAIRE Indexed & Validated