Matteo Campanelli

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 48

Top Topics

Formal Definitions

Ring Signature Scheme

Top Venues

IACR Cryptol. ePrint Arch.

Public Key Cryptography (2)

Publications

Matteo Campanelli, Dario Fiore, Hamidreza Khoshakhlagh
Witness Encryption for Succinct Functional Commitments and Applications. Public Key Cryptography (2) (2024)
Giuseppe Ateniese, Foteini Baldimtsi, Matteo Campanelli, Danilo Francati, Ioanna Karantaidou
Advancing Scalability in Decentralized Storage: A Novel Approach to Proof-of-Replication via Polynomial Evaluation. CRYPTO (2) (2024)
Matteo Campanelli, Dario Fiore, Rosario Gennaro
Natively Compatible Super-Efficient Lookup Arguments and How to Apply Them. IACR Cryptol. ePrint Arch. 2024 (2024)
Matteo Campanelli, Chaya Ganesh, Rosario Gennaro
How to Make Rational Arguments Practical and Extractable. IACR Commun. Cryptol. 1 (1) (2024)
Matteo Campanelli, Antonio Faonio, Dario Fiore, Tianyu Li, Helger Lipmaa
Lookup Arguments: Improvements, Extensions and Applications to Zero-Knowledge Decision Trees. Public Key Cryptography (2) (2024)
Daniel Benarroch, Matteo Campanelli, Dario Fiore, Kobi Gurkan, Dimitris Kolonelos
Zero-knowledge proofs for set membership: efficient, succinct, modular. Des. Codes Cryptogr. 91 (11) (2023)
Giuseppe Ateniese, Foteini Baldimtsi, Matteo Campanelli, Danilo Francati, Ioanna Karantaidou
Advancing Scalability in Decentralized Storage: A Novel Approach to Proof-of-Replication via Polynomial Evaluation. IACR Cryptol. ePrint Arch. 2023 (2023)
Matteo Campanelli, Danilo Francati, Claudio Orlandi
Structure-Preserving Compilers from New Notions of Obfuscations. Public Key Cryptography (2) (2023)
Matteo Campanelli, Chaya Ganesh, Hamidreza Khoshakhlagh, Janno Siim
Impossibilities in Succinct Arguments: Black-Box Extraction and More. AFRICACRYPT (2023)
Matteo Campanelli, Antonio Faonio, Dario Fiore, Tianyu Li, Helger Lipmaa
Lookup Arguments: Improvements, Extensions and Applications to Zero-Knowledge Decision Trees. IACR Cryptol. ePrint Arch. 2023 (2023)
Matteo Campanelli, Rosario Gennaro, Kelsey Melissaris, Luca Nizzardo
Witness-Authenticated Key Exchange, Revisited: Extensions to Groups, Improved Models, Simpler Constructions. FC (1) (2023)
Matteo Campanelli, Chaya Ganesh, Rosario Gennaro
How to Make Rational Arguments Practical and Extractable. IACR Cryptol. ePrint Arch. 2023 (2023)
Matteo Campanelli, Nicolas Gailly, Rosario Gennaro, Philipp Jovanovic, Mara Mihali, Justin Thaler
sfTestudo: Linear Time Prover SNARKs with Constant Size Proofs and Square Root Size Universal Setup. LATINCRYPT (2023)
Matteo Campanelli, Mathias Hall-Andersen, Simon Holmgaard Kamp
Curve Trees: Practical and Transparent Zero-Knowledge Accumulators. USENIX Security Symposium (2023)
Matteo Campanelli, Nicolas Gailly, Rosario Gennaro, Philipp Jovanovic, Mara Mihali, Justin Thaler
Testudo: Linear Time Prover SNARKs with Constant Size Proofs and Square Root Size Universal Setup. IACR Cryptol. ePrint Arch. 2023 (2023)
Matteo Campanelli, Rosario Gennaro, Kelsey Melissaris, Luca Nizzardo
Witness-Authenticated Key Exchange Revisited: Improved Models, Simpler Constructions, Extensions to Groups. IACR Cryptol. ePrint Arch. 2022 (2022)
Matteo Campanelli, Bernardo David, Hamidreza Khoshakhlagh, Anders Konring, Jesper Buus Nielsen
Encryption to the Future - A Paradigm for Sending Secret Messages to Future (Anonymous) Committees. ASIACRYPT (3) (2022)
Matteo Campanelli, Felix Engelmann, Claudio Orlandi
Zero-Knowledge for Homomorphic Key-Value Commitments with Applications to Privacy-Preserving Ledgers. SCN (2022)
Matteo Campanelli, Anca Nitulescu, Carla Ràfols, Alexandros Zacharakis, Arantxa Zapico
Linear-Map Vector Commitments and Their Practical Applications. ASIACRYPT (4) (2022)
Matteo Campanelli, Mathias Hall-Andersen
Veksel: Simple, Efficient, Anonymous Payments with Large Anonymity Sets from Well-Studied Assumptions. AsiaCCS (2022)
Diego F. Aranha, Emil Madsen Bennedsen, Matteo Campanelli, Chaya Ganesh, Claudio Orlandi, Akira Takahashi
ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines. Public Key Cryptography (1) (2022)
Matteo Campanelli, Dario Fiore, Hamidreza Khoshakhlagh
Witness Encryption for Succinct Functional Commitments and Applications. IACR Cryptol. ePrint Arch. 2022 (2022)
Matteo Campanelli, Chaya Ganesh, Hamidreza Khoshakhlagh, Janno Siim
Impossibilities in Succinct Arguments: Black-box Extraction and More. IACR Cryptol. ePrint Arch. 2022 (2022)
Matteo Campanelli, Dario Fiore, Semin Han, Jihye Kim, Dimitris Kolonelos, Hyunok Oh
Succinct Zero-Knowledge Batch Proofs for Set Accumulators. CCS (2022)
Matteo Campanelli, Anca Nitulescu, Carla Ràfols, Alexandros Zacharakis, Arantxa Zapico
Linear-map Vector Commitments and their Practical Applications. IACR Cryptol. ePrint Arch. 2022 (2022)
Matteo Campanelli, Mathias Hall-Andersen
Curve Trees: Practical and Transparent Zero-Knowledge Accumulators. IACR Cryptol. ePrint Arch. 2022 (2022)
Matteo Campanelli, Danilo Francati, Claudio Orlandi
Structure-Preserving Compilers from New Notions of Obfuscations. IACR Cryptol. ePrint Arch. 2022 (2022)
Matteo Campanelli, Felix Engelmann, Claudio Orlandi
Zero-Knowledge for Homomorphic Key-Value Commitments with Applications to Privacy-Preserving Ledgers. IACR Cryptol. ePrint Arch. 2021 (2021)
Daniel Benarroch, Matteo Campanelli, Dario Fiore, Kobi Gurkan, Dimitris Kolonelos
Zero-Knowledge Proofs for Set Membership: Efficient, Succinct, Modular. Financial Cryptography (1) (2021)
Matteo Campanelli, Hamidreza Khoshakhlagh
Succinct Publicly-Certifiable Proofs - Or, Can a Blockchain Verify a Designated-Verifier Proof? INDOCRYPT (2021)
Matteo Campanelli, Bernardo David, Hamidreza Khoshakhlagh, Anders K. Kristensen, Jesper Buus Nielsen
Encryption to the Future: A Paradigm for Sending Secret Messages to Future (Anonymous) Committees. IACR Cryptol. ePrint Arch. 2021 (2021)
Diego F. Aranha, Emil Madsen Bennedsen, Matteo Campanelli, Chaya Ganesh, Claudio Orlandi, Akira Takahashi
ECLIPSE: Enhanced Compiling method for Pedersen-committed zkSNARK Engines. IACR Cryptol. ePrint Arch. 2021 (2021)
Matteo Campanelli, Mathias Hall-Andersen
Veksel: Simple, Efficient, Anonymous Payments with Large Anonymity Sets from Well-Studied Assumptions. IACR Cryptol. ePrint Arch. 2021 (2021)
Matteo Campanelli, Dario Fiore, Semin Han, Jihye Kim, Dimitris Kolonelos, Hyunok Oh
Succinct Zero-Knowledge Batch Proofs for Set Accumulators. IACR Cryptol. ePrint Arch. 2021 (2021)
Matteo Campanelli, Hamidreza Khoshakhlagh
Succinct Publicly-Certifiable Proofs (or: Can a Blockchain Verify a Designated-Verifier Proof?). IACR Cryptol. ePrint Arch. 2021 (2021)
Matteo Campanelli, Antonio Faonio, Dario Fiore, Anaïs Querol, Hadrián Rodríguez
Lunar: A Toolbox for More Efficient Universal and Updatable zkSNARKs and Commit-and-Prove Extensions. ASIACRYPT (3) (2021)
Matteo Campanelli, Antonio Faonio, Dario Fiore, Anaïs Querol, Hadrián Rodríguez
Lunar: a Toolbox for More Efficient Universal and Updatable zkSNARKs and Commit-and-Prove Extensions. IACR Cryptol. ePrint Arch. 2020 (2020)
Matteo Campanelli, Dario Fiore, Nicola Greco, Dimitris Kolonelos, Luca Nizzardo
Incrementally Aggregatable Vector Commitments and Applications to Verifiable Decentralized Storage. ASIACRYPT (2) (2020)
Matteo Campanelli, Dario Fiore, Nicola Greco, Dimitris Kolonelos, Luca Nizzardo
Vector Commitment Techniques and Applications to Verifiable Decentralized Storage. IACR Cryptol. ePrint Arch. 2020 (2020)
Matteo Campanelli, Dario Fiore, Anaïs Querol
LegoSNARK: Modular Design and Composition of Succinct Zero-Knowledge Proofs. CCS (2019)
Matteo Campanelli, Dario Fiore, Anaïs Querol
LegoSNARK: Modular Design and Composition of Succinct Zero-Knowledge Proofs. IACR Cryptol. ePrint Arch. 2019 (2019)
Daniel Benarroch, Matteo Campanelli, Dario Fiore, Dimitris Kolonelos
Zero-Knowledge Proofs for Set Membership: Efficient, Succinct, Modular. IACR Cryptol. ePrint Arch. 2019 (2019)
Matteo Campanelli, Rosario Gennaro
Fine-Grained Secure Computation. TCC (2) (2018)
Matteo Campanelli, Rosario Gennaro
Fine-Grained Secure Computation. IACR Cryptol. ePrint Arch. 2018 (2018)
Ioannis Agadakos, Chien-Ying Chen, Matteo Campanelli, Prashant Anantharaman, Monowar Hasan, Bogdan Copos, Tancrède Lepoint, Michael E. Locasto, Gabriela F. Ciocarlie, Ulf Lindqvist
Jumping the Air Gap: Modeling Cyber-Physical Attack Paths in the Internet-of-Things. CPS-SPC@CCS (2017)
Matteo Campanelli, Rosario Gennaro, Steven Goldfeder, Luca Nizzardo
Zero-Knowledge Contingent Payments Revisited: Attacks and Payments for Services. CCS (2017)
Matteo Campanelli, Rosario Gennaro, Steven Goldfeder, Luca Nizzardo
Zero-Knowledge Contingent Payments Revisited: Attacks and Payments for Services. IACR Cryptol. ePrint Arch. 2017 (2017)
Matteo Campanelli, Rosario Gennaro
Efficient Rational Proofs for Space Bounded Computations. GameSec (2017)
Matteo Campanelli, Rosario Gennaro
Sequentially Composable Rational Proofs. GameSec (2015)
Matteo Campanelli, Domenico Cantone, Simone Faro, Emanuele Giaquinta
Pattern Matching with Swaps in Practice. Int. J. Found. Comput. Sci. 23 (2) (2012)
Matteo Campanelli, Domenico Cantone, Simone Faro, Emanuele Giaquinta
An Efficient Algorithm for Approximate Pattern Matching with Swaps. Stringology (2009)
Matteo Campanelli, Domenico Cantone, Simone Faro
A New Algorithm for Efficient Pattern Matching with Swaps. IWOCA (2009)