Rafaël Del Pino

According to our database1, Rafaël Del Pino authored at least 19 papers between 2016 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Simple and Efficient Lattice Threshold Signatures with Identifiable Aborts.
IACR Cryptol. ePrint Arch., 2025

Threshold Signatures Reloaded: ML-DSA and Enhanced Raccoon with Identifiable Aborts.
IACR Cryptol. ePrint Arch., 2025

Finally! A Compact Lattice-Based Threshold Signature.
Proceedings of the Public-Key Cryptography - PKC 2025, 2025

Unmasking TRaccoon: A Lattice-Based Threshold Signature with An Efficient Identifiable Abort Protocol.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

Poster: Efficient Threshold ML-DSA up to 6 Parties.
Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security, 2025

2024
Threshold Raccoon: Practical Threshold Signatures from Standard Lattice Assumptions.
Proceedings of the Advances in Cryptology - EUROCRYPT 2024, 2024

Raccoon: A Masking-Friendly Signature Proven in the Probing Model.
Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

2023
High-Order Masking of Lattice Signatures in Quasilinear Time.
Proceedings of the 44th IEEE Symposium on Security and Privacy, 2023

2022
A New Framework for More Efficient Round-Optimal Lattice-Based (Partially) Blind Signature via Trapdoor Sampling.
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

2019
Short Discrete Log Proofs for FHE and Ring-LWE Ciphertexts.
Proceedings of the Public-Key Cryptography - PKC 2019, 2019

2018
Efficient lattice-based zero-knowledge proofs and applications. (Preuves à divulgation nulle de connaissance efficaces à base de réseaux euclidiens et applications).
PhD thesis, 2018

Sub-linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

Lattice-Based Group Signatures and Zero-Knowledge Proofs of Automorphism Stability.
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

2017
Amortization with Fewer Equations for Proving Knowledge of Small Secrets.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

Practical Quantum-Safe Voting from Lattices.
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017

2016
Data merging for the cultural heritage imaging based on Chebfun approach.
Supercomput. Front. Innov., 2016

The Whole is Less Than the Sum of Its Parts: Constructing More Efficient Lattice-Based AKEs.
Proceedings of the Security and Cryptography for Networks - 10th International Conference, 2016

FHE Circuit Privacy Almost for Free.
Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

Secure architectures of future emerging cryptography <i>SAFEcrypto</i>.
Proceedings of the ACM International Conference on Computing Frontiers, CF'16, 2016


  Loading...