Marco Pedicini

@uniroma3.it

Professor with Department of Mathematics and Physics
Roma Tre University

Marco Pedicini


                                 Download Compact PDF  
https://researchid.co/pis147879
My research interests are in theoretical computer science. In particular, my research ranges in Logic in Computer Science, Computational Methods for Systems Biology, Computational Number Theory, Cryptography and Cryptanalysis. Although this whole activity falls in Theoretical Computer Science, it achieves interdisciplinary research specificity. Interactions with other disciplines are the key to evaluating my activity. I developed a special kind of expertise while linking theoretical results with practical issues in the development of advanced applications for computer science.

EDUCATION

PhD (date of defence 15 January 1999), at Equipe de Logique Mathématique of the University Paris 7, title of thesis Exécution et Programmes, thesis supervisor J.-Y. Girard;

DEA Logique et Fondements de l’Informatique, at University Paris 7, title of the master degree memory: Schémas Principaux et Réseaux de Preuves, supervisor J. van de Wiele;

Laurea of Mathematical Sciences at the University of Rome “La Sapienza”, the title of the “tesi di laurea”: Lambda Calcolo Puro, Reti di Dimostrazione e Riduzione di Testa, thesis supervisor C. Bo ̈hm co-supervisor G.F. Mascari.

RESEARCH, TEACHING, or OTHER INTERESTS

Logic, Computer Science, Theoretical Computer Science, Computational Theory and Mathematics
41

Scopus Publications

611

Scholar Citations

13

Scholar h-index

14

Scholar i10-index

