Prio+: privacy preserving aggregate statistics via Boolean shares

DOI10.1007/978-3-031-14791-3_23MaRDI QIDQ6134840zbMATH OpenOpenAlexFDO

Authors Surya Addanki, Kevin Garbe, Eli Jaffe, Rafail Ostrovsky, Antigoni Polychroniadou

Publication date 25 July 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-14791-3_23

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites work

• scientific article; zbMATH DE number 1302835 (Why is no real title available?)
• scientific article; zbMATH DE number 1842495 (Why is no real title available?)
• A scalable scheme for privacy-preserving aggregation of time-series data
• Improved primitives for MPC over mixed arithmetic-binary circuits
• MArBLed circuits: mixing arithmetic and Boolean circuits with active security
• Near-linear unconditionally-secure multiparty computation with a dishonest minority
• Prio+: privacy preserving aggregate statistics via Boolean shares
• Theory of Cryptography
• Zero-knowledge proofs on secret-shared data via fully linear PCPs

Cited in

(4)

• Compressing unit-vector correlations via sparse pseudorandom generators
• Secure approximate nearest neighbor search with locality-sensitive hashing
• Prio+: privacy preserving aggregate statistics via Boolean shares
• Client-aided privacy-preserving machine learning

This page was built for publication: Prio+: privacy preserving aggregate statistics via Boolean shares

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6134840)