Secure computation with preprocessing via function secret sharing

DOI10.1007/978-3-030-36030-6_14zbMath1455.94205OpenAlexW2990762906MaRDI QIDQ2175917

Elette Boyle, Niv Gilboa, Yuval Ishai

Publication date: 30 April 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-36030-6_14

zbMATH Keywords

PRG-based FSS schemesTinyTable protocol

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items

Sublinear GMW-style compiler for MPC with preprocessing ⋮ MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications ⋮ Secure multiparty computation with sublinear preprocessing ⋮ Programmable distributed point functions ⋮ Correlated pseudorandomness from expand-accumulate codes ⋮ Half-tree: halving the cost of tree expansion in COT and DPF ⋮ One-message secure reductions: on the cost of converting correlations ⋮ Malicious secure, structure-aware private set intersection ⋮ Function secret sharing for mixed-mode and fixed-point secure computation ⋮ A geometric approach to homomorphic secret sharing ⋮ Efficient pseudorandom correlation generators from ring-LPN ⋮ Improved primitives for MPC over mixed arithmetic-binary circuits

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimizing authenticated garbling for faster secure two-party computation
• New protocols for secure equality test and comparison
• The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited
• Security and composition of multiparty cryptographic protocols
• Turbospeedz: double your online SPDZ! Improving SPDZ using function dependent preprocessing
• A note on the communication complexity of multiparty computation in the correlated randomness model
• Efficient pseudorandom correlation generators: silent OT extension and more
• Multiparty Computation from Somewhat Homomorphic Encryption
• Function Secret Sharing
• Semi-homomorphic Encryption and Multiparty Computation
• Matching Vector Codes
• Foundations of Cryptography
• On the Power of Correlated Randomness in Secure Computation
• 3-Query Locally Decodable Codes of Subexponential Length
• New Bounds for Matching Vector Families
• Distributed Point Functions and Their Applications
• Theory of Cryptography

This page was built for publication: Secure computation with preprocessing via function secret sharing