Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Message authentication

Related publications (20)

Privacy and Integrity Preserving Computations with CRISP

Jean-Pierre Hubaux, Juan Ramón Troncoso-Pastoriza, Apostolos Pyrgelis, Sylvain Chatel

In the digital era, users share their personal data with service providers to obtain some utility, e.g., access to high-quality services. Yet, the induced information flows raise privacy and integrity concerns. Consequently, cautious users may want to prot ...

USENIX ASSOC2021

Misuse Attacks on Post-quantum Cryptosystems

Serge Vaudenay, Fatma Betül Durak, Loïs Evan Huguenin-Dumittan, Abdullah Talayhan

Many post-quantum cryptosystems which have been proposed in the National Institute of Standards and Technology (NISI) standardization process follow the same meta-algorithm, but in different algebras or different encoding methods. They usually propose two ...

SPRINGER INTERNATIONAL PUBLISHING AG2019

Provably Secure Authenticated Encryption

Damian Vizár

Authenticated Encryption (AE) is a symmetric key cryptographic primitive that ensures confidentiality and authenticity of processed messages at the same time. The research of AE as a primitive in its own right started in 2000. The security goals of AE wer ...

EPFL2018

Linking Online Misuse-Resistant Authenticated Encryption and Blockwise Attack Models

Damian Vizár

Real-world applications of authenticated encryption often require the encryption to be computable online, e.g. to compute the ith block of ciphertext after having processed the first i blocks of plaintext. A significant line of research was dedicated to id ...

2017

Security of Full-State Keyed Sponge and Duplex: Applications to Authenticated Encryption

Damian Vizár, Reza Reyhanitabar

We provide a security analysis for full-state keyed Sponge and full-state Duplex constructions. Our results can be used for making a large class of Sponge-based authenticated encryption schemes more efficient by concurrent absorption of associated data and ...

Springer2015

Private Eyes: Secure Remote Biometric Authentication

Bryan Alexander Ford

We propose an efficient remote biometric authentication protocol that gives strong protection to the user’s biometric data in case of two common kinds of security breaches: (1) loss or theft of the user’s token (smart card, handheld device, etc.), giving t ...

SciTePress2015

Expected Loss Analysis for Authentication in Constrained Channels

Serge Vaudenay, Christos Dimitrakakis, Aikaterini Mitrokotsa

We derive bounds on the expected loss for authentication protocols in channels which are constrained due to noisy conditions and communication costs. This is motivated by a number of authentication protocols, where at least some part of the authentication ...

IOS Press2015

Unifying Leakage Models: From Probing Attacks to Noisy Leakage

Alexandre Raphaël Duc, Sebastian Faust

A recent trend in cryptography is to formally show the leakage resilience of cryptographic implementations in a given leakage model. One of the most prominent leakage models -- the so-called bounded leakage model -- assumes that the amount of leakage is a- ...

Springer2014

Scrambling-based tool for secure protection of JPEG images

Touradj Ebrahimi

JPEG scrambling tool is a flexible web-based tool with an intuitive and simple to use GUI and interface to secure visual information in a region of interest (ROI) of JPEG images. The tool demonstrates an efficient integration and use of security tools in J ...

2014

TOA: a tag-owner-assisting RFID authentication protocol toward access control and ownership transfer

Chao Wang, Qiang Wang, Chen Zhang

This paper addresses radio frequency identification (RFID) authentication and ownership transfer in offline scenarios. Four typical related works are reviewed in detail. A series of shortcomings and vulnerabilities of them are pointed out. A new RFID authe ...

Wiley-Blackwell2014

The complexity of robust atomic storage

Rachid Guerraoui

We study the time-complexity of robust atomic read/write storage from fault-prone storage components in asynchronous message-passing systems. Robustness here means wait-free tolerating the largest possible number t of Byzantine storage component failures ( ...

ACM Press2011

Secure communication using authenticated channels

Sylvain Pasini

Our main motivation is to design more user-friendly security protocols. Indeed, if the use of the protocol is tedious, most users will not behave correctly and, consequently, security issues occur. An example is the actual behavior of a user in front of an ...

EPFL2009

SAS-Based Group Authentication and Key Agreement Protocols

Sylvain Pasini

New trends in consumer electronics have created a strong demand for fast, reliable and user-friendly key agreement protocols. However, many key agreement protocols are secure only against passive attacks. Therefore, message authentication is often unavoida ...

Springer2008

Lucky Read/Write Access to Robust Atomic Storage

Rachid Guerraoui, Ron Levy

This paper establishes tight bounds on the \emph{best-case} time-complexity of distributed atomic read/write storage implementations that tolerate \emph{worst-case} conditions. We study asynchronous robust implementations where a writer and a set of reader ...

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

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

Jean-Pierre Hubaux, Srdan Capkun, Mario Cagalj

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

Key Agreement in Peer-to-Peer Wireless Networks

Jean-Pierre Hubaux, Srdan Capkun, Mario Cagalj

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

Face authentication based on local features and generative models

The principal objective of this thesis is to investigate approaches toward a robust automatic face authentication (AFA) system in weakly constrained environments. In this context, we develop new algorithms based on local features and generative models. In ...

EPFL2006

Secure communications over insecure channels based on short authenticated strings

Serge Vaudenay

We propose a way to establish peer-to-peer authenticated communications over an insecure channel by using an extra channel which can authenticate very short strings, e.g. 15 bits. We call this SAS-based authentication as for authentication based on short a ...

2005

Related publications (20)