Function Secret Sharing

From MaRDI portal
Publication:2948389

DOI10.1007/978-3-662-46803-6_12zbMath1371.94664OpenAlexW4378527334MaRDI QIDQ2948389

Yuval Ishai, Elette Boyle, Niv Gilboa

Publication date: 30 September 2015

Published in: Advances in Cryptology - EUROCRYPT 2015 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-46803-6_12




Related Items (55)

The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iOCutting-edge cryptography through the lens of secret sharingSQL on structurally-encrypted databasesTweakable block ciphers secure beyond the birthday bound in the ideal cipher modelTargeted lossy functions and applicationsMPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applicationsPuncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and timeThe GGM Function Family Is a Weakly One-Way Family of FunctionsSurvey of information securityConstructive \(t\)-secure homomorphic secret sharing for low degree polynomialsLightweight, maliciously secure verifiable function secret sharingHighly efficient OT-based multiplication protocolsSingle-server private information retrieval with sublinear amortized timeLow-Communication Multiparty Triple Generation for SPDZ from Ring-LPNCNF-FSS and Its ApplicationsSecure computation with preprocessing via function secret sharingSublinear-communication secure multiparty computation does not require FHEOn homomorphic secret sharing from polynomial-modulus LWEPseudorandom correlation functions from variable-density LPN, revisitedPrivately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomnessStructure-aware private set intersection, with applications to fuzzy matchingProgrammable distributed point functionsThreshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\)3-party distributed ORAM from oblivious set membershipScooby: improved multi-party homomorphic secret sharing based on FHEStreaming and unbalanced PSI from function secret sharingOblivious transfer with constant computational overheadLower bounds for (batch) PIR with private preprocessingCorrelated pseudorandomness from expand-accumulate codesInstantiability of classical random-oracle-model encryption transformsScooby: improved multi-party homomorphic secret sharing based on FHEArithmetic sketchingMalicious secure, structure-aware private set intersection\textsf{TreePIR}: sublinear-time and polylog-bandwidth private information retrieval from DDHMulti-party homomorphic secret sharing and sublinear MPC from sparse LPNCorrelated pseudorandomness from the hardness of quasi-abelian decodingMulti-client oblivious RAM with poly-logarithmic communicationSimple and efficient two-server ORAMHomomorphic secret sharing for low degree polynomialsFoundations of Homomorphic Secret SharingConstraining Pseudorandom Functions PrivatelyPrivate Puncturable PRFs from Standard Lattice AssumptionsGroup-Based Secure Computation: Optimizing Rounds, Communication, and ComputationCutting-Edge Cryptography Through the Lens of Secret SharingPrivate information retrieval with sublinear online timeCombiners for functional encryption, unconditionallyThe rise of Paillier: homomorphic secret sharing and public-key silent OTBreaking the circuit size barrier for secure computation under quasi-polynomial LPNFunction secret sharing for mixed-mode and fixed-point secure computationBETA: biometric-enabled threshold authenticationSpooky Encryption and Its ApplicationsAdaptively Secure Garbled Circuits from One-Way FunctionsBreaking the Circuit Size Barrier for Secure Computation Under DDHEfficient pseudorandom correlation generators from ring-LPNImproved primitives for MPC over mixed arithmetic-binary circuits




This page was built for publication: Function Secret Sharing