Concept

Attaque de préimage

Publications associées (54)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

On the Effectiveness of Local Binary Patterns in Face Anti-spoofing

Sébastien Marcel, André Anjos, Ivana Chingovska

Spoofing attacks are one of the security traits that biometric recognition systems are proven to be vulnerable to. When spoofed, a biometric recognition system is bypassed by presenting a copy of the biometric evidence of a valid user. Among all biometric ...

Idiap2012

Collision Attacks against the Knudsen-Preneel Compression Functions

Martijn Stam, Onur Özen

Knudsen and Preneel (Asiacrypt'96 and Crypto'97) introduced a hash function design in which a linear error-correcting code is used to build a wide-pipe compression function from underlying blockciphers operating in Davies-Meyer mode. Their main design goal ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010

A Message Recognition Protocol Based on Standard Assumptions

Serge Vaudenay, Atefeh Mashatan

We look at the problem of designing Message Recognition Protocols (MRP) and note that all proposals available in the literature have relied on security proofs which hold in the random oracle model or are based on non-standard assumptions. Incorporating ran ...

Springer2010

Analyzing Trust Management Impact to Optimal Adversarial Attacks in Recommender Systems

Karl Aberer, Hung Le Vu

Ranking systems, such as those in product review sites, and various recommender systems usually employ user ratings to rank favorite items based on their quality and/or popularity. Since higher ranked items are more likely to be selected by customers and t ...

2010

An Analysis of the Blockcipher-Based Hash Functions from PGV

Martijn Stam

Preneel, Govaerts, and Vandewalle (1993) considered the 64 most basic ways to construct a hash function H: {0, 1}*->{0, 1}(n) from a blockcipher E: {0, 1}(n) x {0, 1}(n)->{0,1}(n). They regarded 12 of these 64 schemes as secure, though no proofs or formal ...

Springer Verlag2010

On the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields

Robert Granger

Recent work by Koblitz and Menezes has highlighted the existence, in some cases, of apparent separations between the hardness of breaking discrete logarithms in a particular group, and the hardness of solving in that group problems to which the security of ...

2010

Improved Linear Differential Attacks on CubeHash

Willi Meier, Shahram Khazaei, Deian Stefan, Simon Knellwolf

This paper presents improved collision attacks on round-reduced variants of the hash function CubeHash, one of the SHA-3 second round candidates. We apply two methods for finding linear differential trails that lead to lower estimated attack complexities w ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010

A Randomized Countermeasure Against Parasitic Adversaries in Wireless Sensor Networks

Jean-Pierre Hubaux, Panagiotis Papadimitratos, Jun Luo

Due to their limited capabilities, wireless sensor nodes are subject to physical attacks that are hard to defend against. In this paper, we first identify a typical attacker, called parasitic adversary, who seeks to exploit sensor networks by obtaining mea ...

2010

Attacking the Knudsen-Preneel Compression Functions

Martijn Stam, Onur Özen

Knudsen and Preneel (Asiacrypt’96 and Crypto’97) introduced a hash function design in which a linear error-correcting code is used to build a wide-pipe compression function from underlying blockciphers operating in Davies-Meyer mode. In this paper, we (re) ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010

Algebraic, AIDA/Cube and Side Channel Analysis of KATAN Family of Block Ciphers

Pouyan Sepehrdad, Jorge Nakahara

This paper presents the first results on AIDA/cube, algebraic and side-channel attacks on variable number of rounds of all members of the KATAN family of block ciphers. Our cube attacks reach 60, 40 and 30 rounds of KATAN32, KATAN48 and KATAN64, respective ...

Springer2010