Publication

Secure Communication in Erasure Networks with State-feedback

Related publications (131)

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.

Key Negotiation Downgrade Attacks on Bluetooth and Bluetooth Low Energy

Daniele Antonioli

Bluetooth (BR/EDR) and Bluetooth Low Energy (BLE) are pervasive wireless technologies specified in the Bluetooth standard. The standard includes key negotiation protocols used to generate long-term keys (during pairing) and session keys (during secure conn ...

ASSOC COMPUTING MACHINERY2020

Bits through Time

Elie Najm

In any communication system, there exist two dimensions through which the information at the source becomes distorted before reaching the destination: the noisy channel and time. Messages transmitted through a noisy channel are susceptible to modification ...

EPFL2019

Bidirectional Asynchronous Ratcheted Key Agreement with Linear Complexity

Serge Vaudenay, Fatma Betül Durak

Following up mass surveillance and privacy issues, modern secure communication protocols now seek more security such as forward secrecy and post-compromise security. They cannot rely on an assumption such as synchronization, predictable sender/receiver rol ...

Springer2019

Misuse Attacks on Post-quantum Cryptosystems

Serge Vaudenay, Loïs Evan Huguenin-Dumittan, Abdullah Talayhan, Fatma Betül Durak, Ciprian Baetu

Many post-quantum cryptosystems which have been proposed in the National Institute of Standards and Technology (NISI) standardization process follow the same meta-algorithm, but in different algebras or different encoding methods. They usually propose two ...

SPRINGER INTERNATIONAL PUBLISHING AG2019

Provably Secure Authenticated Encryption

Damian Vizár

Authenticated Encryption (AE) is a symmetric key cryptographic primitive that ensures confidentiality and authenticity of processed messages at the same time. The research of AE as a primitive in its own right started in 2000. The security goals of AE wer ...

EPFL2018

A Joint Typicality Approach to Compute–Forward

Michael Christoph Gastpar, Sung Hoon Lim, Adriano Pastore, Chen Feng

This paper presents a joint typicality framework for encoding and decoding nested linear codes in multi-user networks. This framework provides a new perspective on compute–forward within the context of discrete memoryless networks. In particular, it establ ...

2018

Single-server Multi-user Private Information Retrieval with Side Information

Michael Christoph Gastpar, Su Li

In the problem of private information retrieval with side information, a single user wants to recover one of the K independent messages which are stored at one or multiple servers. The user initially has a subset of messages as side information. The goal o ...

2018

Mapping Affinities in Academic Organizations

Frédéric Kaplan, Boris Beaude, Dario Rodighiero

Scholarly affinities are one of the most fundamental hidden dynamics that drive scientific development. Some affinities are actual, and consequently can be measured through classical academic metrics such as co-authoring. Other affinities are potential, an ...

2018

Oblivious Dynamic Searchable Encryption on Distributed Cloud Systems

Fatma Betül Durak

Dynamic Searchable Symmetric Encryption (DSSE) allows search/update operations over encrypted data via an encrypted index. However, DSSE has been shown to be vulnerable to statistical inference attacks, which can extract a significant amount of information ...

SPRINGER INTERNATIONAL PUBLISHING AG2018

Characterizations of Two Channel Orderings: Input-Degradedness and the Shannon Ordering

Rajai Nasser

The ordering of communication channels was first introduced by Shannon. In this paper, we aim to find characterizations of two orderings: input-degradedness and the Shannon ordering. A channel W is said to be input-degraded from another channel W' if W can ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2018