Prio+: privacy preserving aggregate statistics via Boolean shares

DOI10.1007/978-3-031-14791-3_23OpenAlexW3173250331MaRDI QIDQ6134840FDOQ6134840

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

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

Cited In (4)

• Secure approximate nearest neighbor search with locality-sensitive hashing
• Prio+: privacy preserving aggregate statistics via Boolean shares
• Compressing unit-vector correlations via sparse pseudorandom generators
• 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)