Publication

Efficient Deniable Authentication for Signatures, Application to Machine-Readable Travel Document

Related publications (34)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Secure communication using authenticated channels

Sylvain Pasini

Our main motivation is to design more user-friendly security protocols. Indeed, if the use of the protocol is tedious, most users will not behave correctly and, consequently, security issues occur. An example is the actual behavior of a user in front of an ...

EPFL2009

Static Models of Derivative-Coordinates Phase Spaces for Multivariate Time Series Classification: An Application to Signature Verification

Jonas Richiardi, Andrzej Drygajlo, Krzysztof Kryszczuk

Multivariate time series are sequences, whose order is provided by a time index; thus, most classifiers used on such data treat time as a special quantity, and encode it, structurally in a model. A typical example of such models is the hidden Markov model, ...

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

Graphical display for annual climate-based daylight simulation

Marilyne Andersen, Magali Bodart

Due to daylight variability, a design cannot be thoroughly assessed using single-moment simulations, which is why we need dynamic performance metrics like Daylight Autonomy and Useful Daylight Illuminance. Going one step further, the annual variation in pe ...

2008

Mutual Authentication in RFID: Security and Privacy

Serge Vaudenay, Radu-Ioan Paise

In RFID protocols, tags identify and authenticate themselves to readers. At Asiacrypt 2007, Vaudenay studied security and privacy models for these protocols. We extend this model to protocols which offer reader authentication to tags. Whenever corruption i ...

ACM Press2008

Normalisation of Histogrammed List Mode Data

Many PET scanners nowadays have the possibility to record event-by-event information, known as list mode data. This has the advantage of keeping the data in the highest possible resolution (both temporal and spatial). In most cases, list mode data are then ...

2008

About Machine-Readable Travel Documents

Serge Vaudenay, Martin Vuagnoux, Jean Monnerat

Passports are now equipped with RFID chips that contain private information, biometric data, and a digital signature by issuing authorities. We review most of applicable security and privacy issues. We argue that the main privacy issue is not unauthorized ...

Springer2007

About Machine-Readable Travel Documents

Serge Vaudenay, Martin Vuagnoux

Passports are documents that help immigration officers to identify people. In order to strongly authenticate their data and to automatically identify people, they are now equipped with RFID chips. These contain private information, biometrics, and a digita ...

Springer2007

About Machine-Readable Travel Documents

Serge Vaudenay, Martin Vuagnoux

2007

Short undeniable signatures

Jean Monnerat

Digital signatures are one of the main achievements of public-key cryptography and constitute a fundamental tool to ensure data authentication. Although their universal verifiability has the advantage to facilitate their verification by the recipient, this ...

EPFL2006

Short 2-Move Undeniable Signatures

Serge Vaudenay, Jean Monnerat

Attempting to reach a minimal number of moves in cryptographic protocols is a quite classical issue. Besides the theoretical interests, minimizing the number of moves can clearly facilitate practical implementations in environments with communication const ...

2006