A Formal Analysis of Syverson`s Rational Exchange Protocol
Publications associées (46)
Graph Chatbot
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.
The advent of software network functions calls for stronger correctness guarantees and higher performance at every level of the stack. Current network stacks trade simplicity for performance and flexibility, especially in their driver model. We show that p ...
We present an improved analysis of the Euler-Maruyama discretization of the Langevin diffusion. Our analysis does not require global contractivity, and yields polynomial dependence on the time horizon. Compared to existing approaches, we make an additional ...
The Block Research Group (BRG) at ETH Zurich and the Laboratory for Timber Constructions (IBOIS) gave a collaborative workshop on the Finite Element (FE) analysis using the COMPAS package. ...
We show that the finite time type II blow up solutions for the energy critical nonlinear wave equation [ \Box u = -u^5 ] on R3+1 constructed in \cite{KST}, \cite{KS1} are stable along a co-dimension one Lipschitz manifold of data perturbations in a ...
Technology downscaling is expected to amplify a variety of reliability concerns in future digital systems. A good understanding of reliability threats is crucial for the creation of efficient mitigation techniques. This survey performs a systematic classif ...
In principle, knowledge of watch and clock escapements is acquired through the study of the geometry and operation of numerous realizations, studied patiently one after the other. Knowing the classics, one can hope to construct a new realizations by borrow ...
While type soundness proofs are taught in every graduate PL class, the gap between realistic languages and what is accessible to formal proofs is large. In the case of Scala, it has been shown that its formal model, the Dependent Object Types (DOT) calculu ...
Dissection puzzles require assembling a common set of pieces into multiple distinct forms. Existing works focus on creating 2D dissection puzzles that form primitive or naturalistic shapes. Unlike 2D dissection puzzles that could be supported on a tabletop ...
The main contribution of this work is a formal model of hygienic name resolution and macro system that is flexible enough to provide missing safety to quasiquotes. This makes it possible to combine the best of two worlds: we get reasonable safety guarantee ...