The following pages link to Function Secret Sharing (Q2948389):
Displayed 50 items.
- Cutting-edge cryptography through the lens of secret sharing (Q1627968) (← links)
- SQL on structurally-encrypted databases (Q1633448) (← links)
- Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model (Q1633458) (← links)
- Simple and efficient two-server ORAM (Q1710667) (← links)
- Homomorphic secret sharing for low degree polynomials (Q1710675) (← links)
- Private information retrieval with sublinear online time (Q2055601) (← links)
- Combiners for functional encryption, unconditionally (Q2055605) (← links)
- The rise of Paillier: homomorphic secret sharing and public-key silent OT (Q2056710) (← links)
- Breaking the circuit size barrier for secure computation under quasi-polynomial LPN (Q2056771) (← links)
- Function secret sharing for mixed-mode and fixed-point secure computation (Q2056774) (← links)
- BETA: biometric-enabled threshold authentication (Q2061958) (← links)
- Efficient pseudorandom correlation generators from ring-LPN (Q2096531) (← links)
- Improved primitives for MPC over mixed arithmetic-binary circuits (Q2096551) (← links)
- Targeted lossy functions and applications (Q2139643) (← links)
- MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications (Q2139646) (← links)
- Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time (Q2139652) (← links)
- Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials (Q2152064) (← links)
- Lightweight, maliciously secure verifiable function secret sharing (Q2169998) (← links)
- Highly efficient OT-based multiplication protocols (Q2169999) (← links)
- Single-server private information retrieval with sublinear amortized time (Q2170035) (← links)
- Secure computation with preprocessing via function secret sharing (Q2175917) (← links)
- Survey of information security (Q2385398) (← links)
- Multi-client oblivious RAM with poly-logarithmic communication (Q2692380) (← links)
- Cutting-Edge Cryptography Through the Lens of Secret Sharing (Q2799105) (← links)
- Spooky Encryption and Its Applications (Q2829944) (← links)
- Adaptively Secure Garbled Circuits from One-Way Functions (Q2829946) (← links)
- Breaking the Circuit Size Barrier for Secure Computation Under DDH (Q2835599) (← links)
- The GGM Function Family Is a Weakly One-Way Family of Functions (Q3179353) (← links)
- Foundations of Homomorphic Secret Sharing (Q4993284) (← links)
- The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO (Q5041157) (← links)
- Low-Communication Multiparty Triple Generation for SPDZ from Ring-LPN (Q5087258) (← links)
- CNF-FSS and Its Applications (Q5087261) (← links)
- Constraining Pseudorandom Functions Privately (Q5738766) (← links)
- Private Puncturable PRFs from Standard Lattice Assumptions (Q5738885) (← links)
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation (Q5738973) (← links)
- Sublinear-communication secure multiparty computation does not require FHE (Q6061356) (← links)
- On homomorphic secret sharing from polynomial-modulus LWE (Q6067348) (← links)
- Pseudorandom correlation functions from variable-density LPN, revisited (Q6067361) (← links)
- Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness (Q6085266) (← links)
- Structure-aware private set intersection, with applications to fuzzy matching (Q6097267) (← links)
- Programmable distributed point functions (Q6111543) (← links)
- Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\) (Q6132407) (← links)
- 3-party distributed ORAM from oblivious set membership (Q6134831) (← links)
- Scooby: improved multi-party homomorphic secret sharing based on FHE (Q6134842) (← links)
- Streaming and unbalanced PSI from function secret sharing (Q6134846) (← links)
- Oblivious transfer with constant computational overhead (Q6138086) (← links)
- Lower bounds for (batch) PIR with private preprocessing (Q6138100) (← links)
- Correlated pseudorandomness from expand-accumulate codes (Q6162058) (← links)
- Instantiability of classical random-oracle-model encryption transforms (Q6175981) (← links)
- Arithmetic sketching (Q6186591) (← links)