default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEdoardo Persichetti
Person information
SPARQL queries 
🛈 Please note that only 54% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j15]Violetta Weger
, Karan Khathuria, Anna-Lena Horlemann, Massimo Battaglioni, Paolo Santini, Edoardo Persichetti:
On the hardness of the Lee syndrome decoding problem. Adv. Math. Commun. 18(1): 233-266 (2024)- [c22]Christopher Battarbee, Giacomo Borin, Julian Brough, Ryann Cartor, Tobias Hemmert, Nadia Heninger, David Jao, Delaram Kahrobaei, Laura Maddison, Edoardo Persichetti, Angela Robinson, Daniel Smith-Tone, Rainer Steinwandt:
On the Semidirect Discrete Logarithm Problem in Finite Groups. ASIACRYPT (8) 2024: 330-357 - [c21]Michele Battagliola, Giacomo Borin, Alessio Meneghetti, Edoardo Persichetti:
Cutting the GRASS: Threshold GRoup Action Signature Schemes. CT-RSA 2024: 460-489 - [c20]Abhraneel Dutta, Emrah Karagoz, Edoardo Persichetti, Pakize Sanal:
Polynomial Inversion Algorithms in Constant Time for Post-Quantum Cryptography. INDOCRYPT (2) 2024: 237-256 - [i32]Christopher Battarbee, Giacomo Borin, Ryann Cartor, Nadia Heninger, David Jao, Laura Maddison, Edoardo Persichetti, Angela Robinson, Daniel Smith-Tone, Rainer Steinwandt:
On the Semidirect Discrete Logarithm Problem in Finite Groups. IACR Cryptol. ePrint Arch. 2024: 905 (2024) - 2023
- [j14]Alessandro Barenghi, Jean-François Biasse, Edoardo Persichetti, Paolo Santini:
On the computational hardness of the code equivalence problem in cryptography. Adv. Math. Commun. 17(1): 23-55 (2023) - [c19]Tung Chou, Ruben Niederhagen, Edoardo Persichetti, Tovohery Hajatiana Randrianarisoa, Krijn Reijnders, Simona Samardjiska, Monika Trimoska:
Take Your MEDS: Digital Signatures from Matrix Code Equivalence. AFRICACRYPT 2023: 28-52 - [c18]Edoardo Persichetti, Paolo Santini:
A New Formulation of the Linear Equivalence Problem and Shorter LESS Signatures. ASIACRYPT (7) 2023: 351-378 - [i31]Giacomo Borin, Edoardo Persichetti, Paolo Santini:
Zero-Knowledge Proofs from the Action Subgraph. IACR Cryptol. ePrint Arch. 2023: 718 (2023) - [i30]Edoardo Persichetti, Paolo Santini:
A New Formulation of the Linear Equivalence Problem and Shorter LESS Signatures. IACR Cryptol. ePrint Arch. 2023: 847 (2023) - [i29]Michele Battagliola, Giacomo Borin, Alessio Meneghetti, Edoardo Persichetti:
Cutting the GRASS: Threshold GRoup Action Signature Schemes. IACR Cryptol. ePrint Arch. 2023: 859 (2023) - [i28]Tung Chou, Edoardo Persichetti, Paolo Santini:
On Linear Equivalence, Canonical Forms, and Digital Signatures. IACR Cryptol. ePrint Arch. 2023: 1533 (2023) - 2022
- [j13]Shay Gueron, Edoardo Persichetti, Paolo Santini:
Designing a Practical Code-Based Signature Scheme from Zero-Knowledge Proofs with Trusted Setup. Cryptogr. 6(1): 5 (2022) - [j12]Alessandro Barenghi, Jean-François Biasse, Tran Ngo, Edoardo Persichetti, Paolo Santini:
Advanced signature functionalities from the code equivalence problem. Int. J. Comput. Math. Comput. Syst. Theory 7(2): 112-128 (2022) - [j11]Paolo Santini, Edoardo Persichetti, Marco Baldi:
Reproducible families of codes and cryptographic applications. J. Math. Cryptol. 16(1): 20-48 (2022) - [c17]Edoardo Persichetti, Tovohery Randrianarisoa:
On Linear Complexity of Finite Sequences: Coding Theory and Applications to Cryptography. IWSEC 2022: 24-44 - [i27]Alessandro Barenghi, Jean-François Biasse, Tran Ngo, Edoardo Persichetti, Paolo Santini:
Advanced Signature Functionalities from the Code Equivalence Problem. IACR Cryptol. ePrint Arch. 2022: 710 (2022) - [i26]Edoardo Persichetti, Tovohery Randrianarisoa:
On Linear Complexity of Finite Sequences : Coding Theory and Applications to Cryptography. IACR Cryptol. ePrint Arch. 2022: 966 (2022) - [i25]Alessandro Barenghi, Jean-François Biasse, Edoardo Persichetti, Paolo Santini:
On the Computational Hardness of the Code Equivalence Problem in Cryptography. IACR Cryptol. ePrint Arch. 2022: 967 (2022) - [i24]Tung Chou, Ruben Niederhagen, Edoardo Persichetti, Tovohery Hajatiana Randrianarisoa, Krijn Reijnders, Simona Samardjiska, Monika Trimoska:
Take your MEDS: Digital Signatures from Matrix Code Equivalence. IACR Cryptol. ePrint Arch. 2022: 1559 (2022) - 2021
- [j10]Nicolas Aragon, Marco Baldi, Jean-Christophe Deneuville, Karan Khathuria, Edoardo Persichetti, Paolo Santini:
Cryptanalysis of a code-based full-time signature. Des. Codes Cryptogr. 89(9): 2097-2112 (2021) - [j9]Marco Baldi, Jean-Christophe Deneuville, Edoardo Persichetti, Paolo Santini:
Cryptanalysis of a Code-Based Signature Scheme Based on the Schnorr-Lyubashevsky Framework. IEEE Commun. Lett. 25(9): 2829-2833 (2021) - [j8]Nir Drucker, Shay Gueron, Dusan Kostic, Edoardo Persichetti:
On the applicability of the Fujisaki-Okamoto transformation to the BIKE KEM. Int. J. Comput. Math. Comput. Syst. Theory 6(4): 364-374 (2021) - [c16]Thierry P. Berger, Anta Niane Gueye, Cheikh Thiecoumba Gueye, M. Anwarul Hasan, Jean Belo Klamti, Edoardo Persichetti, Tovohery Hajatiana Randrianarisoa, Olivier Ruatta:
Security Analysis of a Cryptosystem Based on Subspace Subcodes. CBCrypto 2021: 42-59 - [c15]Alessandro Barenghi, Jean-François Biasse, Edoardo Persichetti, Paolo Santini:
LESS-FM: Fine-Tuning Signatures from the Code Equivalence Problem. PQCrypto 2021: 23-43 - [i23]Marco Baldi, Jean-Christophe Deneuville, Edoardo Persichetti, Paolo Santini:
Cryptanalysis of a code-based signature scheme without trapdoors. IACR Cryptol. ePrint Arch. 2021: 134 (2021) - [i22]Alessandro Barenghi, Jean-François Biasse, Edoardo Persichetti, Paolo Santini:
LESS-FM: Fine-tuning Signatures from a Code-based Cryptographic Group Action. IACR Cryptol. ePrint Arch. 2021: 396 (2021) - [i21]Shay Gueron, Edoardo Persichetti, Paolo Santini:
Designing a Practical Code-based Signature Scheme from Zero-Knowledge Proofs with Trusted Setup. IACR Cryptol. ePrint Arch. 2021: 1020 (2021) - [i20]Lindsey M. Knowles, Edoardo Persichetti, Tovohery Randrianarisoa, Paolo Santini:
A Note on Non-Interactive Key Exchange from Code Equivalence. IACR Cryptol. ePrint Arch. 2021: 1653 (2021) - 2020
- [j7]Gustavo Banegas, Paulo S. L. M. Barreto, Edoardo Persichetti, Paolo Santini:
Designing Efficient Dyadic Operations for Cryptographic Applications. J. Math. Cryptol. 14(1): 95-109 (2020) - [c14]Jean-François Biasse, Giacomo Micheli, Edoardo Persichetti, Paolo Santini:
LESS is More: Code-Based Signatures Without Syndromes. AFRICACRYPT 2020: 45-65 - [c13]Paolo Santini, Massimo Battaglioni, Franco Chiaraluce, Marco Baldi, Edoardo Persichetti:
Low-Lee-Density Parity-Check Codes. ICC 2020: 1-6 - [e2]Marco Baldi, Edoardo Persichetti, Paolo Santini:
Code-Based Cryptography - 8th International Workshop, CBCrypto 2020, Zagreb, Croatia, May 9-10, 2020, Revised Selected Papers. Lecture Notes in Computer Science 12087, Springer 2020, ISBN 978-3-030-54073-9 [contents] - [i19]Violetta Weger, Massimo Battaglioni, Paolo Santini, Anna-Lena Horlemann-Trautmann, Edoardo Persichetti:
On the Hardness of the Lee Syndrome Decoding Problem. CoRR abs/2002.12785 (2020) - [i18]Marco Baldi, Massimo Battaglioni, Franco Chiaraluce, Anna-Lena Horlemann-Trautmann, Edoardo Persichetti, Paolo Santini, Violetta Weger:
A New Path to Code-based Signatures via Identification Schemes with Restricted Errors. CoRR abs/2008.06403 (2020) - [i17]Nicolas Aragon, Marco Baldi, Jean-Christophe Deneuville, Karan Khathuria, Edoardo Persichetti, Paolo Santini:
Cryptanalysis of a code-based full-time signature. CoRR abs/2011.08326 (2020) - [i16]Nir Drucker, Shay Gueron, Dusan Kostic, Edoardo Persichetti:
On the Applicability of the Fujisaki-Okamoto Transformation to the BIKE KEM. IACR Cryptol. ePrint Arch. 2020: 510 (2020) - [i15]Jean-François Biasse, Giacomo Micheli, Edoardo Persichetti, Paolo Santini:
LESS is More: Code-Based Signatures without Syndromes. IACR Cryptol. ePrint Arch. 2020: 594 (2020) - [i14]Marco Baldi, Karan Khathuria, Edoardo Persichetti, Paolo Santini:
Cryptanalysis of a Code-Based Signature Scheme Based on the Lyubashevsky Framework. IACR Cryptol. ePrint Arch. 2020: 905 (2020)
2010 – 2019
- 2019
- [j6]Edoardo Persichetti, Rainer Steinwandt, Adriana Suárez Corona:
From Key Encapsulation to Authenticated Group Key Establishment - A Compiler for Post-Quantum Primitives †. Entropy 21(12): 1183 (2019) - [c12]Gustavo Banegas, Paulo S. L. M. Barreto, Brice Odilon Boidje, Pierre-Louis Cayrel, Gilbert Ndollane Dione, Kris Gaj, Cheikh Thiécoumba Gueye, Richard Haeussler, Jean Belo Klamti, Ousmane Ndiaye, Duc Tri Nguyen, Edoardo Persichetti, Jefferson E. Ricardini:
DAGS: Reloaded Revisiting Dyadic Key Encapsulation. CBC 2019: 69-85 - [c11]Pierre-Louis Cayrel, Cheikh Thiécoumba Gueye, Junaid Ahmad Khan, Jean Belo Klamti, Edoardo Persichetti:
Improvement of Binary and Non Binary Statistical Decoding Algorithm. ICISC 2019: 194-207 - [c10]Simona Samardjiska, Paolo Santini, Edoardo Persichetti, Gustavo Banegas:
A Reaction Attack Against Cryptosystems Based on LRPC Codes. LATINCRYPT 2019: 197-216 - [c9]Nina Bindel, Mike Hamburg, Kathrin Hövelmanns, Andreas Hülsing, Edoardo Persichetti:
Tighter Proofs of CCA Security in the Quantum Random Oracle Model. TCC (2) 2019: 61-90 - [e1]Marco Baldi, Edoardo Persichetti, Paolo Santini:
Code-Based Cryptography - 7th International Workshop, CBC 2019, Darmstadt, Germany, May 18-19, 2019, Revised Selected Papers. Lecture Notes in Computer Science 11666, Springer 2019, ISBN 978-3-030-25921-1 [contents] - [i13]Nina Bindel, Mike Hamburg, Andreas Hülsing, Edoardo Persichetti:
Tighter proofs of CCA security in the quantum random oracle model. IACR Cryptol. ePrint Arch. 2019: 590 (2019) - [i12]Simona Samardjiska, Paolo Santini, Edoardo Persichetti, Gustavo Banegas:
A Reaction Attack against Cryptosystems based on LRPC Codes. IACR Cryptol. ePrint Arch. 2019: 845 (2019) - 2018
- [j5]Jean-Luc Danger, Youssef El Housni, Adrien Facon, Cheikh Thiecoumba Gueye, Sylvain Guilley, Sylvie Herbel, Ousmane Ndiaye, Edoardo Persichetti, Alexander Schaub:
On the Performance and Security of Multiplication in GF(2N). Cryptogr. 2(3): 25 (2018) - [j4]Edoardo Persichetti:
Efficient One-Time Signatures from Quasi-Cyclic Codes: A Full Treatment. Cryptogr. 2(4): 30 (2018) - [j3]Gustavo Banegas, Paulo S. L. M. Barreto, Brice Odilon Boidje, Pierre-Louis Cayrel, Gilbert Ndollane Dione, Kris Gaj, Cheikh Thiécoumba Gueye, Richard Haeussler, Jean Belo Klamti, Ousmane Ndiaye, Duc Tri Nguyen, Edoardo Persichetti, Jefferson E. Ricardini:
DAGS: Key encapsulation using dyadic GS codes. J. Math. Cryptol. 12(4): 221-239 (2018) - [c8]Edoardo Persichetti:
On the CCA2 Security of McEliece in the Standard Model. ProvSec 2018: 165-181 - [i11]Daniel J. Bernstein, Edoardo Persichetti:
Towards KEM Unification. IACR Cryptol. ePrint Arch. 2018: 526 (2018) - [i10]Gustavo Banegas, Paulo S. L. M. Barreto, Edoardo Persichetti, Paolo Santini:
Designing Efficient Dyadic Operations for Cryptographic Applications. IACR Cryptol. ePrint Arch. 2018: 650 (2018) - [i9]Paolo Santini, Edoardo Persichetti, Marco Baldi:
Reproducible Codes and Cryptographic Applications. IACR Cryptol. ePrint Arch. 2018: 666 (2018) - [i8]Gustavo Banegas, Paulo S. L. M. Barreto, Brice Odilon Boidje, Pierre-Louis Cayrel, Gilbert Ndollane Dione, Kris Gaj, Cheikh Thiecoumba Gueye, Richard Haeussler, Jean Belo Klamti, Ousmane Ndiaye, Duc Tri Nguyen, Edoardo Persichetti, Jefferson E. Ricardini:
DAGS: Reloaded Revisiting Dyadic Key Encapsulation. IACR Cryptol. ePrint Arch. 2018: 1203 (2018) - 2017
- [j2]Robert Niebuhr, Edoardo Persichetti, Pierre-Louis Cayrel, Stanislav Bulygin, Johannes Buchmann:
On lower bounds for information set decoding over q and on the effect of partial knowledge. Int. J. Inf. Coding Theory 4(1): 47-78 (2017) - [c7]Pierre-Louis Cayrel, Cheikh Thiecoumba Gueye, El Hadji Modou Mboup, Ousmane Ndiaye, Edoardo Persichetti:
Efficient Implementation of Hybrid Encryption from Coding Theory. C2SI 2017: 254-264 - [c6]Paulo S. L. M. Barreto, Shay Gueron, Tim Güneysu, Rafael Misoczki, Edoardo Persichetti, Nicolas Sendrier, Jean-Pierre Tillich:
CAKE: Code-Based Algorithm for Key Encapsulation. IMACC 2017: 207-226 - [c5]Edoardo Persichetti:
Code-Based Key Encapsulation from McEliece's Cryptosystem. MACIS 2017: 454-459 - [i7]Edoardo Persichetti:
Code-based Key Encapsulation from McEliece's Cryptosystem. CoRR abs/1706.06306 (2017) - [i6]Edoardo Persichetti:
Efficient Digital Signatures From Coding Theory. IACR Cryptol. ePrint Arch. 2017: 397 (2017) - [i5]Paulo S. L. M. Barreto, Shay Gueron, Tim Güneysu, Rafael Misoczki, Edoardo Persichetti, Nicolas Sendrier, Jean-Pierre Tillich:
CAKE: Code-based Algorithm for Key Encapsulation. IACR Cryptol. ePrint Arch. 2017: 757 (2017) - [i4]Gustavo Banegas, Paulo S. L. M. Barreto, Brice Odilon Boidje, Pierre-Louis Cayrel, Gilbert Ndollane Dione, Kris Gaj, Cheikh Thiecoumba Gueye, Richard Haeussler, Jean Belo Klamti, Ousmane Ndiaye, Duc Tri Nguyen, Edoardo Persichetti, Jefferson E. Ricardini:
DAGS: Key Encapsulation using Dyadic GS Codes. IACR Cryptol. ePrint Arch. 2017: 1037 (2017) - 2015
- [c4]Marcin Andrychowicz, Daniel Masny, Edoardo Persichetti:
Leakage-Resilient Cryptography over Large Finite Fields: Theory and Practice. ACNS 2015: 655-674 - [i3]Marcin Andrychowicz, Daniel Masny, Edoardo Persichetti:
Leakage-Resilient Cryptography over Large Finite Fields: Theory and Practice. IACR Cryptol. ePrint Arch. 2015: 317 (2015) - 2013
- [c3]Edoardo Persichetti:
Code-Based Public-Key Encryption Resistant to Key Leakage. CD-ARES Workshops 2013: 44-54 - [c2]Edoardo Persichetti:
Secure and Anonymous Hybrid Encryption from Coding Theory. PQCrypto 2013: 174-187 - 2012
- [j1]Edoardo Persichetti:
Compact McEliece keys based on quasi-dyadic Srivastava codes. J. Math. Cryptol. 6(2): 149-169 (2012) - [c1]Pierre-Louis Cayrel, Gerhard Hoffmann, Edoardo Persichetti:
Efficient Implementation of a CCA2-Secure Variant of McEliece Using Generalized Srivastava Codes. Public Key Cryptography 2012: 138-155 - [i2]Edoardo Persichetti:
On a CCA2-secure variant of McEliece in the standard model. IACR Cryptol. ePrint Arch. 2012: 268 (2012) - 2011
- [i1]Edoardo Persichetti:
Compact McEliece keys based on Quasi-Dyadic Srivastava codes. IACR Cryptol. ePrint Arch. 2011: 179 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-06 01:54 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
