Concept

Key-agreement protocol

Publications associées (181)

Secure Device Authentication Mechanisms for the Smart Grid-Enabled Home Area Networks

In this paper, we propose secure and intuitive device authentication techniques for the Smart Grid enabled Home Area Networks (HANs). We assume a distributed architecture for the HAN in which the smart appliances can communicate both with the smart meter a ...

2013

HILBERT TRANSFORM RELATIONS IN FREQUENCY-DOMAIN OPTICAL-COHERENCE TOMOGRAPHIC IMAGING

Theo Lasser, Chandra Sekhar Seelamantula

Interferometric imaging techniques typically embed the object phase information in the magnitude during the measurement process. During reconstruction, the phase is recovered from the magnitude by certain approximations on the measured magnitude and underl ...

2013

Ron was wrong, Whit is right

Arjen Lenstra, Joppe Willem Bos, Thorsten Kleinjung, Maxime Augier, Christophe Wachter

We performed a sanity check of public keys collected on the web. Our main goal was to test the validity of the assumption that different random choices are made each time keys are generated. We found that the vast majority of public keys work as intended. ...

IACR2012

Robert Maillart's Key Methods From the Salginatobel Bridge Design Process (1928)

Corentin Jean Dominique Fivet

This paper sheds light on some of the graphical methods used by Robert Maillart to design the Salginatobel Bridge, a three-hinged concrete structure spanning 90 meters. Built in 1929, this masterpiece has since received extensive recognition both for its s ...

2012

Statistical and Algebraic Cryptanalysis of Lightweight and Ultra-Lightweight Symmetric Primitives

Pouyan Sepehrdad

Symmetric cryptographic primitives such as block and stream ciphers are the building blocks in many cryptographic protocols. Having such blocks which provide provable security against various types of attacks is often hard. On the other hand, if possible, ...

EPFL2012

Multi-terminal Secrecy in a Linear Non-coherent Packetized Networks

Christina Fragouli, Mahdi Jafari Siavoshani

We consider a group of m+1 trusted nodes that aim to create a shared secret key K over a network in the presence of a passive eavesdropper, Eve. We assume a linear non-coherent network coding broadcast channel (over a finite field F_q ) from one of the hon ...

2012

Multi-terminal Secrecy in a Linear Non-coherent Packetized Networks

Christina Fragouli, Mahdi Jafari Siavoshani

2012

Creating Shared Secrets out of Thin Air

Christina Fragouli, Suhas Diggavi, Iris Safaka

Current security systems typically rely on the adversary's computational limitations (e.g., the fact that it cannot invert a hash function or perform large-integer factorization). Wireless networks offer the opportunity for a different, complementary kind ...

Assoc Computing Machinery2012

Technology and cities: What type of development is appropriate for cities in the South

Jean-Claude Bolay, Abigaïl-Laure Sarah Irène Kern

This paper deals with technologies, catalysts for change, and their links to development. Indeed, particularly for developing and emerging countries, scientific and technological breakthroughs create wonderful opportunities, but they may also convey risks ...

Editorial Milenio2012

Freeze granulation: Powder processing for transparent alumina applications

Paul Bowen, Michael Stuer, Zhe Zhao

Use of freeze granulated powders is successfully used as an industrially viable alternative to loose powder sintering for transparent polycrystalline alumina (PCA). Freeze granulation with narrow granule size distribution was realized after suspension cond ...

2012

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