Publications associées à Remplissage (cryptographie)

Cryptographic Administration for Secure Group Messaging

Many real-world group messaging systems delegate group administration to the application level, failing to provide formal guarantees related to group membership. Taking a cryptographic approach to group administration can prevent both implementation and pr ...

2023

Near Collision Attack Against Grain V1

Daniel Patrick Collins, Subhadeep Banik, Willi Meier

A near collision attack against the Grain v1 stream cipher was proposed by Zhang et al. in Eurocrypt 18. The attack uses the fact that two internal states of the stream cipher with very low hamming distance between them, produce similar keystream sequences ...

2023

Cryptanalysis of LowMC instances using single plaintext/ciphertext pair

Serge Vaudenay, Subhadeep Banik, Fatma Betül Durak, Khashayar Barooti

Arguably one of the main applications of the LowMC family ciphers is in the post-quantum signature scheme PICNIC. Although LowMC family ciphers have been studied from a cryptanalytic point of view before, none of these studies were directly concerned with ...

RUHR-UNIV BOCHUM, HORST GORTZ INST IT-SICHERHEIT2020

EVA: An Encrypted Vector Arithmetic Language and Compiler for Efficient Homomorphic Computation

Blagovesta Hristova Kostova, Wei Dai

Fully-Homomorphic Encryption (FHE) offers powerful capabilities by enabling secure offloading of both storage and computation, and recent innovations in schemes and implementations have made it all the more attractive. At the same time, FHE is notoriously ...

ASSOC COMPUTING MACHINERY2020

Reducing Metadata Leakage from Encrypted Files and Communication with PURBs

Jean-Pierre Hubaux, Bryan Alexander Ford, Ludovic Barman, Kirill Nikitin, Wouter Lueks, Matthew Joshua Underwood

Most encrypted data formats leak metadata via their plaintext headers, such as format version, encryption schemes used, number of recipients who can decrypt the data, and even the recipients’ identities. This leakage can pose security and privacy risks to ...

Sciendo2019

Arithmetic and geometric structures in cryptography

Benjamin Pierre Charles Wesolowski

We explore a few algebraic and geometric structures, through certain questions posed by modern cryptography. We focus on the cases of discrete logarithms in finite fields of small characteristic, the structure of isogeny graphs of ordinary abelian varietie ...

EPFL2018

PriFi: A Low-Latency and Tracking-Resistant Protocol for Local-Area Anonymous Communication

Jean-Pierre Hubaux, Bryan Alexander Ford, Mahdi Zamani, Italo Ivan Dacosta Petrocelli, Ludovic Barman

Popular anonymity mechanisms such as Tor provide low communication latency but are vulnerable to traffic analysis attacks that can de-anonymize users. Moreover, known traffic-analysis-resistant techniques such as Dissent are impractical for use in latency- ...

ACM2016

Efficient Ephemeral Elliptic Curve Cryptographic Keys

Arjen Lenstra, Andrea Miele

We show how any pair of authenticated users can on-the-fly agree on an elliptic curve group that is unique to their communication session, unpredictable to outside observers, and secure against known attacks. Our proposal is suitable for deployment on cons ...

Springer-Verlag Berlin2015

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.

Remplissage (cryptographie)

Cryptographic Administration for Secure Group Messaging

Near Collision Attack Against Grain V1

Security in the Presence of Quantum Adversaries

Multiquadratic Rings and Walsh-Hadamard Transforms for Oblivious Linear Function Evaluation

Cryptanalysis of LowMC instances using single plaintext/ciphertext pair

EVA: An Encrypted Vector Arithmetic Language and Compiler for Efficient Homomorphic Computation

Reducing Metadata Leakage from Encrypted Files and Communication with PURBs

Arithmetic and geometric structures in cryptography

PriFi: A Low-Latency and Tracking-Resistant Protocol for Local-Area Anonymous Communication

Efficient Ephemeral Elliptic Curve Cryptographic Keys

Graph Chatbot

Chattez avec Graph Search

Arithmetic and geometric structures in cryptography

PriFi: A Low-Latency and Tracking-Resistant Protocol for Local-Area Anonymous Communication

Multiquadratic Rings and Walsh-Hadamard Transforms for Oblivious Linear Function Evaluation

Near Collision Attack Against Grain V1

Cryptanalysis of LowMC instances using single plaintext/ciphertext pair

Security in the Presence of Quantum Adversaries

EVA: An Encrypted Vector Arithmetic Language and Compiler for Efficient Homomorphic Computation

Reducing Metadata Leakage from Encrypted Files and Communication with PURBs

Efficient Ephemeral Elliptic Curve Cryptographic Keys