Matteo Campanelli

Orcid: 0000-0001-8184-4704

According to our database1, Matteo Campanelli authored at least 35 papers between 2009 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Zero-knowledge proofs for set membership: efficient, succinct, modular.
Des. Codes Cryptogr., November, 2023

Testudo: Linear Time Prover SNARKs with Constant Size Proofs and Square Root Size Universal Setup.
IACR Cryptol. ePrint Arch., 2023

How to Make Rational Arguments Practical and Extractable.
IACR Cryptol. ePrint Arch., 2023

Lookup Arguments: Improvements, Extensions and Applications to Zero-Knowledge Decision Trees.
IACR Cryptol. ePrint Arch., 2023

Advancing Scalability in Decentralized Storage: A Novel Approach to Proof-of-Replication via Polynomial Evaluation.
IACR Cryptol. ePrint Arch., 2023

Curve Trees: Practical and Transparent Zero-Knowledge Accumulators.
Proceedings of the 32nd USENIX Security Symposium, 2023

sfTestudo: Linear Time Prover SNARKs with Constant Size Proofs and Square Root Size Universal Setup.
Proceedings of the Progress in Cryptology - LATINCRYPT 2023, 2023

Witness-Authenticated Key Exchange, Revisited: Extensions to Groups, Improved Models, Simpler Constructions.
Proceedings of the Financial Cryptography and Data Security, 2023

2022
Linear-map Vector Commitments and their Practical Applications.
IACR Cryptol. ePrint Arch., 2022

Curve Trees: Practical and Transparent Zero-Knowledge Accumulators.
IACR Cryptol. ePrint Arch., 2022

Witness-Authenticated Key Exchange Revisited: Improved Models, Simpler Constructions, Extensions to Groups.
IACR Cryptol. ePrint Arch., 2022

Impossibilities in Succinct Arguments: Black-box Extraction and More.
IACR Cryptol. ePrint Arch., 2022

Structure-Preserving Compilers from New Notions of Obfuscations.
IACR Cryptol. ePrint Arch., 2022

Witness Encryption for Succinct Functional Commitments and Applications.
IACR Cryptol. ePrint Arch., 2022

Encryption to the Future - A Paradigm for Sending Secret Messages to Future (Anonymous) Committees.
Proceedings of the Advances in Cryptology - ASIACRYPT 2022, 2022

2021
Succinct Publicly-Certifiable Proofs (or: Can a Blockchain Verify a Designated-Verifier Proof?).
IACR Cryptol. ePrint Arch., 2021

Veksel: Simple, Efficient, Anonymous Payments with Large Anonymity Sets from Well-Studied Assumptions.
IACR Cryptol. ePrint Arch., 2021

Succinct Zero-Knowledge Batch Proofs for Set Accumulators.
IACR Cryptol. ePrint Arch., 2021

Zero-Knowledge for Homomorphic Key-Value Commitments with Applications to Privacy-Preserving Ledgers.
IACR Cryptol. ePrint Arch., 2021

Encryption to the Future: A Paradigm for Sending Secret Messages to Future (Anonymous) Committees.
IACR Cryptol. ePrint Arch., 2021

ECLIPSE: Enhanced Compiling method for Pedersen-committed zkSNARK Engines.
IACR Cryptol. ePrint Arch., 2021

2020
Vector Commitment Techniques and Applications to Verifiable Decentralized Storage.
IACR Cryptol. ePrint Arch., 2020

Lunar: a Toolbox for More Efficient Universal and Updatable zkSNARKs and Commit-and-Prove Extensions.
IACR Cryptol. ePrint Arch., 2020

Incrementally Aggregatable Vector Commitments and Applications to Verifiable Decentralized Storage.
Proceedings of the Advances in Cryptology - ASIACRYPT 2020, 2020

2019
LegoSNARK: Modular Design and Composition of Succinct Zero-Knowledge Proofs.
IACR Cryptol. ePrint Arch., 2019

Zero-Knowledge Proofs for Set Membership: Efficient, Succinct, Modular.
IACR Cryptol. ePrint Arch., 2019

2018
Rationality and Efficient Verifiable Computation.
PhD thesis, 2018

Fine-Grained Secure Computation.
IACR Cryptol. ePrint Arch., 2018

2017
Zero-Knowledge Contingent Payments Revisited: Attacks and Payments for Services.
IACR Cryptol. ePrint Arch., 2017

Efficient Rational Proofs for Space Bounded Computations.
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.
Proceedings of the 2017 Workshop on Cyber-Physical Systems Security and PrivaCy, 2017

2015
Sequentially Composable Rational Proofs.
Proceedings of the Decision and Game Theory for Security - 6th International Conference, 2015

2012
Pattern Matching with Swaps in Practice.
Int. J. Found. Comput. Sci., 2012

2009
An Efficient Algorithm for Approximate Pattern Matching with Swaps.
Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic, August 31, 2009

A New Algorithm for Efficient Pattern Matching with Swaps.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009


  Loading...