Matteo Campanelli

According to our database, Matteo Campanelli authored at least 41 papers between 2009 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Natively Compatible Super-Efficient Lookup Arguments and How to Apply Them.

Matteo Campanelli, Dario Fiore, Rosario Gennaro

J. Cryptol., March, 2025

2024

Curve Forests: Transparent Zero-Knowledge Set Membership with Batching and Strong Security.

Matteo Campanelli, Mathias Hall-Andersen, Simon Holmgaard Kamp

IACR Cryptol. ePrint Arch., 2024

Fully-Succinct Arguments over the Integers from First Principles.

Matteo Campanelli, Mathias Hall-Andersen

IACR Cryptol. ePrint Arch., 2024

SNARKs for Virtual Machines are Non-Malleable.

Matteo Campanelli, Antonio Faonio, Luigi Russo

IACR Cryptol. ePrint Arch., 2024

Fiat-Shamir Goes Rational.

Matteo Campanelli, Agni Datta

IACR Cryptol. ePrint Arch., 2024

Universally Composable SNARKs with Transparent Setup without Programmable Random Oracle.

Christian Badertscher, Matteo Campanelli, Michele Ciampi, Luigi Russo, Luisa Siniscalchi

IACR Cryptol. ePrint Arch., 2024

How to Make Rational Arguments Practical and Extractable.

Matteo Campanelli, Chaya Ganesh, Rosario Gennaro

IACR Commun. Cryptol., 2024

2023

Zero-knowledge proofs for set membership: efficient, succinct, modular.

Daniel Benarroch, Matteo Campanelli, Dario Fiore, Kobi Gurkan, Dimitris Kolonelos

Des. Codes Cryptogr., November, 2023

Testudo: Linear Time Prover SNARKs with Constant Size Proofs and Square Root Size Universal Setup.

Matteo Campanelli, Nicolas Gailly, Rosario Gennaro, Philipp Jovanovic, Mara Mihali, Justin Thaler

IACR Cryptol. ePrint Arch., 2023

Lookup Arguments: Improvements, Extensions and Applications to Zero-Knowledge Decision Trees.

Matteo Campanelli, Antonio Faonio, Dario Fiore, Tianyu Li, Helger Lipmaa

IACR Cryptol. ePrint Arch., 2023

Advancing Scalability in Decentralized Storage: A Novel Approach to Proof-of-Replication via Polynomial Evaluation.

Giuseppe Ateniese, Foteini Baldimtsi, Matteo Campanelli, Danilo Francati, Ioanna Karantaidou

IACR Cryptol. ePrint Arch., 2023

Curve Trees: Practical and Transparent Zero-Knowledge Accumulators.

Matteo Campanelli, Mathias Hall-Andersen, Simon Holmgaard Kamp

Proceedings of the 32nd USENIX Security Symposium, 2023

sfTestudo: Linear Time Prover SNARKs with Constant Size Proofs and Square Root Size Universal Setup.

Matteo Campanelli, Nicolas Gailly, Rosario Gennaro, Philipp Jovanovic, Mara Mihali, Justin Thaler

Proceedings of the Progress in Cryptology - LATINCRYPT 2023, 2023

Witness-Authenticated Key Exchange, Revisited: Extensions to Groups, Improved Models, Simpler Constructions.

Matteo Campanelli, Rosario Gennaro, Kelsey Melissaris, Luca Nizzardo

Proceedings of the Financial Cryptography and Data Security, 2023

2022

Linear-map Vector Commitments and their Practical Applications.

Matteo Campanelli, Anca Nitulescu, Carla Ràfols, Alexandros Zacharakis, Arantxa Zapico

IACR Cryptol. ePrint Arch., 2022

Curve Trees: Practical and Transparent Zero-Knowledge Accumulators.

Matteo Campanelli, Mathias Hall-Andersen

IACR Cryptol. ePrint Arch., 2022

Witness-Authenticated Key Exchange Revisited: Improved Models, Simpler Constructions, Extensions to Groups.

Matteo Campanelli, Rosario Gennaro, Kelsey Melissaris, Luca Nizzardo

IACR Cryptol. ePrint Arch., 2022

Impossibilities in Succinct Arguments: Black-box Extraction and More.

Matteo Campanelli, Chaya Ganesh, Hamidreza Khoshakhlagh, Janno Siim

IACR Cryptol. ePrint Arch., 2022

Structure-Preserving Compilers from New Notions of Obfuscations.

Matteo Campanelli, Danilo Francati, Claudio Orlandi

IACR Cryptol. ePrint Arch., 2022

Witness Encryption for Succinct Functional Commitments and Applications.

Matteo Campanelli, Dario Fiore, Hamidreza Khoshakhlagh

IACR Cryptol. ePrint Arch., 2022

Encryption to the Future - A Paradigm for Sending Secret Messages to Future (Anonymous) Committees.

Matteo Campanelli, Bernardo David, Hamidreza Khoshakhlagh, Anders Konring, Jesper Buus Nielsen

