Volgen
Matteo Campanelli
Matteo Campanelli
Protocol Labs
Geverifieerd e-mailadres voor protocol.ai - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
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
1322017
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
842019
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
372017
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
292019
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
232020
Incrementally aggregatable vector commitments and applications to verifiable decentralized storage
M Campanelli, D Fiore, N Greco, D Kolonelos, L Nizzardo
International Conference on the Theory and Application of Cryptology and …, 2020
222020
Sequentially composable rational proofs
M Campanelli, R Gennaro
International Conference on Decision and Game Theory for Security, 270-288, 2015
162015
A new algorithm for efficient pattern matching with swaps
M Campanelli, D Cantone, S Faro
International Workshop on Combinatorial Algorithms, 230-241, 2009
162009
Fine-grained secure computation
M Campanelli, R Gennaro
Theory of Cryptography Conference, 66-97, 2018
122018
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
9*2020
Efficient rational proofs for space bounded computations
M Campanelli, R Gennaro
International Conference on Decision and Game Theory for Security, 53-73, 2017
82017
Encryption to the future: A paradigm for sending secret messages to future (anonymous) committees
M Campanelli, B David, H Khoshakhlagh, A Konring, JB Nielsen
Cryptology ePrint Archive, 2021
72021
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
52022
Veksel: Simple, efficient, anonymous payments with large anonymity sets from well-studied assumptions
M Campanelli, M Hall-Andersen
IACR Cryptology ePrint Archive, 2021
52021
Modeling cyber-physical attack paths in the internet-of-things
GF Ciocarlie, I Agadakos, CY Chen, M Campanelli, P Anantharaman, ...
US Patent App. 16/634,591, 2020
52020
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
Proposal: commit-and-prove zero-knowledge proof systems and extensions
D Benarroch, M Campanelli, D Fiore, J Kim, J Lee, H Oh, A Querol
4th ZKProof Workshop, 2021
42021
An Efficient Algorithm for Approximate Pattern Matching with Swaps.
M Campanelli, D Cantone, S Faro, E Giaquinta
Stringology, 90-104, 2009
32009
Succinct Publicly-Certifiable Proofs (or: Can a Blockchain Verify a Designated-Verifier Proof?)
M Campanelli, H Khoshakhlagh
International Conference on Cryptology in India, 607-631, 2021
22021
Succinct Zero-Knowledge Batch Proofs for Set Accumulators
M Campanelli, D Fiore, S Han, J Kim, D Kolonelos, H Oh
Cryptology ePrint Archive, 2021
22021
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20