Concept

Code d'authentification de message

Publications associées (84)

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

Secure Data Communication in Mobile Ad Hoc Networks

Panagiotis Papadimitratos

We address the problem of secure and fault-tolerant communication in the presence of adversaries across a multihop wireless network with frequently changing topology. To effectively cope with arbitrary malicious disruption of data transmissions, we propose ...

2006

Authentication with built-in encryption by using moire intensity profiles between random layers

Isaac Amidror

This invention discloses new methods, security devices and apparatuses for authenticating documents and valuable articles which may be applied to any support, including transparent synthetic materials and traditional opaque materials such as paper. The inv ...

2006

Integrity (I) codes: Message Integrity Protection and Authentication over Insecure Channels

Jean-Pierre Hubaux, Mario Cagalj, Srdan Capkun

Inspired by unidirectional error detecting codes that are used in situations where only one kind of bit errors are possible (e.g., it is possible to change a bit “0” into a bit “1”, but not the contrary), we propose integrity codes (I-codes) for a radio co ...

2006

Model-based synthesis of band moire images for authenticating security documents and valuable products

Roger Hersch, Sylvain Chosson

The present invention relies on a band moiré image layout model capable of predicting the band moiré image layer layout produced when superposing a base band grating layer of a given layout and revealing line grating layer of a given layout. Both the base ...

2006

SAS-based Authenticated Key Agreement

Serge Vaudenay, Sylvain Pasini

Key agreement protocols are frequently based on the Diffie-Hellman protocol but require authenticating the protocol messages in two ways. This can be made by a cross-authentication protocol. Such protocols, based on the assumption that a channel which can ...

Springer2006

Toward a secure JPEG

Touradj Ebrahimi, Frédéric Dufaux

In this paper, we propose a Secure JPEG, an open and flexible standardized framework to secure JPEG images. Its goal is to allow the efficient integration and use of security tools enabling a variety of security services such as confidentiality, integrity ...

2006

Method to Filter Electronic Messages in A Message Processing System

Jean-Yves Le Boudec, Slavisa Sarafijanovic

The present invention proposes a method to filter electronic messages in a message processing system, this message processing system comprising a temporary memory for storing the received messages intended to users, a first database dedicated to a specific ...

2006

Short undeniable signatures

Jean Monnerat

Digital signatures are one of the main achievements of public-key cryptography and constitute a fundamental tool to ensure data authentication. Although their universal verifiability has the advantage to facilitate their verification by the recipient, this ...

EPFL2006

Key Agreement in Peer-to-Peer Wireless Networks

Jean-Pierre Hubaux, Mario Cagalj, Srdan Capkun

We present a set of simple techniques for key establishment over a radio link in peer-to-peer networks. Our approach is based on the Diffie-Hellman key agreement protocol, which is known to be vulnerable to the ``man-in-the-middle" attack if the two users ...

2006

Noisy Tags: A Pretty Good Key Exchange Protocol for RFID Tags

Gildas Avoine

We propose a protocol that can be used between an RFID tag and a reader to exchange a secret without performing any expensive computation. Similarly to the famous blocker tag suggested by Juels, Rivest, and Szydlo, our scheme makes use of special tags that ...

2006