Publications associées à Revisiting the Indifferentiability of the Sum of Permutations

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.

Circular Security Reconsidered

Serge Vaudenay, Fatma Betül Durak

The notion of circular security of pseudorandom functions (PRF) was introduced in Distance Bounding Protocols. So far, only a construction based on a random oracle model was proposed. Circular security stands between two new notions which we call Key Depen ...

Springer International Publishing2016

Clever Arbiters Versus Malicious Adversaries

Serge Vaudenay

When moving from known-input security to chosen-input security, some generic attacks sometimes become possible and must be discarded by a specific set of rules in the threat model. Similarly, common practices consist of fixing security systems, once an exp ...

Springer Berlin Heidelberg2016

High System-Code Security with Low Overhead

George Candea, Johannes Kinder, Volodymyr Kuznetsov, Jonas Benedict Wagner

Security vulnerabilities plague modern systems because writing secure systems code is hard. Promising approaches can retrofit security automatically via runtime checks that implement the desired security policy; these checks guard critical operations, like ...

2015

Boosting OMD for Almost Free Authentication of Associated Data

Serge Vaudenay, Damian Vizár, Reza Reyhanitabar

We propose pure OMD (p-OMD) as a new variant of the Offset Merkle-Damgård (OMD) authenticated encryption scheme. Our new scheme inherits all desirable security features of OMD while having a more compact structure and providing higher efficiency. The origi ...

Springer2015

Secure & Lightweight Distance-Bounding

Serge Vaudenay, Aikaterini Mitrokotsa

Distance-bounding is a practical solution to be used in security-sensitive contexts, mainly to prevent relay attacks. The main challenge when designing such protocols is maintaining their inexpensive cryptographic nature, whilst being able to protect again ...

2013

On the Pseudorandom Function Assumption in (Secure) Distance-Bounding Protocols

Serge Vaudenay, Aikaterini Mitrokotsa

In this paper, we show that many formal and informal security results on distance-bounding (DB) protocols are incorrect/incomplete. We identify that this inadequacy stems from the fact that the pseudorandom function (PRF) assumption alone, invoked in many ...

Springer2012

Ron was wrong, Whit is right

Arjen Lenstra, Joppe Willem Bos, Thorsten Kleinjung, Maxime Augier, Christophe Wachter

We performed a sanity check of public keys collected on the web. Our main goal was to test the validity of the assumption that different random choices are made each time keys are generated. We found that the vast majority of public keys work as intended. ...

IACR2012

Interpreting Hash Function Security Proofs

Juraj Sarinay

We provide a concrete security treatment of several "provably secure" hash functions. Interpreting arguments behind MQ-HASH, FSB, SWIFFTX and VSH we identify similar lines of reasoning. We aim to formulate the main security claims in a language closer to t ...

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

Revisiting the Indifferentiability of the Sum of Permutations

Graph Chatbot

Chattez avec Graph Search

Breaking the FF3 Format Preserving Encryption

Circular Security Reconsidered

Clever Arbiters Versus Malicious Adversaries

High System-Code Security with Low Overhead

Boosting OMD for Almost Free Authentication of Associated Data

Secure & Lightweight Distance-Bounding

On the Pseudorandom Function Assumption in (Secure) Distance-Bounding Protocols

Ron was wrong, Whit is right

Interpreting Hash Function Security Proofs

A Message Recognition Protocol Based on Standard Assumptions

Clever Arbiters Versus Malicious Adversaries

Breaking the FF3 Format Preserving Encryption

Secure & Lightweight Distance-Bounding

High System-Code Security with Low Overhead

Boosting OMD for Almost Free Authentication of Associated Data

Ron was wrong, Whit is right

On the Pseudorandom Function Assumption in (Secure) Distance-Bounding Protocols

A Message Recognition Protocol Based on Standard Assumptions

Interpreting Hash Function Security Proofs

Circular Security Reconsidered