Distributed Point Functions and Their Applications
From MaRDI portal
Publication:5418720
DOI10.1007/978-3-642-55220-5_35zbMath1328.68054OpenAlexW139740867WikidataQ63090561 ScholiaQ63090561MaRDI QIDQ5418720
Publication date: 27 May 2014
Published in: Advances in Cryptology – EUROCRYPT 2014 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-55220-5_35
Database theory (68P15) Data encryption (aspects in computer science) (68P25) Information storage and retrieval of data (68P20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (36)
Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model ⋮ Targeted lossy functions and applications ⋮ Function-private conditional disclosure of secrets and multi-evaluation threshold distributed point functions ⋮ Lightweight, maliciously secure verifiable function secret sharing ⋮ Single-server private information retrieval with sublinear amortized time ⋮ Reusable Two-Round MPC from LPN ⋮ Low-Communication Multiparty Triple Generation for SPDZ from Ring-LPN ⋮ CNF-FSS and Its Applications ⋮ Secure computation with preprocessing via function secret sharing ⋮ MPCCache: privacy-preserving multi-party cooperative cache sharing at the edge ⋮ Sublinear-communication secure multiparty computation does not require FHE ⋮ On homomorphic secret sharing from polynomial-modulus LWE ⋮ Pseudorandom correlation functions from variable-density LPN, revisited ⋮ Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness ⋮ Programmable distributed point functions ⋮ 3-party distributed ORAM from oblivious set membership ⋮ Scooby: improved multi-party homomorphic secret sharing based on FHE ⋮ Streaming and unbalanced PSI from function secret sharing ⋮ Oblivious transfer with constant computational overhead ⋮ Optimal single-server private information retrieval ⋮ Lower bounds for (batch) PIR with private preprocessing ⋮ Scooby: improved multi-party homomorphic secret sharing based on FHE ⋮ Half-tree: halving the cost of tree expansion in COT and DPF ⋮ Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN ⋮ Multi-client oblivious RAM with poly-logarithmic communication ⋮ Homomorphic secret sharing for low degree polynomials ⋮ Foundations of Homomorphic Secret Sharing ⋮ Constraining Pseudorandom Functions Privately ⋮ Private Puncturable PRFs from Standard Lattice Assumptions ⋮ Private information retrieval with sublinear online time ⋮ The rise of Paillier: homomorphic secret sharing and public-key silent OT ⋮ Breaking the circuit size barrier for secure computation under quasi-polynomial LPN ⋮ Spooky Encryption and Its Applications ⋮ Adaptively Secure Garbled Circuits from One-Way Functions ⋮ Breaking the Circuit Size Barrier for Secure Computation Under DDH ⋮ Efficient pseudorandom correlation generators from ring-LPN
This page was built for publication: Distributed Point Functions and Their Applications
