Publication

Signature Schemes Secure Against Hard-to-Invert Leakage

Related publications (78)

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.

Security and Privacy in RFID Systems

Khaled Ouafi

This PhD thesis is concerned with authentication protocols using portable lightweight devices such as RFID tags. these devices have lately gained a significant attention for the diversity of the applications that could benefit form their features, ranging ...

EPFL2012

Statistical and Algebraic Cryptanalysis of Lightweight and Ultra-Lightweight Symmetric Primitives

Pouyan Sepehrdad

Symmetric cryptographic primitives such as block and stream ciphers are the building blocks in many cryptographic protocols. Having such blocks which provide provable security against various types of attacks is often hard. On the other hand, if possible, ...

EPFL2012

Faster Software Cryptography

Dag Arne Osvik

This thesis presents work on the efficiency and security of cryptographic software. First it describes several efforts to construct very efficient implementations of cryptographic primitives. These include the Advanced Encryption Standard (AES) as well as ...

EPFL2012

Unconditionally-Secure Robust Secret Sharing with Compact Shares

Alfonso Bolívar Cevallos Manzano

We consider the problem of reconstructing a shared secret in the presence of faulty shares, with unconditional security. We require that any t shares give no information on the shared secret, and reconstruction is possible even if up to t out of the n shar ...

Springer-Verlag2012

Forgery-Resilience for Digital Signature Schemes

Khaled Ouafi, Atefeh Mashatan

We introduce the notion of forgery-resilience for digital signature schemes, a new paradigm for digital signature schemes exhibiting desirable legislative properties. It evolves around the idea that, for any message, there can only be a unique valid signat ...

2012

Fast Key Recovery Attack on ARMADILLO1 and Variants

Serge Vaudenay, Pouyan Sepehrdad, Petr Susil

The ARMADILLO cryptographic primitive is a multi-purpose cryptographic primitive for RFID devices proposed at CHES’10. The main purpose of the primitive is to provide a secure authentication in a challenge-response protocol. It has two versions, named ARMA ...

Springer2011

A Mobile World of Security

Christine Neuberg

Security in mobile communications is a topic of increasing relevance in everyday life. We all use mobile devices for everyday communications, maybe even for exchanging confidential information with the work place. This requires security systems that are re ...

EPFL2011

Adaptive Message Authentication for Multi-Hop Networks

Jean-Yves Le Boudec, Jean-Pierre Hubaux, Nikodin Ristanovic, Panagiotis Papadimitratos, Georgios Theodorakopoulos

Recent benchmarks indicate that the use of public key cryptography results in non negligible verification times on platforms with limited processing power. In this paper, we focus on multi-hop Inter-Vehicle Communication and show that the increase in messa ...

2011

A First Step Towards Automatic Application of Power Analysis Countermeasures

Paolo Ienne, Francesco Regazzoni, Philip Brisk, Ali Galip Bayrak

In cryptography, side channel attacks, such as power analysis, attempt to uncover secret information from the physical implementation of cryptosystems rather than exploiting weaknesses in the cryptographic algorithms themselves. The design and implementati ...

Acm Order Department, P O Box 64145, Baltimore, Md 21264 Usa2011

Efficient Fail-Stop Signatures from the Factoring Assumption

Khaled Ouafi, Atefeh Mashatan

In this paper, we revisit the construction of fail-stop signatures from the factoring assumption. These signatures were originally proposed to provide information-theoretic-based security against forgeries. In contrast to classical signature schemes, in wh ...

Springer2011