Concept

Secret partagé

Publications associées (67)

Rapidly verifiable aggregate signatures

Rachid Guerraoui, Manuel José Ribeiro Vidigueira, Gauthier Jérôme Timothée Voron, Martina Camaioni, Matteo Monti, Pierre-Louis Blaise Roman

A method for aggregating digital signatures comprises the following steps carried out by a signature aggregator: receiving first data packages from signers, each first data package comprising a signer identifier, a payload, and a payload signature; verifyi ...

2024

Secure and Efficient Cryptographic Algorithms in a Quantum World

Loïs Evan Huguenin-Dumittan

Since the advent of internet and mass communication, two public-key cryptographic algorithms have shared the monopoly of data encryption and authentication: Diffie-Hellman and RSA. However, in the last few years, progress made in quantum physics -- and mor ...

EPFL2024

Differentially private multi-agent constraint optimization

Boi Faltings, Sujit Prakash Gujar, Aleksei Triastcyn, Sankarshan Damle

Distributed constraint optimization (DCOP) is a framework in which multiple agents with private constraints (or preferences) cooperate to achieve a common goal optimally. DCOPs are applicable in several multi-agent coordination/allocation problems, such as ...

Dordrecht2024

Making Classical (Threshold) Signatures Post-quantum for Single Use on a Public Ledger

Serge Vaudenay, Laurane Chloé Angélina Marco, Abdullah Talayhan

The Bitcoin architecture heavily relies on the ECDSA signature scheme which is broken by quantum adversaries as the secret key can be computed from the public key in quantum polynomial time. To mitigate this attack, bitcoins can be paid to the hash of a pu ...

2023

Lattice-Based Blind Signatures: Short, Efficient, and Round-Optimal

Ngoc Khanh Karol Nguyen

We propose a 2-round blind signature protocol based on the random oracle heuristic and the hardness of standard lattice problems (Ring/Module-SIS/LWE and NTRU) with a signature size of 22 KB. The protocol is round-optimal and has a transcript size that can ...

New York2023

Optimal Symmetric Ratcheting for Secure Communication

Serge Vaudenay, Andrea Felice Caforio, Daniel Patrick Collins, Hailun Yan

To mitigate state exposure threats to long-lived instant messaging sessions, ratcheting was introduced, which is used in practice in protocols like Signal. However, existing ratcheting protocols generally come with a high cost. Recently, Caforio et al. pro ...

OXFORD UNIV PRESS2022

Secret Key Generation Over Wireless Channels Using Short Blocklength Multilevel Source Polar Coding

Yanina Yurina Shkel

This paper investigates the problem of secret key generation from correlated Gaussian random variables in the short block-length regime. Inspired by the state-of-the-art performance provided by polar codes in the short blocklength regime for channel coding ...

IEEE2021

Atom: A Stream Cipher with Double Key Filter

Andrea Felice Caforio, Subhadeep Banik, Willi Meier

It has been common knowledge that for a stream cipher to be secure against generic TMD tradeoff attacks, the size of its internal state in bits needs to be at least twice the size of the length of its secret key. In FSE 2015, Armknecht and Mikhalev however ...

2021

On Polar Coding For Finite Blocklength Secret Key Generation Over Wireless Channels

Yanina Yurina Shkel

We consider the problem of secret key generation from correlated Gaussian random variables in the finite blocklength regime. Such keys could be used to encrypt communication in IoT networks, and have provable secrecy guarantees in contrast to classic crypt ...

IEEE2020

Classical Misuse Attacks on NIST Round 2 PQC: The Power of Rank-Based Schemes

Serge Vaudenay, Loïs Evan Huguenin-Dumittan

The US National Institute of Standards and Technology (NIST) recently announced the public-key cryptosystems (PKC) that have passed to the second round of the post-quantum standardization process. Most of these PKC come in two flavours: a weak IND-CPA vers ...

Springer, Cham2020

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