Secure computation with low communication from cross-checking

DOI10.1007/978-3-030-03332-3_3zbMath1447.94041OpenAlexW2794855042MaRDI QIDQ1710664

Xiao Wang, S. Dov Gordon, Samuel Ranellucci

Publication date: 23 January 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-03332-3_3

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (3)

MPClan: protocol suite for privacy-conscious computations ⋮ Attaining GOD beyond honest majority with friends and foes ⋮ Efficient fully secure computation via distributed zero-knowledge proofs

Cites Work

• Unnamed Item
• The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited
• Yet another compiler for active security or: efficient MPC over arbitrary rings
• Security and composition of multiparty cryptographic protocols
• Secure multi-party computation without agreement
• Efficient Multiparty Protocols via Log-Depth Threshold Formulae
• Efficient Three-Party Computation from Cut-and-Choose
• Multiparty Computation from Somewhat Homomorphic Encryption
• A New Approach to Practical Active-Secure Two-Party Computation
• Semi-homomorphic Encryption and Multiparty Computation
• Efficient Constant Round Multi-party Computation Combining BMR and SPDZ
• Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
• Scalable Multiparty Computation with Nearly Optimal Work and Resilience
• Founding Cryptography on Oblivious Transfer – Efficiently
• Asynchronous Multiparty Computation: Theory and Implementation
• Foundations of Cryptography
• Circuits resilient to additive attacks with applications to secure computation
• Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
• High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority
• Scalable Secure Multiparty Computation
• Public Key Cryptography - PKC 2006

This page was built for publication: Secure computation with low communication from cross-checking