Pages that link to "Item:Q5199188"
From MaRDI portal
The following pages link to Secure Computation on the Web: Computing without Simultaneous Interaction (Q5199188):
Displaying 24 items.
- Best possible information-theoretic MPC (Q1631330) (← links)
- Succinct garbling schemes from functional encryption through a local simulation paradigm (Q1631342) (← links)
- Threshold garbled circuits and ad hoc secure computation (Q2056781) (← links)
- MPC with friends and foes (Q2096545) (← links)
- Broadcast-optimal two-round MPC (Q2119034) (← links)
- Non-interactive secure multiparty computation for symmetric functions, revisited: more efficient constructions and extensions (Q2128566) (← links)
- Evolving homomorphic secret sharing for hierarchical access structures (Q2128751) (← links)
- Is information-theoretic topology-hiding computation possible? (Q2175925) (← links)
- On the exact round complexity of best-of-both-worlds multi-party computation (Q2691581) (← links)
- Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation? (Q2691585) (← links)
- Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation (Q2691603) (← links)
- Blockchains enable non-interactive MPC (Q2697855) (← links)
- Privacy Assurances in Multiple Data-Aggregation Transactions (Q3193250) (← links)
- Multikey Fully Homomorphic Encryption and Applications (Q4599146) (← links)
- On the Bottleneck Complexity of MPC with Correlated Randomness (Q5087257) (← links)
- Perfect Secure Computation in Two Rounds (Q5149757) (← links)
- Topology-Hiding Computation Beyond Logarithmic Diameter (Q5270378) (← links)
- Circuit-Private Multi-key FHE (Q5738758) (← links)
- Scalable Multi-party Private Set-Intersection (Q5738787) (← links)
- On the exact round complexity of secure three-party computation (Q5918099) (← links)
- On the enumeration of minimal non-pairwise compatibility graphs (Q5918254) (← links)
- Topology-hiding computation on all graphs (Q5919491) (← links)
- Beyond honest majority: the round complexity of fair and robust multi-party computation (Q6109085) (← links)
- Must the communication graph of MPC protocols be an expander? (Q6110384) (← links)
