Function secret sharing for mixed-mode and fixed-point secure computation

DOI10.1007/978-3-030-77886-6_30zbMath1479.94297OpenAlexW3109688427MaRDI QIDQ2056774

Yuval Ishai, Niv Gilboa, Elette Boyle, Nishant Kumar, Divya Gupta, Mayank Rathee, Nishanth Chandran

Publication date: 8 December 2021

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

zbMATH Keywords

mixed-mode secure computationpreprocessing model

Mathematics Subject Classification ID

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

Related Items (8)

MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications ⋮ Structure-aware private set intersection, with applications to fuzzy matching ⋮ Programmable distributed point functions ⋮ Correlated pseudorandomness from expand-accumulate codes ⋮ Half-tree: halving the cost of tree expansion in COT and DPF ⋮ Arithmetic sketching ⋮ One-message secure reductions: on the cost of converting correlations ⋮ Malicious secure, structure-aware private set intersection

Uses Software

• CrypTFlow2

Cites Work

• Unnamed Item
• Homomorphic secret sharing from Paillier encryption
• The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited
• Secure computation with preprocessing via function secret sharing
• Benchmarking privacy preserving scientific operations
• Turbospeedz: double your online SPDZ! Improving SPDZ using function dependent preprocessing
• Homomorphic secret sharing from lattices without FHE
• A note on the communication complexity of multiparty computation in the correlated randomness model
• Spooky Encryption and Its Applications
• Breaking the Circuit Size Barrier for Secure Computation Under DDH
• Function Secret Sharing
• More general completeness theorems for secure two-party computation
• Universally composable two-party and multi-party secure computation
• Improved Primitives for Secure Multiparty Integer Computation
• Efficient Binary Conversion for Paillier Encrypted Values
• Founding Cryptography on Oblivious Transfer – Efficiently
• Secure Arithmetic Computation with No Honest Majority
• Constant-Rounds, Almost-Linear Bit-Decomposition of Secret Shared Values
• On the Power of Correlated Randomness in Secure Computation
• Oblivious Polynomial Evaluation
• Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
• Theory of Cryptography

This page was built for publication: Function secret sharing for mixed-mode and fixed-point secure computation