Kevin Thiry-Atighehchi

CoRR, 2023

Untargeted Near-collision Attacks in Biometric Recognition.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Near-collisions and their Impact on Biometric Security (long).

[BibT_eX]

[DOI]

CoRR, 2022

Near-collisions and Their Impact on Biometric Security.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Security and Cryptography, 2022

Authentication Attacks on Projection-based Cancelable Biometric Schemes.

[BibT_eX]

[DOI]

Denis Migdal

Proceedings of the 19th International Conference on Security and Cryptography, 2022

2020

A Cryptanalysis of Two Cancelable Biometric Schemes Based on Index-of-Max Hashing.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Forensics Secur., 2020

A precise non-asymptotic complexity analysis of parallel hash functions without tree topology constraints.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2020

Proof of Behavior (Short Paper).

[BibT_eX]

[DOI]

Ariane Tichit

Proceedings of the 2nd International Conference on Blockchain Economics, 2020

2019

GREYC-Hashing: Combining biometrics and secret for enhancing the security of protected templates.

[BibT_eX]

[DOI]

Loubna Ghammam

Morgan Barbier

Christophe Rosenberger

Future Gener. Comput. Syst., 2019

2018

Signature Renewal for Low Entropy Data.

[BibT_eX]

[DOI]

Morgan Barbier

Proceedings of the 17th IEEE International Conference On Trust, 2018

On the Incremental Digital Signatures.

[BibT_eX]

[DOI]

Proceedings of the 17th IEEE International Conference On Trust, 2018

2017

Asymptotic Analysis of Plausible Tree Hash Modes for SHA-3.

[BibT_eX]

[DOI]

IACR Trans. Symmetric Cryptol., 2017

Optimization of Tree Modes for Parallel Hash Functions: A Case Study.

[BibT_eX]

[DOI]

Robert Rolland

IEEE Trans. Computers, 2017

Arithmetic in finite fields based on the Chudnovsky-Chudnovsky multiplication algorithm.

[BibT_eX]

[DOI]

Math. Comput., 2017

2016

On Plausible Tree Hash Modes for SHA-3.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Some observations on the optimization of a parallel SHAKE function using Sakura.

[BibT_eX]

[DOI]

CoRR, 2016

Optimal Tree Hash Modes: the Case of Trees Having their Leaves at All the Levels.

[BibT_eX]

[DOI]

CoRR, 2016

Note on Optimal Trees for Parallel Hash Functions.

[BibT_eX]

[DOI]

CoRR, 2016

2015

Optimization of Tree Modes for Parallel Hash Functions.

[BibT_eX]

[DOI]

Robert Rolland

CoRR, 2015

On Chudnovsky-Based Arithmetic Algorithms in Finite Fields.

[BibT_eX]

[DOI]

CoRR, 2015

New models for efficient authenticated dictionaries.

[BibT_eX]

[DOI]

Gabriel Risterucci

Comput. Secur., 2015

2014

Space-efficient, byte-wise incremental and perfectly private encryption schemes.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

On the Incremental Asymmetric Signatures.

[BibT_eX]

[DOI]

CoRR, 2014

Authenticated Dictionary Based on Frequency.

[BibT_eX]

[DOI]

Traian Muntean

Proceedings of the ICT Systems Security and Privacy Protection, 2014

2013

Generic Parallel Cryptography for Hashing Schemes.

[BibT_eX]

[DOI]

Traian Muntean

Proceedings of the IEEE 12th International Symposium on Parallel and Distributed Computing, 2013

Towards fully incremental cryptographic schemes.

[BibT_eX]

[DOI]