Publication

Cryptographic Administration for Secure Group Messaging

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.

Connectez-vous pour utiliser Chat avec Graph Search

High Security Pairing-Based Cryptography Revisited

Robert Granger

The security and performance of pairing based cryptography has provoked a large volume of research, in part because of the exciting new cryptographic schemes that it underpins. We re-examine how one should implement pairings over ordinary elliptic curves f ...

Springer Berlin Heidelberg2006

Secure Communications over Insecure Channels Using an Authenticated Channel

Sylvain Pasini

A secure communication over an insecure channel without any prior exchanged key can be established with the help of an authentication step to exchange a public key and then using public-key cryptography such as RSA. In this work, we concentrate on message ...

2005

Practical Cryptography in High Dimensional Tori

Robert Granger, Martijn Stam

At Crypto 2004, van Dijk and Woodruff introduced a new way of using the algebraic tori

T_n

in cryptography, and obtained an asymptotically optimal

n/\phi(n)

savings in bandwidth and storage for a number of cryptographic applications. However, the compu ...

Springer Berlin Heidelberg2005

Statistical cryptanalysis of block ciphers

Pascal Junod

Since the development of cryptology in the industrial and academic worlds in the seventies, public knowledge and expertise have grown in a tremendous way, notably because of the increasing, nowadays almost ubiquitous, presence of electronic communication m ...

EPFL2005

Secure and Privacy-Preserving Communication in Hybrid Ad Hoc Networks

Jean-Pierre Hubaux, Srdan Capkun

We present a scheme for secure and privacy-preserving communication in hybrid ad hoc networks. Our scheme enables users to secure communication and to protect their anonymity and location privacy. Our approach is based on frequently changing node pseudonym ...

2004

Location verification and key management in wireless networks

Srdan Capkun

This thesis is primarily concerned with two security mechanisms for wireless networks: location verification and key management. These mechanisms are potential building blocks in the security architectures of a range of applications. Under location verific ...

EPFL2004

SECTOR: Secure Tracking of Node Encounters in Multi-hop Wireless Networks

Jean-Pierre Hubaux, Levente Buttyan, Srdan Capkun

In this paper we present SECTOR, a set of mechanisms for the secure verification of the time of encounters between nodes in multi-hop wireless networks. This information can be used notably to prevent wormhole attacks (without requiring any clock synchroni ...

2003

High performance VLSI architectures implementing strong cryptographic primitives

Feth Allah Cherigui

The main topic of this thesis is related to the state of the art in designing cryptographic primitives from a hardware point of view. A special emphasis is dedicated to low-power/low-energy CMOS design. A set of solutions is proposed including an LFSR base ...

EPFL2002

Enforcing Service Availability in Mobile Ad-Hoc WANs

Jean-Pierre Hubaux, Levente Buttyan

In this paper, we address the problem of service availability in mobile ad-hoc WANs. We present a secure mechanism to stimulate end users to keep their devices turned on, to refrain from overloading the network, and to thwart tampering aimed at converting ...

2000