Optimal Computational Split-state Non-malleable Codes

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.

Information theory has allowed us to determine the fundamental limit of various communication and algorithmic problems, e.g., the channel coding problem, the compression problem, and the hypothesis testing problem. In this work, we revisit the assumptions ...

This thesis delves into the critical study of particle transport in matter, particularly emphasising its implications for machine protection at CERN's accelerator complex and facilities. To conduct studies of this nature, FLUKA and Geant4 stand out within ...

5G New Radio (NR) has stringent demands on both performance and complexity for the design of low-density parity-check (LDPC) decoding algorithms and corresponding VLSI implementations. Furthermore, decoders must fully support the wide range of all 5G NR bl ...

We introduce a model-independent method for the efficient simulation of low-entropy systems, whose dynamics can be accurately described with a limited number of states. Our method leverages the time-dependent variational principle to efficiently integrate ...

Due to its high parallelism, belief propagation (BP)decoding is amenable to high-throughput applications and thusrepresents a promising solution for the ultra-high peak datarate required by future communication systems. To bridge theperformance gap compare ...

We perform an error analysis of a fully discretised Streamline Upwind Petrov Galerkin Dynamical Low Rank (SUPG-DLR) method for random time-dependent advection-dominated problems. The time integration scheme has a splitting-like nature, allowing for potenti ...

Quantum computers have the potential to surpass conventional computing, but they are hindered by noise which induces errors that ultimately lead to the loss of quantum information. This necessitates the development of quantum error correction strategies fo ...

Current cryptographic solutions will become obsolete with the arrival of large-scale universal quantum computers. As a result, the National Institute of Standards and Technology supervises a post-quantum standardization process which involves evaluating ca ...

Quantum computing not only holds the potential to solve long-standing problems in quantum physics, but also to offer speed-ups across a broad spectrum of other fields. Access to a computational space that incorporates quantum effects, such as superposition ...

Driven by the demand for real-time processing and the need to minimize latency in AI algorithms, edge computing has experienced remarkable progress. Decision-making AI applications stand out for their heavy reliance on data-centric operations, predominantl ...

Low-Density Parity-Check (LDPC) decoder is among the power hungry building blocks of wireless communication systems. Voltage scaling down to Near-Threshold (NT) voltages substantially improves energy efficiency, in theory up 10x. However, tuning the voltag ...

In 1948, Claude Shannon laid the foundations of information theory, which grew out of a study to find the ultimate limits of source compression, and of reliable communication. Since then, information theory has proved itself not only as a quest to find the ...

Encoding quantum information onto bosonic systems is a promising route to quantum error correc-tion. In a cat code, this encoding relies on the confinement of the dynamics of the system onto the two-dimensional manifold spanned by Schrodinger cats of oppos ...

In the last decade, DNA has been increasingly investigated as an alternative medium for cold data storage, presenting several advantages over standard hard drives such as a higher density, longer lifespan and lower energy consumption. However, such coding ...

With the looming threat of large-scale quantum computers, a fair portion of recent cryptographic research has focused on examining cryptographic primitives from the perspective of a quantum adversary. Shor's 1994 result revealed that quantum computers can ...

With the pervasive digitalization of modern life, we benefit from efficient access to information and services. Yet, this digitalization poses severe privacy challenges, especially for special-needs individuals. Beyond being a fundamental human right, priv ...

Quantum computing has made significant progress in recent years, with Google and IBM releasing quantum computers with 72 and 50 qubits, respectively. Google has also achieved quantum supremacy with its 54-qubit device, and IBM has announced the release of ...

The Bitcoin architecture heavily relies on the ECDSA signature scheme which is broken by quantum adversaries as the secret key can be computed from the public key in quantum polynomial time. To mitigate this attack, bitcoins can be paid to the hash of a pu ...

In the framework of Impagliazzo's five worlds, a distinction is often made between two worlds, one where public-key encryption exists (Cryptomania), and one in which only one-way functions exist (MiniCrypt). However, the boundaries between these worlds can ...

Quantum random number generators (QRNGs) are a burgeoning technology used for a variety of applications, including modern security and encryption systems. Typical methods exploit an entropy source combined with an extraction or bit generation circuit in or ...

Optimal Computational Split-state Non-malleable Codes

Chat with Graph Search

On Speed and Advantage : Results in Information Velocity and Monitoring Problems

Bridging Monte Carlo worlds: a new framework for accelerator simulations applied on shielding and machine protection studies

A Generalized Adjusted Min-Sum Decoder for 5G LDPC Codes: Algorithm and Implementation

Adaptive variational low-rank dynamics for open quantum systems

High-Throughput and Flexible Belief Propagation List Decoder for Polar Codes

Error estimates for SUPG-stabilised Dynamical Low Rank Approximations

Quantum Error Correction and Simulation in Open Bosonic Systems

Side-channel analysis of isogeny-based key encapsulation mechanisms and hash-based digital signatures

Scalable Quantum Algorithms for Noisy Quantum Computers

EdgeAI-Aware Design of In-Memory Computing Architectures

Low Power LDPC Decoding by Reliable Voltage Down-Scaling

Time vs. Truth: Age-Distortion Tradeoffs and Strategies for Distributed Inference

Critical Schrodinger Cat Qubit

Analysis of the influence of errors in DNA-based image coding

Security in the Presence of Quantum Adversaries

Bridging the gap between theoretical and practical privacy technologies for at-risk populations

Optimizing Quantum Compilers: Efficient and Effective Algorithms

Making Classical (Threshold) Signatures Post-quantum for Single Use on a Public Ledger

Public-Key Encryption with Quantum Keys

A 3.3-Gb/s SPAD-Based Quantum Random Number Generator