Pages that link to "Item:Q5925697"
From MaRDI portal
The following pages link to Efficient perfectly secure computation with optimal resilience (Q5925697):
Displaying 12 items.
- A full proof of the BGW protocol for perfectly secure multiparty computation (Q514468) (← links)
- Perfect secure computation in two rounds (Q1629404) (← links)
- Secure computation with constant communication overhead using multiplication embeddings (Q1738071) (← links)
- Robust and secure implementation: equivalence theorems (Q2016223) (← links)
- Efficient constructions for almost-everywhere secure computation (Q2119011) (← links)
- Efficient fully secure computation via distributed zero-knowledge proofs (Q2691587) (← links)
- Efficient Proofs of Secure Erasure (Q2922679) (← links)
- General Statistically Secure Computation with Bounded-Resettable Hardware Tokens (Q5261634) (← links)
- Theory of Cryptography (Q5898371) (← links)
- Efficient perfectly secure computation with optimal resilience (Q5918515) (← links)
- Asymptotically free broadcast in constant expected time via packed VSS (Q6114239) (← links)
- On fully-secure honest majority MPC without \(n^2\) round overhead (Q6619922) (← links)