Pages that link to "Item:Q5021134"
From MaRDI portal
The following pages link to How to Simulate It – A Tutorial on the Simulation Proof Technique (Q5021134):
Displaying 13 items.
- How to simulate it in Isabelle: towards formal proof for secure multi-party computation (Q1687724) (← links)
- OpenPGP email forwarding via diverted elliptic curve Diffie-Hellman key exchanges (Q2079910) (← links)
- Black-box transformations from passive to covert security with public verifiability (Q2096543) (← links)
- Two-round oblivious transfer from CDH or LPN (Q2119032) (← links)
- Computational hardness of optimal fair computation: beyond Minicrypt (Q2128555) (← links)
- MPC-in-multi-heads: a multi-prover zero-knowledge proof system (or: how to jointly prove any NP statements in ZK) (Q2148762) (← links)
- When Is a Semi-honest Secure Multiparty Computation Valuable? (Q3297650) (← links)
- On the exact round complexity of secure three-party computation (Q5918099) (← links)
- Beyond honest majority: the round complexity of fair and robust multi-party computation (Q6109085) (← links)
- MPClan: protocol suite for privacy-conscious computations (Q6110388) (← links)
- A coercion-resistant blockchain-based E-voting protocol with receipts (Q6112251) (← links)
- Linear-time 2-party secure merge from additively homomorphic encryption (Q6168324) (← links)
- Categorical composable cryptography: extended version (Q6178713) (← links)
