Secure transmission using an untrusted relay with scaled compute-and-forward

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Consider two problems about an unknown probability distribution 𝑝: (1) How many samples from 𝑝 are required to test if 𝑝 is supported on 𝑛 elements or not? Specifically, given samples from 𝑝, determine whether it is supported on at most 𝑛 elements, or it i ...

This paper presents a first implementation of gradient, divergence, and particle tracing schemes for the EMC3 code, a stochastic 3D plasma fluid code widely employed for edge plasma and impurity transport modeling in tokamaks and stellarators. These scheme ...

Billions of people now have conversations daily over the Internet. A large portion of this communication takes place via secure messaging protocols that offer "end-to-end encryption'" guarantees and resilience to compromise like the widely-used Double Ratc ...

We prove sharp bounds on the enstrophy growth in viscous scalar conservation laws. The upper bound is, up to a prefactor, the enstrophy created by the steepest viscous shock admissible by the L infinity and total variation bounds and viscosity. This answer ...

A large body of work shows that machine learning (ML) models can leak sensitive or confidential information about their training data. Recently, leakage due to distribution inference (or property inference) attacks is gaining attention. In this attack, the ...

We analyze the accuracy and sample complexity of variational Monte Carlo approaches to simulate the dynamics of many-body quantum systems classically. By systematically studying the relevant stochastic estimators, we are able to: (i) prove that the most us ...

Commitment is a key primitive which resides at the heart of several cryptographic protocols. Noisy channels can help realize information-theoretically secure commitment schemes; however, their imprecise statistical characterization can severely impair such ...

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 ...

Long global gyrokinetic turbulence simulations are particularly challenging in situations where the system deviates strongly from its initial state and when fluctuation levels are high, for example, in strong gradient regions. For particle-in-cell simulati ...

Graph-structured data arise in a variety of real-world context ranging from sensor and transportation to biological and social networks. As a ubiquitous tool to process graph-structured data, spectral graph filters have been used to solve common tasks such ...

We are interested in the well posedness of quasilinear partial differential equations of order two. Motivated by the study of the Einstein equation in relativity theory, there are a number of works dedicated to the local well-posedness issue for the quasil ...

We consider the Dynamical Low Rank (DLR) approximation of random parabolic equations and propose a class of fully discrete numerical schemes. Similarly to the continuous DLR approximation, our schemes are shown to satisfy a discrete variational formulation ...

The management of existing civil infrastructure is challenging due to evolving functional requirements, aging and climate change. Civil infrastructure often has hidden reserve capacity because of conservative approaches used in design and during constructi ...

Network information theory studies the communication of information in a network and considers its fundamental limits. Motivating from the extensive presence of the networks in the daily life, the thesis studies the fundamental limits of particular network ...

The aggregators are intermediary players at the distribution system level. They manage the financial transactions of resources such as micro-turbines (MTs), photo-voltaic (PV) production systems, flexible demands (FDs), and must-run demands (MDs) in the en ...

Time travel has always been a fascinating topic in literature and physics. In cryptography, one may wonder how to keep data confidential for some time. In this dissertation, we will study how to make private information travel to the future. This dissertat ...

A major theme of IT in the past decade has been the shift from on-premise hardware to cloud computing. Running a service in the public cloud is practical, because a large number of resources can be bought on-demand, but this shift comes with its own set of ...

A local weighted discontinuous Galerkin gradient discretization method for solving elliptic equations is introduced. The local scheme is based on a coarse grid and successively improves the solution solving a sequence of local elliptic problems in high gra ...

Delay-constrained streaming from a moving platform is of paramount importance for applications such as the remote control of drones, where a low-delay video stream is required in order to provide visual feedback to the pilot while providing high quality vi ...

Caching is technique that alleviates networks during peak hours by transmitting partial information before a request for any is made. We study this method in a lossy source coding setting with Gaussian databases. A good caching strategy minimizes the data ...

Secure transmission using an untrusted relay with scaled compute-and-forward

Chattez avec Graph Search

Testing Support Size More Efficiently Than Learning Histograms

Toward plasma drifts in EMC3: Implementation of gradient, divergence, and particle tracing schemes

On the Theory and Practice of Modern Secure Messaging

Sharp bounds on enstrophy growth for viscous scalar conservation laws

Distribution Inference Risks: Identifying and Mitigating Sources of Leakage

Unbiasing time-dependent Variational Monte Carlo by projected quantum evolution

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

Security in the Presence of Quantum Adversaries

Gyrokinetic simulations of turbulence and zonal flows driven by steep profile gradients using a delta-f approach with an evolving background Maxwellian

Interpretable Stability Bounds for Spectral Graph Filters

Ill-posedness of the quasilinear wave equation in the space 𝐻7/4(ln𝐻)−𝛽in ℝ2+1

Stability properties of a projector-splitting scheme for dynamical low rank approximation of random parabolic equations

A methodology to design measurement systems when multiple model classes are plausible

Feedback and Common Information: Bounds and Capacity for Gaussian Networks

Balancing management of strategic aggregators using non-cooperative game theory

Time in cryptography

Understanding and Mitigating Latency Variability of Latency-Critical Applications

A local discontinuous Galerkin gradient discretization method for linear and quasilinear elliptic equations

Cross-Packet Coding for Delay-Constrained Streaming Applications

Caching of Bivariate Gaussians with Non-Uniform Preference Probabilities