Edoardo Persichetti

According to our database1, Edoardo Persichetti authored at least 47 papers between 2011 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A New Formulation of the Linear Equivalence Problem and Shorter LESS Signatures.
IACR Cryptol. ePrint Arch., 2023

On Linear Equivalence, Canonical Forms, and Digital Signatures.
IACR Cryptol. ePrint Arch., 2023

Zero-Knowledge Proofs from the Action Subgraph.
IACR Cryptol. ePrint Arch., 2023

Cutting the GRASS: Threshold GRoup Action Signature Schemes.
IACR Cryptol. ePrint Arch., 2023

On the computational hardness of the code equivalence problem in cryptography.
Adv. Math. Commun., 2023

2022
Reproducible families of codes and cryptographic applications.
J. Math. Cryptol., 2022

Advanced signature functionalities from the code equivalence problem.
Int. J. Comput. Math. Comput. Syst. Theory, 2022

On Linear Complexity of Finite Sequences : Coding Theory and Applications to Cryptography.
IACR Cryptol. ePrint Arch., 2022

Take your MEDS: Digital Signatures from Matrix Code Equivalence.
IACR Cryptol. ePrint Arch., 2022

Designing a Practical Code-Based Signature Scheme from Zero-Knowledge Proofs with Trusted Setup.
Cryptogr., 2022

2021
On the applicability of the Fujisaki-Okamoto transformation to the BIKE KEM.
Int. J. Comput. Math. Comput. Syst. Theory, 2021

Cryptanalysis of a Code-Based Signature Scheme Based on the Schnorr-Lyubashevsky Framework.
IEEE Commun. Lett., 2021

A Note on Non-Interactive Key Exchange from Code Equivalence.
IACR Cryptol. ePrint Arch., 2021

LESS-FM: Fine-tuning Signatures from a Code-based Cryptographic Group Action.
IACR Cryptol. ePrint Arch., 2021

Cryptanalysis of a code-based signature scheme without trapdoors.
IACR Cryptol. ePrint Arch., 2021

Cryptanalysis of a code-based full-time signature.
Des. Codes Cryptogr., 2021

LESS-FM: Fine-Tuning Signatures from the Code Equivalence Problem.
Proceedings of the Post-Quantum Cryptography - 12th International Workshop, 2021

Security Analysis of a Cryptosystem Based on Subspace Subcodes.
Proceedings of the Code-Based Cryptography - 9th International Workshop, 2021

2020
LESS is More: Code-Based Signatures without Syndromes.
IACR Cryptol. ePrint Arch., 2020

Cryptanalysis of a Code-Based Signature Scheme Based on the Lyubashevsky Framework.
IACR Cryptol. ePrint Arch., 2020

A New Path to Code-based Signatures via Identification Schemes with Restricted Errors.
CoRR, 2020

On the Hardness of the Lee Syndrome Decoding Problem.
CoRR, 2020

Low-Lee-Density Parity-Check Codes.
Proceedings of the 2020 IEEE International Conference on Communications, 2020

2019
A Reaction Attack against Cryptosystems based on LRPC Codes.
IACR Cryptol. ePrint Arch., 2019

Tighter proofs of CCA security in the quantum random oracle model.
IACR Cryptol. ePrint Arch., 2019

From Key Encapsulation to Authenticated Group Key Establishment - A Compiler for Post-Quantum Primitives †.
Entropy, 2019

Tighter Proofs of CCA Security in the Quantum Random Oracle Model.
Proceedings of the Theory of Cryptography - 17th International Conference, 2019

Improvement of Binary and Non Binary Statistical Decoding Algorithm.
Proceedings of the Information Security and Cryptology - ICISC 2019, 2019

2018
Reproducible Codes and Cryptographic Applications.
IACR Cryptol. ePrint Arch., 2018

Towards KEM Unification.
IACR Cryptol. ePrint Arch., 2018

Designing Efficient Dyadic Operations for Cryptographic Applications.
IACR Cryptol. ePrint Arch., 2018

DAGS: Reloaded Revisiting Dyadic Key Encapsulation.
IACR Cryptol. ePrint Arch., 2018

Efficient One-Time Signatures from Quasi-Cyclic Codes: A Full Treatment.
Cryptogr., 2018

On the Performance and Security of Multiplication in <i>GF</i>(2<sup><i>N</i></sup>).
Cryptogr., 2018

On the CCA2 Security of McEliece in the Standard Model.
Proceedings of the Provable Security, 2018

2017
On lower bounds for information set decoding over <sub>q</sub> and on the effect of partial knowledge.
Int. J. Inf. Coding Theory, 2017

Efficient Digital Signatures From Coding Theory.
IACR Cryptol. ePrint Arch., 2017

CAKE: Code-based Algorithm for Key Encapsulation.
IACR Cryptol. ePrint Arch., 2017

DAGS: Key Encapsulation using Dyadic GS Codes.
IACR Cryptol. ePrint Arch., 2017

Code-Based Key Encapsulation from McEliece's Cryptosystem.
Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2017

Efficient Implementation of Hybrid Encryption from Coding Theory.
Proceedings of the Codes, Cryptology and Information Security, 2017

2015
Leakage-Resilient Cryptography over Large Finite Fields: Theory and Practice.
IACR Cryptol. ePrint Arch., 2015

2013
Secure and Anonymous Hybrid Encryption from Coding Theory.
Proceedings of the Post-Quantum Cryptography - 5th International Workshop, 2013

Code-Based Public-Key Encryption Resistant to Key Leakage.
Proceedings of the Security Engineering and Intelligence Informatics, 2013

2012
On a CCA2-secure variant of McEliece in the standard model.
IACR Cryptol. ePrint Arch., 2012

Efficient Implementation of a CCA2-Secure Variant of McEliece Using Generalized Srivastava Codes.
Proceedings of the Public Key Cryptography - PKC 2012, 2012

2011
Compact McEliece keys based on Quasi-Dyadic Srivastava codes.
IACR Cryptol. ePrint Arch., 2011


  Loading...