Michele Ciampi

Orcid: 0000-0001-5062-0388

According to our database1, Michele Ciampi authored at least 46 papers between 2016 and 2026.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Round and Computational Efficiency of Multi-party Protocols
Information Security and Cryptography, Springer, ISBN: 978-3-031-92373-9, 2026

2025
PrivaDE: Privacy-preserving Data Evaluation for Blockchain-based Data Marketplaces.
CoRR, October, 2025

Broadcast-Optimal Secure Computation From Black-Box Oblivious Transfer.
IACR Cryptol. ePrint Arch., 2025

Robust Non-Interactive Zero-Knowledge Combiners.
IACR Cryptol. ePrint Arch., 2025

Universally Composable Transaction Order Fairness: Refined Definitions and Adaptive Security.
IACR Cryptol. ePrint Arch., 2025

Cross-chain Lightning Trades: Getting the Advantages of a Custodial Exchange while Keeping Your Assets.
IACR Cryptol. ePrint Arch., 2025

Information-Theoretic Broadcast-Optimal MPC.
IACR Cryptol. ePrint Arch., 2025

Round-Optimal Black-Box Multiparty Computation from Polynomial-Time Assumptions.
Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

Black-Box Constant-Round Secure 2PC with Succinct Communication.
Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

Universal Adaptor Signatures from Blackbox Multi-party Computation.
Proceedings of the Topics in Cryptology - CT-RSA 2025, 2025

Universally Composable SNARKs with Transparent Setup without Programmable Random Oracle.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

Two-Tier Black-Box Blockchains and Application to Instant Layer-1 Payments.
Proceedings of the 7th Conference on Advances in Financial Technologies, 2025

Delayed-Input Multi-party Computation.
Proceedings of the Applied Cryptography and Network Security, 2025

2024
Universal Composable Transaction Serialization with Order Fairness.
Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

Black-Box (and Fast) Non-malleable Zero Knowledge.
Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

2023
Broadcast-Optimal Four-Round MPC in the Plain Model.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023

Agile Cryptography: A Universally Composable Approach.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023

List Oblivious Transfer and Applications to Round-Optimal Black-Box Multiparty Coin Tossing.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

Multi-Theorem Fiat-Shamir Transform from Correlation-Intractable Hash Functions.
Proceedings of the Applied Cryptography and Network Security, 2023

2022
Four-Round Black-Box Non-Malleable Commitments from One-Way Permutations.
IACR Cryptol. ePrint Arch., 2022

Agile Cryptography: A Composable Approach.
IACR Cryptol. ePrint Arch., 2022

Four-Round Black-Box Non-malleable Schemes from One-Way Permutations.
Proceedings of the Theory of Cryptography - 20th International Conference, 2022

Round-Optimal Multi-party Computation with Identifiable Abort.
Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

Round-Optimal and Communication-Efficient Multiparty Computation.
Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

Collusion-Preserving Computation without a Mediator.
Proceedings of the 35th IEEE Computer Security Foundations Symposium, 2022

FairMM: A Fast and Frontrunning-Resistant Crypto Market-Maker.
Proceedings of the Cyber Security, Cryptology, and Machine Learning, 2022

Etherless Ethereum Tokens: Simulating Native Tokens in Ethereum.
Proceedings of the Cyber Security, Cryptology, and Machine Learning, 2022

Efficient NIZK Arguments with Straight-Line Simulation and Extraction.
Proceedings of the Cryptology and Network Security - 21st International Conference, 2022

2021
Oblivious Transfer from Trapdoor Permutations in Minimal Rounds.
Proceedings of the Theory of Cryptography - 19th International Conference, 2021

Multi-Client Functional Encryption for Separable Functions.
Proceedings of the Public-Key Cryptography - PKC 2021, 2021

Threshold Garbled Circuits and Ad Hoc Secure Computation.
Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

2020
Secure Quantum Two-Party Computation: Impossibility and Constructions.
IACR Cryptol. ePrint Arch., 2020

Round Optimal Secure Multiparty Computation from Minimal Assumptions.
Proceedings of the Theory of Cryptography - 18th International Conference, 2020

On Adaptive Security of Delayed-Input Sigma Protocols and Fiat-Shamir NIZKs.
Proceedings of the Security and Cryptography for Networks - 12th International Conference, 2020

Updatable Blockchains.
Proceedings of the Computer Security - ESORICS 2020, 2020

Timed Signatures and Zero-Knowledge Proofs - Timestamping in the Blockchain Era -.
Proceedings of the Applied Cryptography and Network Security, 2020

2019
Four-Round Secure Multiparty Computation from General Assumptions.
IACR Cryptol. ePrint Arch., 2019

2018
Combining Private Set-Intersection with Secure Two-Party Computation.
Proceedings of the Security and Cryptography for Networks - 11th International Conference, 2018

2017
Delayed-Input Non-Malleable Zero Knowledge and Multi-Party Coin Tossing in Four Rounds.
Proceedings of the Theory of Cryptography - 15th International Conference, 2017

Round-Optimal Secure Two-Party Computation from Trapdoor Permutations.
Proceedings of the Theory of Cryptography - 15th International Conference, 2017

Four-Round Concurrent Non-Malleable Commitments from One-Way Functions.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

2016
On Round-Efficient Non-Malleable Protocols.
IACR Cryptol. ePrint Arch., 2016

A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles.
Proceedings of the Theory of Cryptography - 13th International Conference, 2016

Improved OR-Composition of Sigma-Protocols.
Proceedings of the Theory of Cryptography - 13th International Conference, 2016

Online/Offline OR Composition of Sigma Protocols.
Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

Concurrent Non-Malleable Commitments (and More) in 3 Rounds.
Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016


  Loading...