Secure Computation on the Web: Computing without Simultaneous Interaction

DOI10.1007/978-3-642-22792-9_8zbMath1287.94070OpenAlexW1519947574MaRDI QIDQ5199188

Benny Pinkas, Yehuda Lindell, Shai Halevi

Publication date: 12 August 2011

Published in: Advances in Cryptology – CRYPTO 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22792-9_8

Mathematics Subject Classification ID

Cryptography (94A60) Applications of graph theory to circuits and networks (94C15) Combinatorial codes (94B25)

Related Items (29)

Non-interactive secure multiparty computation for symmetric functions, revisited: more efficient constructions and extensions ⋮ Evolving homomorphic secret sharing for hierarchical access structures ⋮ Best possible information-theoretic MPC ⋮ Succinct garbling schemes from functional encryption through a local simulation paradigm ⋮ Privacy Assurances in Multiple Data-Aggregation Transactions ⋮ On the Bottleneck Complexity of MPC with Correlated Randomness ⋮ Is information-theoretic topology-hiding computation possible? ⋮ Multi-key and multi-input predicate encryption from learning with errors ⋮ How to obfuscate MPC inputs ⋮ Towards practical topology-hiding computation ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ Reusable secure computation in the plain model ⋮ Secure computation with shared EPR pairs (or: how to teleport in zero-knowledge) ⋮ On the exact round complexity of best-of-both-worlds multi-party computation ⋮ Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation? ⋮ Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation ⋮ Blockchains enable non-interactive MPC ⋮ Must the communication graph of MPC protocols be an expander? ⋮ Perfect Secure Computation in Two Rounds ⋮ Circuit-Private Multi-key FHE ⋮ Scalable Multi-party Private Set-Intersection ⋮ Beyond honest majority: the round complexity of fair and robust multi-party computation ⋮ Topology-hiding computation on all graphs ⋮ On the exact round complexity of secure three-party computation ⋮ On the enumeration of minimal non-pairwise compatibility graphs ⋮ Threshold garbled circuits and ad hoc secure computation ⋮ MPC with friends and foes ⋮ Topology-Hiding Computation Beyond Logarithmic Diameter ⋮ Broadcast-optimal two-round MPC

This page was built for publication: Secure Computation on the Web: Computing without Simultaneous Interaction