Follow
Matteo Campanelli
Matteo Campanelli
Protocol Labs
Verified email at protocol.ai - Homepage
Title
Cited by
Cited by
Year
Zero-knowledge contingent payments revisited: Attacks and payments for services
M Campanelli, R Gennaro, S Goldfeder, L Nizzardo
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications …, 2017
1732017
Legosnark: Modular design and composition of succinct zero-knowledge proofs
M Campanelli, D Fiore, A Querol
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications …, 2019
1372019
Zero-knowledge Proofs for Set Membership: Efficient, Succinct, Modular
D Benarroch, M Campanelli, D Fiore, K Gurkan, D Kolonelos
modular. Cryptology ePrint Archive, Report 2019/1255, 2019. https://eprint …, 2019
562019
Jumping the air gap: Modeling cyber-physical attack paths in the Internet-of-Things
I Agadakos, CY Chen, M Campanelli, P Anantharaman, M Hasan, ...
Proceedings of the 2017 workshop on cyber-physical systems security and …, 2017
56*2017
Lunar: a Toolbox for More Efficient Universal and Updatable zkSNARKs and Commit-and-Prove Extensions
M Campanelli, A Faonio, D Fiore, A Querol, H Rodríguez
IACR Cryptology ePrint Archive, 2020
51*2020
Incrementally aggregatable vector commitments and applications to verifiable decentralized storage
M Campanelli, D Fiore, N Greco, D Kolonelos, L Nizzardo
Advances in Cryptology–ASIACRYPT 2020: 26th International Conference on the …, 2020
432020
Encryption to the future: a paradigm for sending secret messages to future (anonymous) committees
M Campanelli, B David, H Khoshakhlagh, A Konring, JB Nielsen
International Conference on the Theory and Application of Cryptology and …, 2022
23*2022
Sequentially composable rational proofs
M Campanelli, R Gennaro
International Conference on Decision and Game Theory for Security, 270-288, 2015
182015
A new algorithm for efficient pattern matching with swaps
M Campanelli, D Cantone, S Faro
International Workshop on Combinatorial Algorithms, 230-241, 2009
162009
ECLIPSE: enhanced compiling method for Pedersen-committed zkSNARK engines
DF Aranha, EM Bennedsen, M Campanelli, C Ganesh, C Orlandi, ...
IACR International Conference on Public-Key Cryptography, 584-614, 2022
152022
Fine-grained secure computation
M Campanelli, R Gennaro
Theory of Cryptography Conference, 66-97, 2018
142018
Succinct zero-knowledge batch proofs for set accumulators
M Campanelli, D Fiore, S Han, J Kim, D Kolonelos, H Oh
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications …, 2022
132022
Vector Commitment Techniques and Applications to Verifiable Decentralized Storage.
M Campanelli, D Fiore, N Greco, D Kolonelos, L Nizzardo
IACR Cryptol. ePrint Arch. 2020, 149, 2020
12*2020
Efficient rational proofs for space bounded computations
M Campanelli, R Gennaro
Decision and Game Theory for Security: 8th International Conference, GameSec …, 2017
102017
Impossibilities in succinct arguments: Black-box extraction and more
M Campanelli, C Ganesh, H Khoshakhlagh, J Siim
International Conference on Cryptology in Africa, 465-489, 2023
72023
Veksel: Simple, efficient, anonymous payments with large anonymity sets from well-studied assumptions
M Campanelli, M Hall-Andersen
IACR Cryptology ePrint Archive, 2021
72021
Linear-Map Vector Commitments and Their Practical Applications
M Campanelli, A Nitulescu, C Ràfols, A Zacharakis, A Zapico
International Conference on the Theory and Application of Cryptology and …, 2022
62022
Pattern matching with swaps in practice
M Campanelli, D Cantone, S Faro, E Giaquinta
International Journal of Foundations of Computer Science 23 (02), 323-342, 2012
52012
Curve Trees: Practical and Transparent Zero-Knowledge Accumulators
M Campanelli, M Hall-Andersen, SH Kamp
32nd USENIX Security Symposium (USENIX Security 23), 4391-4408, 2023
42023
Zero-knowledge for homomorphic key-value commitments with applications to privacy-preserving ledgers
M Campanelli, F Engelmann, C Orlandi
International Conference on Security and Cryptography for Networks, 761-784, 2022
42022
The system can't perform the operation now. Try again later.
Articles 1–20