Publications related to The Inherent Price of Indulgence

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 Inherent Price of Indulgence

Graph Chatbot

Chat with Graph Search

Fast and Space Efficient Spectral Sparsification in Dynamic Streams

Generic Round-Function-Recovery Attacks for Feistel Networks over Small Domains

Generic Round-Function-Recovery Attacks for Feistel Networks over Small Domains

General Proximal Gradient Method: A Case for Non-Euclidean Norms

Cooperative Data Exchange with Weighted Cost based on d-Basis Construction

Polynomially Solvable Instances of the Shortest and Closest Vector Problems With Applications to Compute-and-Forward

Breaking the FF3 Format Preserving Encryption

Collision-Free Pattern Formation

Pattern formation with voluminous processes

On solving LPN using BKW and variants Implementation and Analysis

Pattern formation with voluminous processes

Generic Round-Function-Recovery Attacks for Feistel Networks over Small Domains

General Proximal Gradient Method: A Case for Non-Euclidean Norms

Fast and Space Efficient Spectral Sparsification in Dynamic Streams

Generic Round-Function-Recovery Attacks for Feistel Networks over Small Domains

On solving LPN using BKW and variants Implementation and Analysis

Breaking the FF3 Format Preserving Encryption

Collision-Free Pattern Formation

Cooperative Data Exchange with Weighted Cost based on d-Basis Construction

Polynomially Solvable Instances of the Shortest and Closest Vector Problems With Applications to Compute-and-Forward