Publication

Bounded Tamper Resilience: How to go beyond the Algebraic Barrier

Related publications (174)

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.

Efficient Non-malleable Codes and Key-Derivation for Poly-size Tampering Circuits

Sebastian Faust

Non-malleable codes, defined by Dziembowski, Pietrzak and Wichs (ICS ’10), provide roughly the following guarantee: if a codeword c encoding some message x is tampered to c' = f(c) such that c c, then the tampered message x contained in c reveals no inf ...

Springer2014

Automated Side-Channel Vulnerability Discovery and Hardening

Ali Galip Bayrak

In traditional cryptography, an attacker tries to infer a mathematical relationship between the inputs and outputs of a cryptosystem to recover secret information. With the advances in the theoretical basis of the cryptographic algorithms, this task became ...

EPFL2014

Secure Wireless Communications via Cooperative Transmitting

Ninoslav Marina

Information-theoretic secrecy is combined with cryptographic secrecy to create a secret-key exchange protocol for wireless networks. A network of transmitters, which already have cryptographically secured channels between them, cooperate to exchange a secr ...

Hindawi Publishing Corporation2014

Unifying Leakage Models: From Probing Attacks to Noisy Leakage

Alexandre Raphaël Duc, Sebastian Faust

A recent trend in cryptography is to formally show the leakage resilience of cryptographic implementations in a given leakage model. One of the most prominent leakage models -- the so-called bounded leakage model -- assumes that the amount of leakage is a- ...

Springer2014

Breaking `128-bit Secure' Supersingular Binary Curves

Robert Granger

The discrete logarithm problem (DLP) in finite fields of small characteristic recently enjoyed a dramatic series of breakthrough results and computational records, with its (heuristic) complexity dropping from subexponential to quasi-polynomial. While thes ...

2014

On the Key Schedule of Lightweight Block Ciphers

Serge Vaudenay, Jialin Huang

Key schedules in lightweight block ciphers are often highly simplified, which causes weakness that can be exploited in many attacks. Today it remains an open problem on how to use limited operations to guarantee enough diffusion of key bits in lightweight ...

Springer-Verlag Berlin2014

Cryptanalysis of Chosen Symmetric Homomorphic Schemes

Serge Vaudenay, Damian Vizár

Since Gentry’s breakthrough result was introduced in the year 2009, the homomorphic encryption has become a very popular topic. The main contribution of Gentry’s thesis was, that it has proven, that it actually is possible to design a fully homomorphic enc ...

2014

Elliptic and Hyperelliptic Curves: A Practical Security Analysis

Joppe Willem Bos, Andrea Miele

Motivated by the advantages of using elliptic curves for discrete logarithm-based public-key cryptography, there is an active research area investigating the potential of using hyperelliptic curves of genus 2. For both types of curves, the best known algor ...

Springer Berlin Heidelberg2014

On Selecting the Nonce Length in Distance-Bounding Protocols

Serge Vaudenay, Christos Dimitrakakis, Aikaterini Mitrokotsa

Distance-bounding protocols form a family of challenge-response authentication protocols that have been introduced to thwart relay attacks. They enable a verifier to authenticate and to establish an upper bound on the physical distance to an untrusted prov ...

Oxford University Press2013

On Selecting the Nonce Length in Distance-Bounding Protocols

Serge Vaudenay, Christos Dimitrakakis, Aikaterini Mitrokotsa

Distance-bounding protocols form a family of challenge–response authentication protocols that have been introduced to thwart relay attacks. They enable a verifier to authenticate and to establish an upper bound on the physical distance to an untrusted prov ...

2013