Secure computation with low communication from cross-checking
From MaRDI portal
Recommendations
- Secure two-party computation with low communication
- Secure computation with minimal interaction, revisited
- Communication and Randomness Lower Bounds for Secure Computation
- On the communication complexity of secure computation
- Unconditionally secure computation with reduced interaction
- Unconditionally secure computation against low-complexity leakage
- Unconditionally secure computation against low-complexity leakage
- Almost-Everywhere Secure Computation
- scientific article; zbMATH DE number 1676641
- Secure multiparty computation with minimal interaction
Cites work
- scientific article; zbMATH DE number 176564 (Why is no real title available?)
- A new approach to practical active-secure two-party computation
- Asynchronous Multiparty Computation: Theory and Implementation
- Circuits resilient to additive attacks with applications to secure computation
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
- Efficient constant round multi-party computation combining BMR and SPDZ
- Efficient multiparty protocols via log-depth threshold formulae. (Extended abstract)
- Efficient three-party computation from cut-and-choose
- Foundations of Cryptography
- Founding Cryptography on Oblivious Transfer – Efficiently
- High-throughput secure three-party computation for malicious adversaries and an honest majority
- Multiparty Computation from Somewhat Homomorphic Encryption
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- Public Key Cryptography - PKC 2006
- Scalable Multiparty Computation with Nearly Optimal Work and Resilience
- Scalable Secure Multiparty Computation
- Secure multi-party computation without agreement
- Security and composition of multiparty cryptographic protocols
- Semi-homomorphic encryption and multiparty computation
- The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited
- Yet another compiler for active security or: efficient MPC over arbitrary rings
Cited in
(5)- Attaining GOD beyond honest majority with friends and foes
- Communication and Randomness Lower Bounds for Secure Computation
- Private Decision Tree Evaluation with Constant Rounds via (Only) Fair SS-4PC
- Efficient fully secure computation via distributed zero-knowledge proofs
- MPClan: protocol suite for privacy-conscious computations
This page was built for publication: Secure computation with low communication from cross-checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1710664)
