The following pages link to Michele Ciampi (Q1678366):
Displaying 21 items.
- Four-round concurrent non-malleable commitments from one-way functions (Q1678367) (← links)
- Round-optimal secure two-party computation from trapdoor permutations (Q1690212) (← links)
- Delayed-input non-malleable zero knowledge and multi-party coin tossing in four rounds (Q1690213) (← links)
- Combining private set intersection with secure two-party computation (Q1796812) (← links)
- Threshold garbled circuits and ad hoc secure computation (Q2056781) (← links)
- Multi-client functional encryption for separable functions (Q2061944) (← links)
- On adaptive security of delayed-input sigma protocols and Fiat-Shamir NIZKs (Q2106675) (← links)
- Round optimal secure multiparty computation from minimal assumptions (Q2119049) (← links)
- Round-optimal multi-party computation with identifiable abort (Q2170005) (← links)
- Timed signatures and zero-knowledge proofs -- timestamping in the blockchain era (Q2229281) (← links)
- Oblivious transfer from trapdoor permutations in minimal rounds (Q2697874) (← links)
- Etherless Ethereum Tokens: simulating native tokens in Ethereum (Q2698288) (← links)
- A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles (Q2799091) (← links)
- Improved OR-Composition of Sigma-Protocols (Q2799092) (← links)
- Concurrent Non-Malleable Commitments (and More) in 3 Rounds (Q2829950) (← links)
- Online/Offline OR Composition of Sigma Protocols (Q5739198) (← links)
- Multi-theorem Fiat-Shamir transform from correlation-intractable hash functions (Q6535136) (← links)
- Broadcast-optimal four-round MPC in the plain model (Q6582165) (← links)
- Agile cryptography: a universally composable approach (Q6587964) (← links)
- Universal composable transaction serialization with order fairness (Q6648204) (← links)
- Black-box (and fast) non-malleable zero knowledge (Q6653055) (← links)
