The complexity of multiparty PSM protocols and related models

DOI10.1007/978-3-319-78375-8_10zbMath1428.94059OpenAlexW2795260699MaRDI QIDQ1648834

Eyal Kushilevitz, Amos Beimel, Pnina Nissim

Publication date: 9 July 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-78375-8_10

Mathematics Subject Classification ID

Cryptography (94A60) Network protocols (68M12)

Related Items

Non-interactive secure multiparty computation for symmetric functions, revisited: more efficient constructions and extensions ⋮ On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate ⋮ Measuring, simulating and exploiting the head concavity phenomenon in BKZ ⋮ Private simultaneous messages based on quadratic residues ⋮ Multi-party PSM, revisited: improved communication and unbalanced communication ⋮ Optimal linear multiparty conditional disclosure of secrets protocols ⋮ Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations ⋮ Placing conditional disclosure of secrets in the communication complexity universe ⋮ On abelian and homomorphic secret sharing schemes ⋮ Threshold garbled circuits and ad hoc secure computation