Secure computation on the web: computing without simultaneous interaction
From MaRDI portal
Recommendations
Cited in
(46)- On the enumeration of minimal non-pairwise compatibility graphs
- Non-interactive distributed point functions
- Scalable multi-party private set-intersection
- Two-Party Computing with Encrypted Data
- Beyond honest majority: the round complexity of fair and robust multi-party computation
- Broadcast-optimal two-round MPC
- Multi-key and multi-input predicate encryption (for conjunctions) from learning with errors
- Secure computation for big data
- Multi-key and multi-input predicate encryption from learning with errors
- On the exact round complexity of secure three-party computation
- On the round complexity of fully secure solitary MPC with honest majority
- Best possible information-theoretic MPC
- Succinct garbling schemes from functional encryption through a local simulation paradigm
- Perfect secure computation in two rounds
- Unconditionally secure multiparty computation for symmetric functions with low bottleneck complexity
- Topology-hiding computation beyond logarithmic diameter
- On the bottleneck complexity of MPC with correlated randomness
- Cross-domain secure computation
- Reusable secure computation in the plain model
- Information-theoretic broadcast-optimal MPC
- scientific article; zbMATH DE number 1559560 (Why is no real title available?)
- Secure computation with shared EPR pairs (or: how to teleport in zero-knowledge)
- Threshold garbled circuits and ad hoc secure computation
- Non-interactive secure multiparty computation for symmetric functions, revisited: more efficient constructions and extensions
- Three specific secure computation service protocols
- Multi-party computation of polynomials and branching programs without simultaneous interaction
- Privacy assurances in multiple data-aggregation transactions
- \textsf{OPA}: one-shot private aggregation with single client interaction and its applications to federated learning
- Topology-hiding computation on all graphs
- Rerandomizable garbling, revisited
- Secure multiparty computation of symmetric functions with polylogarithmic bottleneck complexity and correlated randomness
- Is information-theoretic topology-hiding computation possible?
- Circuit-private multi-key FHE
- Efficient multiparty private simultaneous messages for symmetric functions
- Simultaneous-message and succinct secure computation
- Multi-key homomorphic secret sharing
- Multikey fully homomorphic encryption and applications
- Must the communication graph of MPC protocols be an expander?
- 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
- Evolving homomorphic secret sharing for hierarchical access structures
- Blockchains enable non-interactive MPC
- How to obfuscate MPC inputs
- Towards practical topology-hiding computation
- MPC with friends and foes
This page was built for publication: Secure computation on the web: computing without simultaneous interaction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5199188)