Scopus Publications

  • Cross-primitive comparison in CP-ABE
    Lorenzo Gasparini, Elia Onofri, Martina Palmucci, Marco Pedicini
    Journal of Mathematical Cryptology, 2026
    Ciphertext-Policy Attribute-Based Encryption (CP-ABE) is a cornerstone technique for fine-grained access control in encrypted data sharing, with pairing-based schemes having established the de facto standard. However, their vulnerability to quantum attacks generated growing interest in alternatives rooted in quantum-secure primitives, with Learning With Errors (LWE) emerging as a prominent candidate. In this work, we present the first direct performance benchmark of lattice-versus pairings-based CP-ABE implementations. We compare two mature, widely adopted implementations – PALISADE-ABE’s LWE-based Zhang-Zhang scheme and OpenABE’s pairing-based Waters scheme – selected for their comparable development environments and assumptions. Our results highlight the practical trade-offs – both costs and benefits – of each paradigm, quantifying where lattice-based designs offer advantages and where they incur extra overhead. This comparison addresses a critical gap in the literature and provides direction for the design of future post-quantum secure systems.
  • Generic Partial Decryption as Feature Engineering for Neural Distinguishers
    Emanuele Bellini, Rocco Brunelli, David Gerault, Anna Hambitzer, Marco Pedicini
    Lecture Notes in Computer Science, 2026
  • Fourteen years of cube attacks
    Marco Cianfriglia, Elia Onofri, Silvia Onofri, Marco Pedicini
    Applicable Algebra in Engineering Communications and Computing, 2025
    Algebraic Cryptanalysis is a widely used technique that tackles the problem of breaking ciphers mainly relying on the ability to express a cryptosystem as a solvable polynomial system. Each output bit/word can be expressed as a polynomial equation in the cipher’s inputs—namely the key and the plaintext or the initialisation vector bits/words. A part of research in this area consists in finding suitable algebraic structures where polynomial systems can be effectively solved, e.g., by computing Gröbner bases. In 2009, Dinur and Shamir proposed the cube attack, a chosen plaintext algebraic cryptanalysis technique for the offline acquisition of an equivalent system by means of monomial reduction; interpolation on cubes in the space of variables enables retrieving a linear polynomial system, hence making it exploitable in the online phase to recover the secret key. Since its introduction, this attack has received both many criticisms and endorsements from the crypto community; this work aims at providing, under a unified notation, a complete state-of-the-art review of recent developments by categorising contributions in five classes. We conclude the work with an in-depth description of the kite attack framework, a cipher-independent tool that implements cube attacks on GPUs. Mickey2.0 is adopted as a showcase.
  • Quantitative Modelling Approaches
    Filippo Castiglione, Emiliano Mancini, Marco Pedicini, Abdul S. Jarrah
    Encyclopedia of Bioinformatics and Computational Biology, 2025
  • Dynamic-FROST: Schnorr threshold signatures with a flexible committee
    Annalisa Cimatti, Francesco De Sclavis, Giuseppe Galano, Sara Giammusso, Michela Iezzi, et al.
    Journal of Mathematical Cryptology, 2025
    Threshold signatures enable any subgroup of predefined cardinality t t out of a committee of n n participants to generate a valid, aggregated signature. Although several ( t , n ) \\left(t,n) -threshold signature schemes exist, most of them assume that the threshold t t and the set of participants do not change over time. Practical applications of threshold signatures might benefit from the possibility of updating the threshold or the committee of participants. Examples of such applications are consensus algorithms and blockchain wallets. In this article, we present Dynamic-FROST (D-FROST) that combines FROST, a Schnorr threshold signature scheme, with CHURP, a dynamic proactive secret sharing scheme. The resulting protocol is the first Schnorr threshold signature scheme that accommodates changes in both the committee and the threshold value without relying on a trusted third party. Besides detailing the protocol, we present a proof of its security: as the original signing scheme, D-FROST preserves the property of existential unforgeability under chosen-message attack.
  • A quasi-ergodic approach to non-integer base expansions
    Vilmos Komornik, Paola Loreti, Marco Pedicini
    Journal of Number Theory, 2024
  • mRLWE-CP-ABE: A revocable CP-ABE for post-quantum cryptography
    Marco Cianfriglia, Elia Onofri, Marco Pedicini
    Journal of Mathematical Cryptology, 2024
    We address the problem of user fast revocation in the lattice-based Ciphertext Policy Attribute-Based Encryption (CP-ABE) by extending the scheme originally introduced by Zhang and Zhang [Zhang J, Zhang Z. A ciphertext policy attribute-based encryption scheme without pairings. In: International Conference on Information Security and Cryptology. Springer; 2011. p. 324–40. doi: https://doi.org/10.1007/978-3-642-34704-7_23.]. While a lot of work exists on the construction of revocable schemes for CP-ABE based on pairings, works based on lattices are not so common, and – to the best of our knowledge – we introduce the first server-aided revocation scheme in a lattice-based CP-ABE scheme, hence being embedded in a post-quantum secure environment. In particular, we rely on semi-trusted “mediators” to provide a multi-step decryption capable of handling mediation without re-encryption. We comment on the scheme and its application, and we provide performance experiments on a prototype implementation in the Attribute-Based Encryption spin-off library of Palisade to evaluate the overhead compared with the original scheme.
  • Explainable Drug Repurposing Approach from Biased Random Walks
    Filippo Castiglione, Christine Nardini, Elia Onofri, Marco Pedicini, Paolo Tieri
    IEEE ACM Transactions on Computational Biology and Bioinformatics, 2023
    Drug repurposing is a highly active research area, aiming at finding novel uses for drugs that have been previously developed for other therapeutic purposes. Despite the flourishing of methodologies, success is still partial, and different approaches offer, each, peculiar advantages. In this composite landscape, we present a novel methodology focusing on an efficient mathematical procedure based on gene similarity scores and biased random walks which rely on robust drug-gene-disease association data sets. The recommendation mechanism is further unveiled by means of the Markov chain underlying the random walk process, hence providing explainability about how findings are suggested. Performances evaluation and the analysis of a case study on rheumatoid arthritis show that our approach is accurate in providing useful recommendations and is computationally efficient, compared to the state of the art of drug repurposing approaches.
  • Invertible Quadratic Non-linear Functions over Fpn via Multiple Local Maps
    Ginevra Giordani, Lorenzo Grassi, Silvia Onofri, Marco Pedicini
    Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 2023
  • Invertible Quadratic Non-Linear Layers for MPC-/FHE-/ZK-Friendly Schemes over Fnp Application to Poseidon
    Lorenzo Grassi, Silvia Onofri, Marco Pedicini, Luca Sozzi
    Iacr Transactions on Symmetric Cryptology, 2022
    Motivated by new applications such as secure Multi-Party Computation (MPC), Fully Homomorphic Encryption (FHE), and Zero-Knowledge proofs (ZK), many MPC-, FHE- and ZK-friendly symmetric-key primitives that minimize the number of multiplications over Fp for a large prime p have been recently proposed in the literature. This goal is often achieved by instantiating the non-linear layer via power maps x↦xd. In this paper, we start an analysis of new non-linear permutation functions over Fnp that can be used as building blocks in such symmetrickey primitives. Given a local map F : Fmp→ Fp, we limit ourselves to focus on S-Boxes over Fnp for n ≥ m defined as SF (x0, x1, . . . , xn−1) = y0|y1| . . . |yn−1 where yi := F(xi, xi+1, . . . , xi+m−1). As main results, we prove that• given any quadratic function F : F2p→ Fp, the corresponding S-Box SF over Fnp for n ≥ 3 is never invertible;• similarly, given any quadratic function F : F3p → Fp, the corresponding S-Box SF over Fnp for n ≥ 5 is never invertible.Moreover, for each p ≥ 3, we present (1st) generalizations of the Lai-Massey construction over Fnp defined as before via functions F : Fmp → Fp for each n = m ≥ 2 and (2nd) (non-trivial) quadratic functions F : F3p → Fp such that SF over Fnp for n ∈ {3, 4} is invertible. As an open problem for future work, we conjecture that for each m ≥ 1 there exists a finite integer nmax(m) such that SF over Fnp defined as before via a quadratic function F : Fmp →Fp is not invertible for each n ≥ nmax(m). Finally, as a concrete application, we propose Neptune, a variant of the sponge hash function Poseidon, whose non-linear layer is designed by taking into account the results presented in this paper. We show that this variant leads to a concrete multiplication reduction with respect to Poseidon.
  • Kite attack: reshaping the cube attack for a flexible GPU-based maxterm search
    Marco Cianfriglia, Stefano Guarino, Massimo Bernaschi, Flavio Lombardi, Marco Pedicini
    Journal of Cryptographic Engineering, 2019
  • Abstract machines, optimal reduction, and streams
    Anna Chiara Lai, Marco Pedicini, Mario Piazza
    Mathematical Structures in Computer Science, 2019
  • What Arrow’s Information Paradox Says (to Philosophers)
    Mario Piazza, Marco Pedicini
    Philosophical Studies Series, 2019
  • Quantitative Modelling Approaches
    Filippo Castiglione, Emiliano Mancini, Marco Pedicini, Abdul Salam Jarrah
    Encyclopedia of Bioinformatics and Computational Biology Abc of Bioinformatics, 2019
  • Kalmar Elementary Complexity and von Neumann Algebras
    Panamerican Mathematical Journal, 2018
  • Computing hierarchical transition graphs of asynchronous genetic regulatory networks
    Marco Pedicini, Maria Concetta Palumbo, Filippo Castiglione
    Communications in Computer and Information Science, 2018
  • Quantitative modelling approaches
    Filippo Castiglione, Emiliano Mancini, Marco Pedicini, Abdul Salam Jarrah
    Encyclopedia of Bioinformatics and Computational Biology Abc of Bioinformatics, 2018
  • Critical bases for ternary alphabets
    V. Komornik, M. Pedicini
    Acta Mathematica Hungarica, 2017
  • Multiple common expansions in non-integer bases
    Vilmos Komornik, Marco Pedicini, Attila Pethő
    Acta Scientiarum Mathematicarum, 2017
  • A novel GPU-based implementation of the cube attack preliminary results against trivium
    Marco Cianfriglia, Stefano Guarino, Massimo Bernaschi, Flavio Lombardi, Marco Pedicini
    Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 2017
  • Quantum entanglement and the Bell matrix
    Anna Chiara Lai, Marco Pedicini, Silvia Rognone
    Quantum Information Processing, 2016
  • Light combinators for finite fields arithmetic
    D. Canavese, E. Cesena, R. Ouchary, M. Pedicini, L. Roversi
    Science of Computer Programming, 2015
  • Can a light typing discipline be compatible with an efficient implementation of finite fields inversion?
    Daniele Canavese, Emanuele Cesena, Rachid Ouchary, Marco Pedicini, Luca Roversi
    Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 2014
  • Typing a core binary-field arithmetic in a light logic
    Emanuele Cesena, Marco Pedicini, Luca Roversi
    Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 2012
  • Cube attack in finite fields of higher order
    Conferences in Research and Practice in Information Technology Series, 2011
  • Generalized golden ratios of ternary alphabets
    Vilmos Komornik, Anna Chiara Lai, Marco Pedicini
    Journal of the European Mathematical Society, 2011
  • Immunological network signatures of cancer progression and survival
    Trevor Clancy, Marco Pedicini, Filippo Castiglione, Daniele Santoni, Vegard Nygaard, et al.
    BMC Medical Genomics, 2011
  • Combining network modeling and gene expression microarray analysis to explore the dynamics of Th1 and Th2 cell regulation
    Marco Pedicini, Fredrik Barrenäs, Trevor Clancy, Filippo Castiglione, Eivind Hovig, et al.
    Plos Computational Biology, 2010
  • Implementation of a regulatory gene network to simulate the TH1/2 differentiation in an agent-based model of hypersensitivity reactions
    Daniele Santoni, Marco Pedicini, Filippo Castiglione
    Bioinformatics, 2008
  • PELCR: Parallel environment for optimal lambda-calculus reduction
    Marco Pedicini, Francesco Quaglia
    ACM Transactions on Computational Logic, 2007
  • Supporting function calls within PELCR
    Antonio Cosentino, Marco Pedicini, Francesco Quaglia
    Electronic Notes in Theoretical Computer Science, 2006
  • Greedy expansions and sets with deleted digits
    Marco Pedicini
    Theoretical Computer Science, 2005
  • Scheduling vs communication in PELCR
    Marco Pedicini, Francesco Quaglia
    Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 2002
  • Elementary complexity and geometry of interaction
    Fundamenta Informaticae, 2001
  • The idempotent analog of resolvent kernels for a deterministic optimal control problem
    P. Loreti, M. Pedicini
    Mathematical Notes, 2001
  • A parallel implementation for optimal lambda-calculus reduction
    Marco Pedicini, Francesco Quaglia
    Proceedings of the 2nd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2000
  • An approximation property of Pisot numbers
    Vilmos Komornik, Paola Loreti, Marco Pedicini
    Journal of Number Theory, 2000
  • Elementary complexity and geometry of interaction
    Patrick Baillot, Marco Pedicini
    Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 1999
  • Directed virtual reductions
    Vincent Danos, Marco Pedicini, Laurent Regnier
    Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 1997
  • Remarks on Elementary Linear Logic. Preliminary Report
    Marco Pedicini
    Electronic Notes in Theoretical Computer Science, 1996
  • Head linear reduction and pure proof net extraction
    G.F. Mascari, M. Pedicini
    Theoretical Computer Science, 1994

RECENT SCHOLAR PUBLICATIONS

  • Cross-primitive comparison in CP-ABE: Bilinear pairing versus lattices
    L Gasparini, E Onofri, M Palmucci, M Pedicini
    Journal of Mathematical Cryptology 20 (1) , 2026
    2026
    Citations: 1
  • Generic Partial Decryption as Feature Engineering for Neural Distinguishers
    E Bellini, R Brunelli, D Gerault, A Hambitzer, M Pedicini
    International Conference on Cryptology and Information Security in Latin … , 2025
    2025
    Citations: 2
  • Dynamic-FROST: Schnorr threshold signatures with a flexible committee
    A Cimatti, F De Sclavis, G Galano, S Giammusso, M Iezzi, A Muci, ...
    Journal of Mathematical Cryptology 19 (1), 20240045 , 2025
    2025
    Citations: 6
  • Multiple Kakeya expansions
    V Komornik, P Loreti, M Pedicini
    ANNALI SCUOLA NORMALE SUPERIORE-CLASSE DI SCIENZE, 1–17 , 2025
    2025
  • mR LWE -CP-ABE: A revocable CP-ABE for post-quantum cryptography
    M Cianfriglia, E Onofri, M Pedicini
    Journal of Mathematical Cryptology 18 (1), 20230026 , 2024
    2024
    Citations: 5
  • A quasi-ergodic approach to non-integer base expansions
    V Komornik, P Loreti, M Pedicini
    Journal of Number Theory 254, 146-168 , 2024
    2024
    Citations: 2
  • Invertible Quadratic Non-linear Functions over via Multiple Local Maps
    G Giordani, L Grassi, S Onofri, M Pedicini
    International Conference on Cryptology in Africa, 151-176 , 2023
    2023
    Citations: 4
  • Fourteen years of cube attacks
    M Cianfriglia, E Onofri, S Onofri, M Pedicini
    Applicable Algebra in Engineering, Communication and Computing, 1-41 , 2023
    2023
    Citations: 4
  • Invertible quadratic non-linear layers for MPC-/FHE-/ZK-friendly schemes over Fnp: application to Poseidon
    L Grassi, S Onofri, M Pedicini, L Sozzi
    IACR Transactions on Symmetric Cryptology, 20-72 , 2022
    2022
    Citations: 36
  • Explainable drug repurposing approach from biased random walks
    F Castiglione, C Nardini, E Onofri, M Pedicini, P Tieri
    IEEE/ACM Transactions on Computational Biology and Bioinformatics 20 (2 … , 2022
    2022
    Citations: 12
  • De Cifris Cryptanalysis: selected papers from the ITASEC2020 workshop" Cryptanalysis: a key tool in securing and breaking ciphers"
    R La Scala, M Pedicini, A Visconti
    COLLECTIO CIPHRARUM 2 , 2022
    2022
  • On the number of provable formulas
    M Piazza, M Pedicini, Q Puite
    ANALITICA 19, 145-166 , 2021
    2021
  • Kite attack : reshaping the cube attack for a flexible GPU-based maxterm search
    M Cianfriglia, S Guarino, M Bernaschi, F Lombardi, M Pedicini
    Journal of Cryptographic Engineering 9 (4), 375-392 , 2019
    2019
    Citations: 4
  • Abstract machines, optimal reduction, and streams
    AC Lai, M Pedicini, M Piazza
    Mathematical Structures in Computer Science 29 (9), 1379-1410 , 2019
    2019
  • What Arrow’s Information Paradox Says (to Philosophers)
    M Piazza, M Pedicini
    On the Cognitive, Ethical, and Scientific Dimensions of Artificial … , 2019
    2019
    Citations: 3
  • Kálmar elementary complexity and von Neumann algebras
    M Piazza, M Pedicini
    Panamerican Mathematical Journal 28 (4), 1-28 , 2018
    2018
    Citations: 1
  • Computing Hierarchical Transition Graphs of Asynchronous Genetic Regulatory Networks
    M Pedicini, MC Palumbo, F Castiglione
    Italian Workshop on Artificial Life and Evolutionary Computation, 88-103 , 2018
    2018
    Citations: 1
  • Quantitative Modelling Approaches
    F Castiglione, E Mancini, M Pedicini, AS Jarrah
    2018
    Citations: 5
  • A novel gpu-based implementation of the cube attack: Preliminary results against trivium
    M Cianfriglia, S Guarino, M Bernaschi, F Lombardi, M Pedicini
    International Conference on Applied Cryptography and Network Security, 184-207 , 2017
    2017
    Citations: 9
  • A Novel GPU-Based Implementation of the Cube Attack
    F Lombardi, M Pedicini
    Applied Cryptography and Network Security: 15th International Conference … , 2017
    2017

MOST CITED SCHOLAR PUBLICATIONS

  • Elementary complexity and geometry of interaction
    P Baillot, M Pedicini
    Fundamenta Informaticae 45 (1-2), 1-31 , 2001
    2001
    Citations: 72
  • Implementation of a regulatory gene network to simulate the TH1/2 differentiation in an agent-based model of hypersensitivity reactions
    D Santoni, M Pedicini, F Castiglione
    Bioinformatics 24 (11), 1374-1380 , 2008
    2008
    Citations: 70
  • Greedy expansions and sets with deleted digits
    M Pedicini
    Theoretical computer science 332 (1-3), 313-336 , 2005
    2005
    Citations: 61
  • Head linear reduction and pure proof net extraction
    GF Mascari, M Pedicini
    Theoretical Computer Science 135 (1), 111-137 , 1994
    1994
    Citations: 55
  • Invertible quadratic non-linear layers for MPC-/FHE-/ZK-friendly schemes over Fnp: application to Poseidon
    L Grassi, S Onofri, M Pedicini, L Sozzi
    IACR Transactions on Symmetric Cryptology, 20-72 , 2022
    2022
    Citations: 36
  • Generalized golden ratios of ternary alphabets
    V Komornik, AC Lai, M Pedicini
    Journal of the European Mathematical Society 13 (4), 1113-1146 , 2011
    2011
    Citations: 33
  • Combining network modeling and gene expression microarray analysis to explore the dynamics of Th1 and Th2 cell regulation
    M Pedicini, F Barrenäs, T Clancy, F Castiglione, E Hovig, K Kanduri, ...
    PLoS computational biology 6 (12), e1001032 , 2010
    2010
    Citations: 31
  • An approximation property of Pisot numbers
    V Komornik, P Loreti, M Pedicini
    Journal of Number Theory 80 (2), 218-237 , 2000
    2000
    Citations: 28
  • PELCR: Parallel environment for optimal lambda-calculus reduction
    M Pedicini, F Quaglia
    ACM Transactions on Computational Logic (TOCL) 8 (3), 14 , 2007
    2007
    Citations: 24
  • Immunological network signatures of cancer progression and survival
    T Clancy, M Pedicini, F Castiglione, D Santoni, V Nygaard, TJ Lavelle, ...
    BMC medical genomics 4 (1), 28 , 2011
    2011
    Citations: 22
  • Directed virtual reductions
    V Danos, M Pedicini, L Regnier
    International Workshop on Computer Science Logic, 76-88 , 1996
    1996
    Citations: 18
  • A parallel implementation for optimal lambda-calculus reduction
    M Pedicini, F Quaglia
    Proceedings of the 2nd ACM SIGPLAN international conference on Principles … , 2000
    2000
    Citations: 17
  • Cube attack in finite fields of higher order
    A Agnesse, M Pedicini
    Proceedings of the Ninth Australasian Information Security Conference-Volume … , 2011
    2011
    Citations: 13
  • Explainable drug repurposing approach from biased random walks
    F Castiglione, C Nardini, E Onofri, M Pedicini, P Tieri
    IEEE/ACM Transactions on Computational Biology and Bioinformatics 20 (2 … , 2022
    2022
    Citations: 12
  • A novel gpu-based implementation of the cube attack: Preliminary results against trivium
    M Cianfriglia, S Guarino, M Bernaschi, F Lombardi, M Pedicini
    International Conference on Applied Cryptography and Network Security, 184-207 , 2017
    2017
    Citations: 9
  • Elementary complexity and geometry of interaction
    P Baillot, M Pedicini
    International Conference on Typed Lambda Calculi and Applications, 25-33 , 1999
    1999
    Citations: 9
  • Critical bases for ternary alphabets
    V Komornik, M Pedicini
    Acta Mathematica Hungarica 152 (1), 25-57 , 2017
    2017
    Citations: 8
  • Multiple common expansions in non-integer bases
    V Komornik, M Pedicini, A Pethő
    Acta Scientiarum Mathematicarum 83 (1), 51-60 , 2017
    2017
    Citations: 7
  • Types and dynamics in partially additive categories
    G Mascari, M Pedicini
    Idempotency, in: Publications of the Isaac Newton Institute 11 , 1998
    1998
    Citations: 7
  • Dynamic-FROST: Schnorr threshold signatures with a flexible committee
    A Cimatti, F De Sclavis, G Galano, S Giammusso, M Iezzi, A Muci, ...
    Journal of Mathematical Cryptology 19 (1), 20240045 , 2025
    2025
    Citations: 6