Benoit Cogliati

Orcid: 0000-0001-6445-2514

Affiliations:
  • CISPA Helmholtz Center for Information Security, Saarbrücken, Germany
  • University of Luxembourg (former)


According to our database1, Benoit Cogliati authored at least 31 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Uncompressing Dilithium's public key.
IACR Cryptol. ePrint Arch., 2024

State of the art of HFE variants Is it possible to repair HFE with appropriate perturbations?
IACR Cryptol. ePrint Arch., 2024

New Security Proofs and Techniques for Hash-and-Sign with Retry Signature Schemes.
IACR Cryptol. ePrint Arch., 2024

On the Number of Restricted Solutions to Constrained Systems and their Applications.
IACR Cryptol. ePrint Arch., 2024

Classical and Quantum Generic Attacks on 6-round Feistel Schemes.
IACR Cryptol. ePrint Arch., 2024

Mind the Bad Norms: Revisiting Compressed Oracle-based Quantum Indistinguishability Proofs.
IACR Cryptol. ePrint Arch., 2024

A Long Tweak Goes a Long Way: High Multi-user Security Authenticated Encryption from Tweakable Block Ciphers.
IACR Commun. Cryptol., 2024

State of the Art of HFE Variants - Is It Possible to Repair HFE with Appropriate Modifiers?
Proceedings of the Post-Quantum Cryptography - 15th International Workshop, 2024

2023
On Large Tweaks in Tweakable Even-Mansour with Linear Tweak and Key Mixing.
IACR Trans. Symmetric Cryptol., 2023

Subverting Telegram's End-to-End Encryption.
IACR Trans. Symmetric Cryptol., 2023

Rectangular Attack on VOX.
IACR Cryptol. ePrint Arch., 2023

On Quantum Secure Compressing Pseudorandom Functions.
IACR Cryptol. ePrint Arch., 2023

Proof of Mirror Theory for a Wide Range of $\xi _{\max }$.
Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

2022
Proof of Mirror Theory for any $\xi_{\max}$.
IACR Cryptol. ePrint Arch., 2022

Masked Iterate-Fork-Iterate: A new Design Paradigm for Tweakable Expanding Pseudorandom Function.
IACR Cryptol. ePrint Arch., 2022

2021
CTET+: A Beyond-Birthday-Bound Secure Tweakable Enciphering Scheme Using a Single Pseudorandom Permutation.
IACR Trans. Symmetric Cryptol., 2021

2020
Mirror Theory: A simple proof of the Pi+Pj Theorem with xi_max=2.
IACR Cryptol. ePrint Arch., 2020

How to Build Optimally Secure PRFs Using Block Ciphers.
IACR Cryptol. ePrint Arch., 2020

2019
Multi-user security bound for filter permutators in the random oracle model.
Des. Codes Cryptogr., 2019

2018
Wide Tweakable Block Ciphers Based on Substitution-Permutation Networks: Security Beyond the Birthday Bound.
IACR Cryptol. ePrint Arch., 2018

Analysis of the single-permutation encrypted Davies-Meyer construction.
Des. Codes Cryptogr., 2018

Tweaking a block cipher: multi-user beyond-birthday-bound security in the standard model.
Des. Codes Cryptogr., 2018

Provable Security of (Tweakable) Block Ciphers Based on Substitution-Permutation Networks.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

2017
New Constructions of MACs from (Tweakable) Block Ciphers.
IACR Trans. Symmetric Cryptol., 2017

2016
EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC.
IACR Cryptol. ePrint Arch., 2016

Strengthening the Known-Key Security Notion for Block Ciphers.
IACR Cryptol. ePrint Arch., 2016

2015
Beyond-Birthday-Bound Security for Tweakable Even-Mansour Ciphers with Linear Tweak and Key Mixing.
IACR Cryptol. ePrint Arch., 2015

On the Provable Security of the Iterated Even-Mansour Cipher against Related-Key and Chosen-Key Attacks.
IACR Cryptol. ePrint Arch., 2015

Tweaking Even-Mansour Ciphers.
IACR Cryptol. ePrint Arch., 2015

2014
Security Amplification for the Composition of Block Ciphers: Simpler Proofs and New Results.
Proceedings of the Selected Areas in Cryptography - SAC 2014, 2014

The Indistinguishability of the XOR of k Permutations.
Proceedings of the Fast Software Encryption - 21st International Workshop, 2014


  Loading...