Pages that link to "Item:Q1648834"
From MaRDI portal
The following pages link to The complexity of multiparty PSM protocols and related models (Q1648834):
Displaying 12 items.
- On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate (Q1629415) (← links)
- Measuring, simulating and exploiting the head concavity phenomenon in BKZ (Q1633461) (← links)
- Optimal linear multiparty conditional disclosure of secrets protocols (Q1710680) (← links)
- Placing conditional disclosure of secrets in the communication complexity universe (Q2035998) (← links)
- On abelian and homomorphic secret sharing schemes (Q2051370) (← links)
- Threshold garbled circuits and ad hoc secure computation (Q2056781) (← links)
- Non-interactive secure multiparty computation for symmetric functions, revisited: more efficient constructions and extensions (Q2128566) (← links)
- Multi-party PSM, revisited: improved communication and unbalanced communication (Q2697857) (← links)
- Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations (Q5149756) (← links)
- Private simultaneous messages based on quadratic residues (Q6070349) (← links)
- Explicit lower bounds for communication complexity of PSM for concrete functions (Q6623345) (← links)
- Garbled circuit lookup tables with logarithmic number of ciphertexts (Q6637543) (← links)
