Pages that link to "Item:Q5739211"
From MaRDI portal
The following pages link to The Exact Round Complexity of Secure Computation (Q5739211):
Displayed 31 items.
- Round optimal black-box ``commit-and-prove'' (Q1629413) (← links)
- What security can we achieve within 4 rounds? (Q2010586) (← links)
- Post-quantum multi-party computation (Q2056694) (← links)
- Succinct non-interactive secure computation (Q2119013) (← links)
- On the round complexity of secure quantum computation (Q2120084) (← links)
- On the round complexity of black-box secure MPC (Q2128561) (← links)
- Round-optimal and communication-efficient multiparty computation (Q2169992) (← links)
- Round-optimal multi-party computation with identifiable abort (Q2170005) (← links)
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement (Q2175906) (← links)
- From FE combiners to secure MPC and back (Q2175912) (← links)
- On the exact round complexity of best-of-both-worlds multi-party computation (Q2691581) (← links)
- Blockchains enable non-interactive MPC (Q2697855) (← links)
- Oblivious transfer from trapdoor permutations in minimal rounds (Q2697874) (← links)
- The Feasibility of Outsourced Database Search in the Plain Model (Q2827726) (← links)
- What Security Can We Achieve Within 4 Rounds? (Q2827735) (← links)
- Concurrent Non-Malleable Commitments (and More) in 3 Rounds (Q2829950) (← links)
- Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity (Q3179364) (← links)
- More Efficient Constant-Round Multi-party Computation from BMR and SHE (Q3179370) (← links)
- On the Exact Round Complexity of Self-composable Two-Party Computation (Q5738974) (← links)
- On the exact round complexity of secure three-party computation (Q5918099) (← links)
- On the enumeration of minimal non-pairwise compatibility graphs (Q5918254) (← links)
- Round-optimal secure multi-party computation (Q5918346) (← links)
- Maliciously-secure MrNISC in the plain model (Q6061354) (← links)
- Statistical security in two-party computation revisited (Q6114269) (← links)
- Round-optimal black-box secure computation from two-round malicious OT (Q6114280) (← links)
- Knowledge encryption and its applications to simulatable protocols with low round-complexity (Q6135438) (← links)
- A new approach to efficient non-malleable zero-knowledge (Q6166959) (← links)
- Best of both worlds. Revisiting the spymasters double agent problem (Q6186596) (← links)
- Round-optimal black-box MPC in the plain model (Q6186598) (← links)
- Reusable secure computation in the plain model (Q6186599) (← links)
- List oblivious transfer and applications to round-optimal black-box multiparty coin tossing (Q6186600) (← links)