Publication

Integrity (I) codes: Message Integrity Protection and Authentication over Insecure Channels

Related publications (72)

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.

Optimal polynomial blow up range for critical wave maps

Can Gao

We prove that the critical Wave Maps equation with target

S^2

and origin ℝ

^{2+1}

admits energy class blow up solutions of the form [ u(t, r) = Q(\lambda(t)r) + \epsilon(t, r) ] where

Q:ℝ²\rightarrow S^2

is the ground state harmonic map and $\lambda ...

EPFL2015

Secure Communication in Erasure Networks with State-feedback

László Czap

The security and efficiency of communication are two of the main concerns for networks of today and the future. Our understanding of how to efficiently send information over various channels and networks has significantly increased in the past decade (see ...

EPFL2014

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

Bounded Tamper Resilience: How to go beyond the Algebraic Barrier

Sebastian Faust

Related key attacks (RKAs) are powerful cryptanalytic attacks where an adversary can change the secret key and observe the effect of such changes at the output. The state of the art in RKA security protects against an a-priori unbounded number of certain a ...

2013

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

Secure Device Authentication Mechanisms for the Smart Grid-Enabled Home Area Networks

Erman Ayday

In this paper, we propose secure and intuitive device authentication techniques for the Smart Grid enabled Home Area Networks (HANs). We assume a distributed architecture for the HAN in which the smart appliances can communicate both with the smart meter a ...

2013

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

Network Coding

Mahdi Jafari Siavoshani

The demand for higher throughput and better efficiency are two important challenges for future communication networks. During the past decades, a lot of research studies have been devoted to investigating and proposing near optimal and efficient schemes an ...

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

Optimal polynomial blow up range for critical wave maps

Can Gao

We prove that the critical Wave Maps equation with target

S^2

and origin ℝ

^{2+1}

admits energy class blow up solutions of the form [ u(t, r) = Q(\lambda(t)r) + \epsilon(t, r) ] where

Q:ℝ²\rightarrow S^2

is the ground state harmonic map and $\lambda ...

EPFL2015