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

DOI10.1007/978-3-030-77886-6_30zbMATH Open1479.94297OpenAlexW3109688427MaRDI QIDQ2056774FDOQ2056774

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

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

zbMATH Keywords

mixed-mode secure computationpreprocessing model

Mathematics Subject Classification ID

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

Cites Work

• Founding Cryptography on Oblivious Transfer – Efficiently
• Secure Arithmetic Computation with No Honest Majority
• Oblivious Polynomial Evaluation
• Universally composable two-party and multi-party secure computation
• Title not available (Why is that?)
• More general completeness theorems for secure two-party computation
• Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
• The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited
• Improved primitives for secure multiparty integer computation
• Theory of Cryptography
• On the power of correlated randomness in secure computation
• Homomorphic secret sharing from Paillier encryption
• 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
• 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
• Efficient Binary Conversion for Paillier Encrypted Values
• Constant-Rounds, Almost-Linear Bit-Decomposition of Secret Shared Values

Cited In (18)

• Recent advances in function and homomorphic secret sharing (invited talk)
• Correlated pseudorandomness from expand-accumulate codes
• Title not available (Why is that?)
• 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

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)