default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatteo Campanelli
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j3]Matteo Campanelli
, Chaya Ganesh, Rosario Gennaro:
How to Make Rational Arguments Practical and Extractable. IACR Commun. Cryptol. 1(1): 19 (2024)- [c26]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: 3-39 - [c25]Matteo Campanelli, Dario Fiore, Hamidreza Khoshakhlagh:
Witness Encryption for Succinct Functional Commitments and Applications. Public Key Cryptography (2) 2024: 132-167 - [c24]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: 337-369 - [i28]Matteo Campanelli, Dario Fiore, Rosario Gennaro:
Natively Compatible Super-Efficient Lookup Arguments and How to Apply Them. IACR Cryptol. ePrint Arch. 2024: 1058 (2024) - [i27]Matteo Campanelli, Mathias Hall-Andersen:
Fully-Succinct Arguments over the Integers from First Principles. IACR Cryptol. ePrint Arch. 2024: 1548 (2024) - [i26]Christian Badertscher, Matteo Campanelli, Michele Ciampi, Luigi Russo, Luisa Siniscalchi:
Universally Composable SNARKs with Transparent Setup without Programmable Random Oracle. IACR Cryptol. ePrint Arch. 2024: 1549 (2024) - [i25]Matteo Campanelli, Antonio Faonio, Luigi Russo:
SNARKs for Virtual Machines are Non-Malleable. IACR Cryptol. ePrint Arch. 2024: 1551 (2024) - [i24]Matteo Campanelli, Agni Datta:
Fiat-Shamir Goes Rational. IACR Cryptol. ePrint Arch. 2024: 1645 (2024) - [i23]Matteo Campanelli, Mathias Hall-Andersen, Simon Holmgaard Kamp:
Curve Forests: Transparent Zero-Knowledge Set Membership with Batching and Strong Security. IACR Cryptol. ePrint Arch. 2024: 1647 (2024) - 2023
- [j2]Daniel Benarroch, Matteo Campanelli, Dario Fiore, Kobi Gurkan, Dimitris Kolonelos:
Zero-knowledge proofs for set membership: efficient, succinct, modular. Des. Codes Cryptogr. 91(11): 3457-3525 (2023) - [c23]Matteo Campanelli, Chaya Ganesh, Hamidreza Khoshakhlagh, Janno Siim:
Impossibilities in Succinct Arguments: Black-Box Extraction and More. AFRICACRYPT 2023: 465-489 - [c22]Matteo Campanelli, Rosario Gennaro, Kelsey Melissaris, Luca Nizzardo:
Witness-Authenticated Key Exchange, Revisited: Extensions to Groups, Improved Models, Simpler Constructions. FC (1) 2023: 112-128 - [c21]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: 331-351 - [c20]Matteo Campanelli, Danilo Francati, Claudio Orlandi:
Structure-Preserving Compilers from New Notions of Obfuscations. Public Key Cryptography (2) 2023: 663-693 - [c19]Matteo Campanelli, Mathias Hall-Andersen, Simon Holmgaard Kamp:
Curve Trees: Practical and Transparent Zero-Knowledge Accumulators. USENIX Security Symposium 2023: 4391-4408 - [i22]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: 961 (2023) - [i21]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: 1518 (2023) - [i20]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: 1569 (2023) - [i19]Matteo Campanelli, Chaya Ganesh, Rosario Gennaro:
How to Make Rational Arguments Practical and Extractable. IACR Cryptol. ePrint Arch. 2023: 1966 (2023) - 2022
- [c18]Matteo Campanelli, Mathias Hall-Andersen:
Veksel: Simple, Efficient, Anonymous Payments with Large Anonymity Sets from Well-Studied Assumptions. AsiaCCS 2022: 652-666 - [c17]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: 151-180 - [c16]Matteo Campanelli, Anca Nitulescu, Carla Ràfols, Alexandros Zacharakis, Arantxa Zapico:
Linear-Map Vector Commitments and Their Practical Applications. ASIACRYPT (4) 2022: 189-219 - [c15]Matteo Campanelli, Dario Fiore, Semin Han, Jihye Kim, Dimitris Kolonelos, Hyunok Oh:
Succinct Zero-Knowledge Batch Proofs for Set Accumulators. CCS 2022: 455-469 - [c14]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: 584-614 - [c13]Matteo Campanelli, Felix Engelmann, Claudio Orlandi:
Zero-Knowledge for Homomorphic Key-Value Commitments with Applications to Privacy-Preserving Ledgers. SCN 2022: 761-784 - [i18]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: 382 (2022) - [i17]Matteo Campanelli, Chaya Ganesh, Hamidreza Khoshakhlagh, Janno Siim:
Impossibilities in Succinct Arguments: Black-box Extraction and More. IACR Cryptol. ePrint Arch. 2022: 638 (2022) - [i16]Matteo Campanelli, Anca Nitulescu, Carla Ràfols, Alexandros Zacharakis, Arantxa Zapico:
Linear-map Vector Commitments and their Practical Applications. IACR Cryptol. ePrint Arch. 2022: 705 (2022) - [i15]Matteo Campanelli, Danilo Francati, Claudio Orlandi:
Structure-Preserving Compilers from New Notions of Obfuscations. IACR Cryptol. ePrint Arch. 2022: 732 (2022) - [i14]Matteo Campanelli, Mathias Hall-Andersen:
Curve Trees: Practical and Transparent Zero-Knowledge Accumulators. IACR Cryptol. ePrint Arch. 2022: 756 (2022) - [i13]Matteo Campanelli, Dario Fiore, Hamidreza Khoshakhlagh:
Witness Encryption for Succinct Functional Commitments and Applications. IACR Cryptol. ePrint Arch. 2022: 1510 (2022) - 2021
- [c12]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: 3-33 - [c11]Daniel Benarroch, Matteo Campanelli, Dario Fiore, Kobi Gurkan, Dimitris Kolonelos:
Zero-Knowledge Proofs for Set Membership: Efficient, Succinct, Modular. Financial Cryptography (1) 2021: 393-414 - [c10]Matteo Campanelli, Hamidreza Khoshakhlagh:
Succinct Publicly-Certifiable Proofs - Or, Can a Blockchain Verify a Designated-Verifier Proof? INDOCRYPT 2021: 607-631 - [i12]Matteo Campanelli, Mathias Hall-Andersen:
Veksel: Simple, Efficient, Anonymous Payments with Large Anonymity Sets from Well-Studied Assumptions. IACR Cryptol. ePrint Arch. 2021: 327 (2021) - [i11]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: 934 (2021) - [i10]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: 1423 (2021) - [i9]Matteo Campanelli, Hamidreza Khoshakhlagh:
Succinct Publicly-Certifiable Proofs (or: Can a Blockchain Verify a Designated-Verifier Proof?). IACR Cryptol. ePrint Arch. 2021: 1618 (2021) - [i8]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: 1672 (2021) - [i7]Matteo Campanelli, Felix Engelmann, Claudio Orlandi:
Zero-Knowledge for Homomorphic Key-Value Commitments with Applications to Privacy-Preserving Ledgers. IACR Cryptol. ePrint Arch. 2021: 1678 (2021) - 2020
- [c9]Matteo Campanelli, Dario Fiore, Nicola Greco, Dimitris Kolonelos, Luca Nizzardo:
Incrementally Aggregatable Vector Commitments and Applications to Verifiable Decentralized Storage. ASIACRYPT (2) 2020: 3-35 - [i6]Matteo Campanelli, Dario Fiore, Nicola Greco, Dimitris Kolonelos, Luca Nizzardo:
Vector Commitment Techniques and Applications to Verifiable Decentralized Storage. IACR Cryptol. ePrint Arch. 2020: 149 (2020) - [i5]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: 1069 (2020)
2010 – 2019
- 2019
- [c8]Matteo Campanelli, Dario Fiore, Anaïs Querol:
LegoSNARK: Modular Design and Composition of Succinct Zero-Knowledge Proofs. CCS 2019: 2075-2092 - [i4]Matteo Campanelli, Dario Fiore, Anaïs Querol:
LegoSNARK: Modular Design and Composition of Succinct Zero-Knowledge Proofs. IACR Cryptol. ePrint Arch. 2019: 142 (2019) - [i3]Daniel Benarroch, Matteo Campanelli, Dario Fiore, Dimitris Kolonelos:
Zero-Knowledge Proofs for Set Membership: Efficient, Succinct, Modular. IACR Cryptol. ePrint Arch. 2019: 1255 (2019) - 2018
- [b1]Matteo Campanelli:
Rationality and Efficient Verifiable Computation. City University of New York, USA, 2018 - [c7]Matteo Campanelli, Rosario Gennaro:
Fine-Grained Secure Computation. TCC (2) 2018: 66-97 - [i2]Matteo Campanelli, Rosario Gennaro:
Fine-Grained Secure Computation. IACR Cryptol. ePrint Arch. 2018: 297 (2018) - 2017
- [c6]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: 37-48 - [c5]Matteo Campanelli, Rosario Gennaro, Steven Goldfeder, Luca Nizzardo:
Zero-Knowledge Contingent Payments Revisited: Attacks and Payments for Services. CCS 2017: 229-243 - [c4]Matteo Campanelli, Rosario Gennaro:
Efficient Rational Proofs for Space Bounded Computations. GameSec 2017: 53-73 - [i1]Matteo Campanelli, Rosario Gennaro, Steven Goldfeder, Luca Nizzardo:
Zero-Knowledge Contingent Payments Revisited: Attacks and Payments for Services. IACR Cryptol. ePrint Arch. 2017: 566 (2017) - 2015
- [c3]Matteo Campanelli, Rosario Gennaro:
Sequentially Composable Rational Proofs. GameSec 2015: 270-288 - 2012
- [j1]Matteo Campanelli, Domenico Cantone, Simone Faro, Emanuele Giaquinta:
Pattern Matching with Swaps in Practice. Int. J. Found. Comput. Sci. 23(2): 323-342 (2012)
2000 – 2009
- 2009
- [c2]Matteo Campanelli, Domenico Cantone, Simone Faro:
A New Algorithm for Efficient Pattern Matching with Swaps. IWOCA 2009: 230-241 - [c1]Matteo Campanelli, Domenico Cantone, Simone Faro, Emanuele Giaquinta:
An Efficient Algorithm for Approximate Pattern Matching with Swaps. Stringology 2009: 90-104
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 2024-11-11 21:26 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:
