On the (Im)possibility of Commitment over Gaussian Unfair Noisy Channels

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.

The Gray-Wyner network subject to a fidelity criterion is studied. Upper and lower bounds for the trade-offs between the private sum-rate and the common rate are obtained for arbitrary sources subject to mean-squared error distortion. The bounds meet exact ...

To mitigate state exposure threats to long-lived instant messaging sessions, ratcheting was introduced, which is used in practice in protocols like Signal. However, existing ratcheting protocols generally come with a high cost. Recently, Caforio et al. pro ...

Automatic Speech Recognition (ASR), as the assistance of speech communication between pilots and air-traffic controllers, can significantly reduce the complexity of the task and increase the reliability of transmitted information. ASR application can lead ...

Highly energy-efficient wireless sensor nodes are a prerequisite for a sustainable operation of the Internet of things. Therefore, classical approaches for system design based on digital signal processing are not a viable solution, but system design has to ...

This paper investigates the problem of secret key generation from correlated Gaussian random variables in the short block-length regime. Inspired by the state-of-the-art performance provided by polar codes in the short blocklength regime for channel coding ...

Public knowledge about the structure of a cryptographic system is a standard assumption in the literature and algorithms are expected to guarantee security in a setting where only the encryption key is kept secret. Nevertheless, undisclosed proprietary cry ...

Most of the cryptographic protocols that we use frequently on the internet are designed in a fashion that they are not necessarily suitable to run in constrained environments. Applications that run on limited-battery, with low computational power, or area ...

Due to the rapidly growing number of devices that need to communicate securely, there is still significant interest in the development of efficient encryption schemes. It is important to maintain a portfolio of different constructions in order to enable a ...

Several works published over the last two decades have shown for a stylized set-up with homogeneous users that metering-based priority (MBP) schemes may generate Pareto improving departure time adjustments similar to those induced by congestion pricing, bu ...

On the (Im)possibility of Commitment over Gaussian Unfair Noisy Channels

Chat with Graph Search

Shannon Bounds on Lossy Gray-Wyner Networks

Optimal Symmetric Ratcheting for Secure Communication

A Two-Step Approach To Leverage Contextual Data: Speech Recognition In Air-Traffic Communications

Spike-Based Sensing and Communication for Highly Energy-Efficient Sensor Edge Nodes

Secret Key Generation Over Wireless Channels Using Short Blocklength Multilevel Source Polar Coding

Complete Practical Side-Channel-Assisted Reverse Engineering of AES-Like Ciphers

Serial Lightweight Implementation Techniques for Block Ciphers

Towards Efficient LPN-Based Symmetric Encryption

Impacts of Metering-Based Dynamic Priority Schemes