\textsf{OPA}: one-shot private aggregation with single client interaction and its applications to federated learning
From MaRDI portal
Publication:6862545
Cites work
- A Compact Digital Signature Scheme Based on the Module-LWR Problem
- A scalable scheme for privacy-preserving aggregation of time-series data
- Distributed Point Functions and Their Applications
- Efficient laconic cryptography from learning with errors
- Foundations of Cryptography
- How to share a secret
- How to simulate it -- a tutorial on the simulation proof technique
- scientific article; zbMATH DE number 1304081 (Why is no real title available?)
- I want to ride my \texttt{BICYCL} : \texttt{BICYCL} implements cryptography in class groups
- Key homomorphic PRFs and their applications
- Lattice-Based Secure Biometric Authentication for Hamming Distance
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
- LERNA: secure single-server aggregation via key-homomorphic masking
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- Prio+: privacy preserving aggregate statistics via Boolean shares
- Pseudorandom functions and lattices
- Public Key Cryptography - PKC 2006
- Publicly verifiable secret sharing over class groups and applications to DKG and YOSO
- SCRAPE: scalable randomness attested by public entities
- Secure computation on the web: computing without simultaneous interaction
- Secure multiparty computation from threshold encryption based on class groups
- SLAP: simpler, improved private stream aggregation from ring learning with errors
- Toward practical lattice-based proof of knowledge from Hint-MLWE
- Willow: secure aggregation with one-shot clients
This page was built for publication: \textsf{OPA}: one-shot private aggregation with single client interaction and its applications to federated learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6862545)
