Function secret sharing
From MaRDI portal
Recommendations
Cited in
(91)- Efficient permutation correlations and batched random access for two-party computation
- Non-interactive distributed point functions
- Secure approximate nearest neighbor search with locality-sensitive hashing
- The power of NAPs: compressing OR-proofs via collision-resistant hashing
- Homomorphic secret sharing with verifiable evaluation
- Information-theoretic multi-server private information retrieval with client preprocessing
- Faster signatures from MPC-in-the-head
- On homomorphic secret sharing from polynomial-modulus LWE
- 3-party distributed ORAM from oblivious set membership
- Lower bounds for (batch) PIR with private preprocessing
- Oblivious transfer with constant computational overhead
- Direct FSS constructions for branching programs and more from PRGs with encoded-output homomorphism
- FOLEAGE: \(\mathbb{F}_4\)OLE-based multi-party computation for Boolean circuits
- Information-theoretic distributed point functions
- Constrained pseudorandom functions for inner-product predicates from weaker assumptions
- The hardness of LPN over any integer ring and field for PCG applications
- Efficient information-theoretic distributed point functions with general output groups
- DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead
- The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
- Cutting-edge cryptography through the lens of secret sharing
- Cutting-edge cryptography through the lens of secret sharing
- Survey of information security
- Function secret sharing for mixed-mode and fixed-point secure computation
- Correlated pseudorandomness from expand-accumulate codes
- SQL on structurally-encrypted databases
- Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model
- Multi-client oblivious RAM with poly-logarithmic communication
- Secure computation with preprocessing via function secret sharing
- Breaking the circuit size barrier for secure computation under DDH
- Simple and efficient two-server ORAM
- Sublinear-communication secure multiparty computation does not require FHE
- Constraining pseudorandom functions privately
- Private puncturable PRFs from standard lattice assumptions
- Programmable distributed point functions
- Foundations of homomorphic secret sharing
- MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications
- Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time
- Targeted lossy functions and applications
- Scooby: improved multi-party homomorphic secret sharing based on FHE
- New framework for structure-aware PSI from distributed function secret sharing
- Fuzzy private set intersection from VOLE
- Arithmetic sketching
- Malicious secure, structure-aware private set intersection
- \textsf{TreePIR}: sublinear-time and polylog-bandwidth private information retrieval from DDH
- Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN
- Pseudorandom correlation functions from Ring-LWR
- Fast pseudorandom correlation functions from sparse LPN
- Pseudorandom correlation functions for garbled circuits
- Multiparty homomorphic secret sharing and more from LPN and MQ
- Multi-server doubly efficient PIR in the classical model and beyond
- Instantiability of classical random-oracle-model encryption transforms
- Correlated pseudorandomness from the hardness of quasi-abelian decoding
- Spooky Encryption and Its Applications
- Low-communication multiparty triple generation for SPDZ from ring-LPN
- CNF-FSS and its applications
- Pseudorandom correlation functions from variable-density LPN, revisited
- Highly efficient OT-based multiplication protocols
- Lightweight, maliciously secure verifiable function secret sharing
- Single-server private information retrieval with sublinear amortized time
- Private information retrieval with sublinear online time
- Breaking the circuit size barrier for secure computation under quasi-polynomial LPN
- The rise of Paillier: homomorphic secret sharing and public-key silent OT
- Scooby: improved multi-party homomorphic secret sharing based on FHE
- Efficient pseudorandom correlation generators over \(\mathbb{Z}/p^k\mathbb{Z} \)
- Multiparty distributed point functions
- Improved trade-offs between amortization and download bandwidth for linear HSS
- Efficient pseudorandom correlation generators from ring-LPN
- Combiners for functional encryption, unconditionally
- Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness
- Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\)
- Efficient and generic methods to achieve active security in private information retrieval and more advanced database search
- BETA: biometric-enabled threshold authentication
- Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials
- Robust Distributed Pseudorandom Functions for mNP Access Structures
- The GGM Function Family Is a Weakly One-Way Family of Functions
- Efficient mixed garbling from homomorphic secret sharing and GGM-tree
- Simultaneous-message and succinct secure computation
- Efficient pseudorandom correlation generators for any finite field
- Structure-aware private set intersection, with applications to fuzzy matching
- 10-party sublinear secure computation from standard assumptions
- Computation efficient structure-aware PSI from incremental function secret sharing
- Compressing unit-vector correlations via sparse pseudorandom generators
- How to share a function securely
- A characterization of optimal-rate linear homomorphic secret sharing schemes, and applications
- Explicit and nearly tight lower bound for 2-party perfectly secure FSS
- Adaptively secure garbled circuits from one-way functions
- Homomorphic secret sharing for low degree polynomials
- Distributed pseudorandom functions for general access structures in NP
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
- Streaming and unbalanced PSI from function secret sharing
- Improved primitives for MPC over mixed arithmetic-binary circuits
This page was built for publication: Function secret sharing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2948389)
