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

DOI10.1007/978-3-030-77886-6_30MaRDI QIDQ2056774zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Secure computation with preprocessing via function secret sharing
• Function secret sharing
• CNF-FSS and its applications
• Recent advances in function and homomorphic secret sharing (invited talk)
• Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation

Cites work

• scientific article; zbMATH DE number 176564 (Why is no real title available?)
• A note on the communication complexity of multiparty computation in the correlated randomness model
• Benchmarking privacy preserving scientific operations
• Breaking the circuit size barrier for secure computation under DDH
• Constant-Rounds, Almost-Linear Bit-Decomposition of Secret Shared Values
• Efficient Binary Conversion for Paillier Encrypted Values
• Founding Cryptography on Oblivious Transfer – Efficiently
• Function secret sharing
• Homomorphic secret sharing from Paillier encryption
• Homomorphic secret sharing from lattices without FHE
• Improved primitives for secure multiparty integer computation
• More general completeness theorems for secure two-party computation
• Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
• Oblivious Polynomial Evaluation
• On the power of correlated randomness in secure computation
• Secure Arithmetic Computation with No Honest Majority
• Secure computation with preprocessing via function secret sharing
• Spooky Encryption and Its Applications
• The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited
• Theory of Cryptography
• Turbospeedz: double your online SPDZ! Improving SPDZ using function dependent preprocessing
• Universally composable two-party and multi-party secure computation

Cited in

(18)

• Recent advances in function and homomorphic secret sharing (invited talk)
• scientific article; zbMATH DE number 1583777 (Why is no real title available?)
• Correlated pseudorandomness from expand-accumulate codes
• Secure computation with preprocessing via function secret sharing
• Programmable distributed point functions
• MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications
• Half-tree: halving the cost of tree expansion in COT and DPF
• Function-private conditional disclosure of secrets and multi-evaluation threshold distributed point functions
• Arithmetic sketching
• Malicious secure, structure-aware private set intersection
• One-message secure reductions: on the cost of converting correlations
• CNF-FSS and its applications
• Lightweight, maliciously secure verifiable function secret sharing
• Protecting distributed primitives against leakage: equivocal secret sharing and more
• Structure-aware private set intersection, with applications to fuzzy matching
• Computation efficient structure-aware PSI from incremental function secret sharing
• Explicit and nearly tight lower bound for 2-party perfectly secure FSS
• A new approach to efficient and secure fixed-point computation

Describes a project that uses

Uses Software

• CrypTFlow2

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2056774)