Concept

Key-agreement protocol

Publications associées (181)

Optimal Proximity Proofs

Provably secure distance-bounding is a rising subject, yet an unsettled one; indeed, very few distance-bounding protocols, with formal security proofs, have been proposed. In fact, so far only two protocols, namely SKI (by Boureanu et al.) and FO (by Fisch ...

Springer2015

Efficient Ephemeral Elliptic Curve Cryptographic Keys

Arjen Lenstra, Andrea Miele

We show how any pair of authenticated users can on-the-fly agree on an elliptic curve group that is unique to their communication session, unpredictable to outside observers, and secure against known attacks. Our proposal is suitable for deployment on cons ...

Springer-Verlag Berlin2015

How colloid-colloid interactions and hydrodynamic effects influence the percolation threshold: A simulation study in alumina suspensions

Paul Bowen

The percolation behavior of alumina suspensions is studied by computer simulations. The percolation threshold phi(c), is calculated, determining the key factors that affect its magnitude: the strength of colloid-colloid attraction and the presence of hydro ...

Elsevier2015

An FPGA-Based 4 Mbps Secret Key Distillation Engine for Quantum Key Distribution Systems

Andreas Peter Burg, Jeremy Hugues-Felix Constantin, Nicholas Alexander Preyss, Pascal Junod

Quantum key distribution (QKD) enables provably secure communication between two parties over an optical ber that arguably withstands any form of attack. Besides the need for a suitable physical signalling scheme and the corresponding devices, QKD also req ...

Springer Verlag2015

Sensitive THM coupled analysis of buffer-rock barriers for nuclear waste storage

Lyesse Laloui, Alessio Ferrari, Yafei Qiao

The buffer-rock barriers system is widely proved to be one of the most promising options for isolating high-level radioactive waste from the human environment. To certify the efficiency and provide the additional development regarding design and assessment ...

Crc Press-Taylor & Francis Group2015

Seeking Anonymity in an Internet Panopticon

Bryan Alexander Ford

Internet, users often need to assume, by default, that their every statement or action online is monitored and tracked. The Dissent project at Yale University takes a collective approach to online anonymity, based on different algorithmic foundations from ...

Assoc Computing Machinery2015

Nanoindentation of Functionally Graded Polymer Nanocomposites: Assessment of the Strengthening Parameters through Experiments and Modeling

Yves Leterrier, Ayat Karimi, Tommaso Nardi

Nanoindentation tests were carried out on the surface of polymer nanocomposites exhibiting either graded or homogeneous distributions of Fe3O4@silica core-shell nanoparticles in a photocurable polymeric matrix. The results reveal a complex interplay betwee ...

2015

Compact and Efficient UC Commitments under Atomic-Exchanges

Serge Vaudenay

We devise a multiple (concurrent) commitment scheme operating on large messages. It uses an ideal global setup functionality in a minimalistic way. The commitment phase is non-interactive. It is presented in a modular way so that the internal building bloc ...

2014

Triangle Network Secrecy

Christina Fragouli, Suhas Diggavi, László Czap, Vinod Malathidevi Prabhakaran

We characterize the secret message capacity of the triangle network, that consists of a source, a relay and a destination connected through orthogonal erasure channels. A passive eavesdropper, Eve, wiretaps any one of the three channels. The source and the ...

2014

Triangle Network Secrecy

Christina Fragouli, Suhas Diggavi, László Czap, Vinod Malathidevi Prabhakaran

Ieee2014

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.

Connectez-vous pour utiliser Chat avec Graph Search