Michele Ciampi

Orcid: 0000-0001-5062-0388

According to our database1, Michele Ciampi authored at least 32 papers between 2015 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Etherless Ethereum tokens: Simulating native tokens in Ethereum.
J. Comput. Syst. Sci., August, 2023

Multi-Theorem Fiat-Shamir Transform from Correlation-Intractable Hash Functions.
IACR Cryptol. ePrint Arch., 2023

Round-Optimal Black-Box Multiparty Computation from Polynomial-Time Assumptions.
IACR Cryptol. ePrint Arch., 2023

List Oblivious Transfer and Applications to Round-Optimal Black-Box Multiparty Coin Tossing.
IACR Cryptol. ePrint Arch., 2023

Broadcast-Optimal Four-Round MPC in the Plain Model.
IACR Cryptol. ePrint Arch., 2023

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

2022
Round-Optimal Multi-Party Computation with Identifiable Abort.
IACR Cryptol. ePrint Arch., 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

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

2021
FairMM: A Fast and Frontrunning-Resistant Crypto Market-Maker.
IACR Cryptol. ePrint Arch., 2021

Threshold Garbled Circuits and Ad Hoc Secure Computation.
IACR Cryptol. ePrint Arch., 2021

Oblivious Transfer from Trapdoor Permutations in Minimal Rounds.
IACR Cryptol. ePrint Arch., 2021

2020
Multi-Client Functional Encryption for Separable Functions.
IACR Cryptol. ePrint Arch., 2020

On Adaptive Security of Delayed-Input Sigma Protocols and Fiat-Shamir NIZKs.
IACR Cryptol. ePrint Arch., 2020

Round-Optimal and Communication-Efficient Multiparty Computation.
IACR Cryptol. ePrint Arch., 2020

Collusion-Preserving Computation without a Mediator.
IACR Cryptol. ePrint Arch., 2020

Updatable Blockchains.
IACR Cryptol. ePrint Arch., 2020

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

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

On Round Optimal Secure Multiparty Computation from Minimal Assumptions.
IACR Cryptol. ePrint Arch., 2019

Timed Signatures and Zero-Knowledge Proofs -Timestamping in the Blockchain Era-.
IACR Cryptol. ePrint Arch., 2019

2018
Combining Private Set-Intersection with Secure Two-Party Computation.
IACR Cryptol. ePrint Arch., 2018

2017
Delayed-Input Non-Malleable Zero Knowledge and Multi-Party Coin Tossing in Four Rounds.
IACR Cryptol. ePrint Arch., 2017

Round-Optimal Secure Two-Party Computation from Trapdoor Permutations.
IACR Cryptol. ePrint Arch., 2017

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

2016
Online/Offline OR Composition of Sigma Protocols.
IACR Cryptol. ePrint Arch., 2016

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

Concurrent Non-Malleable Commitments (and More) in 3 Rounds.
IACR Cryptol. ePrint Arch., 2016

2015
A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles.
IACR Cryptol. ePrint Arch., 2015

Improved OR Composition of Sigma-Protocols.
IACR Cryptol. ePrint Arch., 2015


  Loading...