Proceedings of the Advances in Cryptology - ASIACRYPT 2022, 2022

2021

Succinct Publicly-Certifiable Proofs (or: Can a Blockchain Verify a Designated-Verifier Proof?).

Matteo Campanelli, Hamidreza Khoshakhlagh

IACR Cryptol. ePrint Arch., 2021

Veksel: Simple, Efficient, Anonymous Payments with Large Anonymity Sets from Well-Studied Assumptions.

Matteo Campanelli, Mathias Hall-Andersen

IACR Cryptol. ePrint Arch., 2021

Succinct Zero-Knowledge Batch Proofs for Set Accumulators.

Matteo Campanelli, Dario Fiore, Semin Han, Jihye Kim, Dimitris Kolonelos, Hyunok Oh

IACR Cryptol. ePrint Arch., 2021

Zero-Knowledge for Homomorphic Key-Value Commitments with Applications to Privacy-Preserving Ledgers.

Matteo Campanelli, Felix Engelmann, Claudio Orlandi

IACR Cryptol. ePrint Arch., 2021

Encryption to the Future: A Paradigm for Sending Secret Messages to Future (Anonymous) Committees.

Matteo Campanelli, Bernardo David, Hamidreza Khoshakhlagh, Anders K. Kristensen, Jesper Buus Nielsen

IACR Cryptol. ePrint Arch., 2021

ECLIPSE: Enhanced Compiling method for Pedersen-committed zkSNARK Engines.

Diego F. Aranha, Emil Madsen Bennedsen, Matteo Campanelli, Chaya Ganesh, Claudio Orlandi, Akira Takahashi

IACR Cryptol. ePrint Arch., 2021

2020

Vector Commitment Techniques and Applications to Verifiable Decentralized Storage.

Matteo Campanelli, Dario Fiore, Nicola Greco, Dimitris Kolonelos, Luca Nizzardo

IACR Cryptol. ePrint Arch., 2020

Lunar: a Toolbox for More Efficient Universal and Updatable zkSNARKs and Commit-and-Prove Extensions.

Matteo Campanelli, Antonio Faonio, Dario Fiore, Anaïs Querol, Hadrián Rodríguez

IACR Cryptol. ePrint Arch., 2020

Incrementally Aggregatable Vector Commitments and Applications to Verifiable Decentralized Storage.

Matteo Campanelli, Dario Fiore, Nicola Greco, Dimitris Kolonelos, Luca Nizzardo

Proceedings of the Advances in Cryptology - ASIACRYPT 2020, 2020

2019

LegoSNARK: Modular Design and Composition of Succinct Zero-Knowledge Proofs.

Matteo Campanelli, Dario Fiore, Anaïs Querol

IACR Cryptol. ePrint Arch., 2019

Zero-Knowledge Proofs for Set Membership: Efficient, Succinct, Modular.

Daniel Benarroch, Matteo Campanelli, Dario Fiore, Dimitris Kolonelos

IACR Cryptol. ePrint Arch., 2019

2018

Rationality and Efficient Verifiable Computation.

Matteo Campanelli

PhD thesis, 2018

Fine-Grained Secure Computation.

Matteo Campanelli, Rosario Gennaro

IACR Cryptol. ePrint Arch., 2018

2017

Zero-Knowledge Contingent Payments Revisited: Attacks and Payments for Services.

Matteo Campanelli, Rosario Gennaro, Steven Goldfeder, Luca Nizzardo

IACR Cryptol. ePrint Arch., 2017

Efficient Rational Proofs for Space Bounded Computations.

Matteo Campanelli, Rosario Gennaro

Proceedings of the Decision and Game Theory for Security - 8th International Conference, 2017

Jumping the Air Gap: Modeling Cyber-Physical Attack Paths in the Internet-of-Things.

Ioannis Agadakos, Chien-Ying Chen, Matteo Campanelli, Prashant Anantharaman, Monowar Hasan, Bogdan Copos, Tancrède Lepoint, Michael E. Locasto, Gabriela F. Ciocarlie, Ulf Lindqvist

Proceedings of the 2017 Workshop on Cyber-Physical Systems Security and PrivaCy, 2017

2015

Sequentially Composable Rational Proofs.

Matteo Campanelli, Rosario Gennaro

Proceedings of the Decision and Game Theory for Security - 6th International Conference, 2015

2012

Pattern Matching with Swaps in Practice.

Matteo Campanelli, Domenico Cantone, Simone Faro, Emanuele Giaquinta

Int. J. Found. Comput. Sci., 2012

2009

An Efficient Algorithm for Approximate Pattern Matching with Swaps.

Matteo Campanelli, Domenico Cantone, Simone Faro, Emanuele Giaquinta

Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic, August 31, 2009

A New Algorithm for Efficient Pattern Matching with Swaps.

Matteo Campanelli, Domenico Cantone, Simone Faro

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009