Publication

A Simple Logic for Authentication Protocol Design

Publications associées (39)

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

Secure Computing with the MPEG RVC Framework

Marco Mattavelli, Richard Thavot, Junaid Jameel Ahmad

Recently, ISO/IEC standardized a dataflow-programming framework called Reconfigurable Video Coding (RVC) for the specification of video codecs. The RVC framework aims at providing the specification of a system at a high abstraction level so that the functi ...

Elsevier Science Bv2013

Input-Aware Equivocable Commitments and UC-secure Commitments With Atomic Exchanges

Serge Vaudenay

We define a new primitive, input-aware equivocable commitment, baring similar hardness assumptions as plaintext-aware encryption and featuring equivocability. We construct an actual input-aware equivocable commitment protocol, based on a flavor of Diffie-H ...

Springer2013

Model Checking Security Protocols: A Multiagent System Approach

Security protocols specify the communication required to achieve security objectives, e.g., data-privacy. Such protocols are used in electronic media: e-commerce, e-banking, e-voting, etc. Formal verification is used to discover protocol-design flaws. In t ...

Imperial College London2011

Decision Procedures for Program Synthesis and Verification

Ruzica Piskac

Decision procedures are widely used in software development and verification. The goal of this dissertation is to increase the scope of properties that can be verified using decision procedures. To achieve this goal, we identify three improvements over the ...

EPFL2011

Building a Calculus of Data Structures

Viktor Kuncak, Philippe Paul Henri Suter, Ruzica Piskac

Techniques such as verification condition generation, predicate abstraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Programs and their specifications often make use of data structures such as sets ...

Springer2010

Strategy logic

We introduce strategy logic, a logic that treats strategies in two-player games as explicit first-order objects. The explicit treatment of strategies allows us to specify properties of nonzero-sum games in a simple and natural way. We show that the one-alt ...

2010

Power Consumption of Logic Circuits in Ambipolar Carbon Nanotube Technology

Giovanni De Micheli, Mohamed Haykel Ben Jamaa

Ambipolar devices have been reported in many technologies, including carbon nanotube field effect transistors (CNTFETs). The ambipolarity can be in-field controlled with a second gate, enabling the design of generalized logic gates with a high expressive p ...

2010

Expected loss analysis of thresholded authentication protocols in noisy conditions

Serge Vaudenay, Christos Dimitrakakis, Aikaterini Mitrokotsa

A number of authentication protocols have been proposed recently, where at least some part of the authentication is performed during a phase, lasting

n

rounds, with no error correction. This requires assigning an acceptable threshold for the number of de ...

2010

Smashing SQUASH-0

Serge Vaudenay, Khaled Ouafi

At the RFID Security Workshop 2007, Adi Shamir presented a new challenge-response protocol well suited for RFIDs, although based on the Rabin public-key cryptosystem. This protocol, which we call SQUASH-0, was using a linear mixing function which was subse ...

Springer2009

SenseCode: Network Coding for Reliable Sensor Networks

Christina Fragouli, Lorenzo Keller, Emre Atsan

Designing a communication protocol for sensor networks often involves obtaining the "right" trade-off between energy efficiency and reliability. In this paper, we show that network coding provides a means to elegantly balance these two goals. We present th ...

2009

Expected loss analysis of thresholded authentication protocols in noisy conditions

Serge Vaudenay, Christos Dimitrakakis, Aikaterini Mitrokotsa

A number of authentication protocols have been proposed recently, where at least some part of the authentication is performed during a phase, lasting

n

rounds, with no error correction. This requires assigning an acceptable threshold for the number of de ...

2010