Rapidly verifiable aggregate signatures

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; verifying the payload signatures to determine whether or not the payloads are correctly signed; bundling correctly signed payloads into a batch; obtaining a batch digest, and proofs of inclusion of the payloads in the batch; sending second data packages comprising the batch digest and a respective proof of inclusion to the signers, the respective proof of inclusion proving that the payload of the respective signer is included in the batch; receiving third data packages from the signers, each third data package comprising the signer identifier, and a respective batch digest signature; verifying the batch digest signatures to determine whether or not the batch digests are correctly signed; aggregating correctly signed batch digest signatures to obtain an aggregated batch digest signature; and including the aggregated batch digest signature in the batch. The payload and batch digest signatures may be obtained by using different secret keys of the respective signer.

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

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

Abstract

Official source

https://infoscience.epfl.ch/record/310043?ln=en

About this result

Related concepts (20)

Related publications (33)

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

Public-Key Encryption with Quantum Keys

Khashayar Barooti

In the framework of Impagliazzo's five worlds, a distinction is often made between two worlds, one where public-key encryption exists (Cryptomania), and one in which only one-way functions exist (MiniCrypt). However, the boundaries between these worlds can ...

Cham2023

Tunable biocomposite films fabricated using cellulose nanocrystals and additives for food packaging

Wenjing Sun, Cong Chen

Cellulose nanocrystals (CNCs) are considered a prospective packaging material to partially replace petroleumbased plastics attributed to their renewability, sustainability, biodegradability, and desirable attributes including transparency, oxygen, and oil ...

ELSEVIER SCI LTD2023

Key (cryptography)

A key in cryptography is a piece of information, usually a string of numbers or letters that are stored in a file, which, when processed through a cryptographic algorithm, can encode or decode cryptographic data. Based on the used method, the key can be different sizes and varieties, but in all cases, the strength of the encryption relies on the security of the key being maintained. A key's security strength is dependent on its algorithm, the size of the key, the generation of the key, and the process of key exchange.

Public-key cryptography

Public-key cryptography, or asymmetric cryptography, is the field of cryptographic systems that use pairs of related keys. Each key pair consists of a public key and a corresponding private key. Key pairs are generated with cryptographic algorithms based on mathematical problems termed one-way functions. Security of public-key cryptography depends on keeping the private key secret; the public key can be openly distributed without compromising security.

Symmetric-key algorithm

Symmetric-key algorithms are algorithms for cryptography that use the same cryptographic keys for both the encryption of plaintext and the decryption of ciphertext. The keys may be identical, or there may be a simple transformation to go between the two keys. The keys, in practice, represent a shared secret between two or more parties that can be used to maintain a private information link. The requirement that both parties have access to the secret key is one of the main drawbacks of symmetric-key encryption, in comparison to public-key encryption (also known as asymmetric-key encryption).