Multiparty distributed point functions
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1261806 (Why is no real title available?)
- 10-party sublinear secure computation from standard assumptions
- 3-party secure computation for RAMs: optimal and concretely efficient
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- Computation efficient structure-aware PSI from incremental function secret sharing
- Cryptography from planted graphs: security with logarithmic-size messages
- DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead
- Distributed Oblivious RAM for Secure Two-Party Computation
- Distributed Point Functions and Their Applications
- Efficient 3-party distributed ORAM
- Efficient pseudorandom correlation generators from ring-LPN
- Efficient pseudorandom correlation generators: silent OT extension and more
- Function secret sharing
- Function secret sharing for mixed-mode and fixed-point secure computation
- How to share a secret
- Information-theoretic distributed point functions
- Locally decodable codes and private information retrieval schemes.
- Low-degree security of the planted random subgraph problem
- Malicious secure, structure-aware private set intersection
- Programmable distributed point functions
- Secure computation with preprocessing via function secret sharing
- Software protection and simulation on oblivious RAMs
- Structure-aware private set intersection, with applications to fuzzy matching
- Succinct homomorphic secret sharing
- The power of NAPs: compressing OR-proofs via collision-resistant hashing
- Theory of Cryptography
- Translated Poisson approximation for Markov chains
This page was built for publication: Multiparty distributed point functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6863910)
