Michele Ciampi

From MaRDI portal
Person:1678366

Available identifiers

zbMath Open ciampi.micheleWikidataQ112186353 ScholiaQ112186353MaRDI QIDQ1678366

List of research outcomes





PublicationDate of PublicationType
Black-box (and fast) non-malleable zero knowledge2024-12-13Paper
Universal composable transaction serialization with order fairness2024-12-04Paper
Agile cryptography: a universally composable approach2024-08-15Paper
Broadcast-optimal four-round MPC in the plain model2024-08-02Paper
List oblivious transfer and applications to round-optimal black-box multiparty coin tossing2024-02-02Paper
Multi-theorem Fiat-Shamir transform from correlation-intractable hash functions2023-11-10Paper
Four-round black-box non-malleable schemes from one-way permutations2023-08-14Paper
Efficient NIZK arguments with straight-line simulation and extraction2023-07-28Paper
Etherless Ethereum Tokens: simulating native tokens in Ethereum2023-04-21Paper
Oblivious transfer from trapdoor permutations in minimal rounds2023-04-13Paper
On adaptive security of delayed-input sigma protocols and Fiat-Shamir NIZKs2022-12-16Paper
Round-optimal multi-party computation with identifiable abort2022-08-30Paper
Round optimal secure multiparty computation from minimal assumptions2022-03-23Paper
Multi-client functional encryption for separable functions2021-12-21Paper
Threshold garbled circuits and ad hoc secure computation2021-12-08Paper
Timed signatures and zero-knowledge proofs -- timestamping in the blockchain era2021-02-23Paper
Combining private set intersection with secure two-party computation2018-10-17Paper
Round-optimal secure two-party computation from trapdoor permutations2018-01-19Paper
Delayed-input non-malleable zero knowledge and multi-party coin tossing in four rounds2018-01-19Paper
Four-round concurrent non-malleable commitments from one-way functions2017-11-15Paper
Concurrent Non-Malleable Commitments (and More) in 3 Rounds2016-11-09Paper
Online/Offline OR Composition of Sigma Protocols2016-07-15Paper
A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles2016-04-08Paper
Improved OR-Composition of Sigma-Protocols2016-04-08Paper

Research outcomes over time

This page was built for person: Michele Ciampi