Publications associées à Hash-and-Sign with Weak Hashing Made Secure

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.

A Tight Lower Bound for Entropy Flattening

Mika Tapani Göös, Jiapeng Zhang

We study entropy flattening: Given a circuit C_X implicitly describing an n-bit source X (namely, X is the output of C_X on a uniform random input), construct another circuit C_Y describing a source Y such that (1) source Y is nearly flat (uniform on its s ...

Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany2018

Improving Stateless Hash-Based Signatures

Jean-Philippe Aumasson

present several optimizations to SPHINCS, a stateless hash-based signature scheme proposed by Bernstein et al. in (2015): PORS, a more secure variant of the HORS few-time signature scheme used in SPHINCS; secret key caching, to speed-up signing and reduce ...

SPRINGER INTERNATIONAL PUBLISHING AG2018

Clever Arbiters Versus Malicious Adversaries

Serge Vaudenay

When moving from known-input security to chosen-input security, some generic attacks sometimes become possible and must be discarded by a specific set of rules in the threat model. Similarly, common practices consist of fixing security systems, once an exp ...

Springer Berlin Heidelberg2016

Boosting OMD for Almost Free Authentication of Associated Data

Serge Vaudenay, Damian Vizár, Reza Reyhanitabar

We propose pure OMD (p-OMD) as a new variant of the Offset Merkle-Damgård (OMD) authenticated encryption scheme. Our new scheme inherits all desirable security features of OMD while having a more compact structure and providing higher efficiency. The origi ...

Springer2015

Learning Image Descriptors with Boosting

Vincent Lepetit, Tomasz Piotr Trzcinski, Christos Marios Christoudias

We propose a novel and general framework to learn compact but highly discriminative floating-point and binary local feature descriptors. By leveraging the boosting-trick we first show how to efficiently train a compact floating-point descriptor that is ver ...

Institute of Electrical and Electronics Engineers2015

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

OMD: A Compression Function Mode of Operation for Authenticated Encryption

Serge Vaudenay, Damian Vizár, Reza Reyhanitabar

We propose the Offset Merkle-Damgård (OMD) scheme, a mode of operation to use a compression function for building a nonce-based authenticated encryption with associated data. In OMD, the parts responsible for privacy and authenticity are tightly coupled to ...

Springer International Publishing2014

Boosting Binary Keypoint Descriptors

Pascal Fua, Vincent Lepetit, Tomasz Piotr Trzcinski, Christos Marios Christoudias

Binary keypoint descriptors provide an efficient alternative to their floating-point competitors as they enable faster processing while requiring less memory. In this paper, we propose a novel framework to learn an extremely compact binary descriptor we ca ...

2013

Hash-and-Sign with Weak Hashing Made Secure

Graph Chatbot

Chattez avec Graph Search

A Tight Lower Bound for Entropy Flattening

Improving Stateless Hash-Based Signatures

Hardware Attacks against Hash-based Cryptographic Algorithms

Clever Arbiters Versus Malicious Adversaries

Boosting OMD for Almost Free Authentication of Associated Data

Learning Image Descriptors with Boosting

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

Secure Communication in Erasure Networks with State-feedback

OMD: A Compression Function Mode of Operation for Authenticated Encryption

Boosting Binary Keypoint Descriptors

A Tight Lower Bound for Entropy Flattening

Clever Arbiters Versus Malicious Adversaries

Secure Communication in Erasure Networks with State-feedback

Improving Stateless Hash-Based Signatures

Hardware Attacks against Hash-based Cryptographic Algorithms

Boosting Binary Keypoint Descriptors

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

Learning Image Descriptors with Boosting

Boosting OMD for Almost Free Authentication of Associated Data

OMD: A Compression Function Mode of Operation for Authenticated Encryption