Sound Proof of Proximity of Knowledge

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.

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

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

The Supersingular Isogeny Diffie-Hellman (SIDH) protocol has been the main and most efficient isogeny-based encryption protocol, until a series of breakthroughs led to a polynomial-time key-recovery attack. While some countermeasures have been proposed, th ...

Data-driven schemes that associate molecular and crystal structures with their microscopic properties share the need for a concise, effective description of the arrangement of their atomic constituents. Many types of models rely on descriptions of atom-cen ...

Interactive oracle proofs (IOPs) are a multi-round generalization of probabilistically checkable proofs that play a fundamental role in the construction of efficient cryptographic proofs. ...

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

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

Reliable broadcast is a communication primitive guaranteeing, intuitively, that all processes in a distributed system deliver the same set of messages. The reason why this primitive is appealing is twofold: (i) we can implement it deterministically in a co ...

This paper introduces a new approach to reduce end-to-end costs in large-scale replicated systems built under a Byzantine fault model. Specifically, our approach transforms a given replicated state machine (RSM) to another RSM where nodes incur lower costs ...

Currently, schemes based on seminal empirical knowledge about energy piles subjected to mechanical and thermal loads are available to describe the response of such foundations. However, schemes based on theoretical principles may more closely reflect the p ...

This paper proposes a set of distributed real-time optimisation schemes for the steady-state optimisation of parametrically and structurally uncertain systems that are composed of multiple interconnected subsystems. These schemes are derived in the framewo ...

Single-photon avalanche diode (SPAD) imagers can perform fast time-resolved imaging in a compact form factor, by exploiting the processing capability and speed of integrated CMOS electronics. Developments in SPAD imagers have recently made them compatible ...

A contactless payment lets a card holder execute payment without any interaction (e.g., entering PIN or signing) between the terminal and the card holder. Even though the security is the first priority in a payment system, the formal security model of cont ...

In our daily lives, people or devices frequently need to learn their location for many reasons as some services depend on the absolute location or the proximity. The outcomes of positioning systems can have critical effects e.g., on military, emergency. Th ...

Fully homomorphic encryption (FHE) has been among the most popular research topics of the last decade. While the bootstrapping-based, public key cryptosystems that follow Gentry's original design are getting more and more efficient, their performance is st ...

Solving hyperbolic conservation laws on general grids can be important to reduce the computational complexity and increase accuracy in many applications. However, the use of non-uniform grids can introduce challenges when using high-order methods. We propo ...

We provide an exact deterministic reformulation for data-driven chance constrained programs over Wasserstein balls. For individual chance constraints as well as joint chance constraints with right-hand side uncertainty, our reformulation amounts to a mixed ...

The purpose of the roadmap proposed by IRGC is to recommend a structured process that organisations can follow in their transition towards the development of precision medicine. The process is adaptable, and each organisation should further develop it to a ...

High-order methods inspired by the multi-step Adams methods are proposed for systems of fractional differential equations. The schemes are based on an expansion in a weighted space. To obtain the schemes this expansion is terminated after terms. We study t ...

Sound Proof of Proximity of Knowledge

Chattez avec Graph Search

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

Unbiasing time-dependent Variational Monte Carlo by projected quantum evolution

New SIDH Countermeasures for a More Efficient Key Exchange

Unified theory of atom-centered representations and message-passing machine-learning schemes

Zero-Knowledge IOPs with Linear-Time Prover and Polylogarithmic-Time Verifier

Towards Efficient LPN-Based Symmetric Encryption

Impacts of Metering-Based Dynamic Priority Schemes

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

Dynamic Byzantine Reliable Broadcast

Replicated state machines without replicated execution

Thermo-mechanical schemes for energy piles

Distributed modifier-adaptation schemes for the real-time optimisation of uncertain interconnected systems

Phasor-based widefield FLIM using a gated 512×512 single-photon SPAD imager

Secure Contactless Payment

Implications of Position in Cryptography

Cryptanalysis of Enhanced MORE

RBF Based CWENO Method

Data-Driven Chance Constrained Programs over Wasserstein Balls

A roadmap for the development of precision medicine

High-Order Accurate Local Schemes for Fractional Differential Equations