Visualizing differentially private mechanisms with physical cards
From MaRDI portal
Cites work
- A single shuffle is enough for secure card-based computation of any Boolean circuit
- Amplification by shuffling: from local to central differential privacy via anonymity
- Analyzing execution time of card-based protocols
- Card-based protocols for any Boolean function
- Card-minimal protocols for symmetric Boolean functions of more than seven inputs
- Cryptographic and physical zero-knowledge proof systems for solutions of Sudoku puzzles
- Distributed Private Data Analysis: Simultaneously Solving How and What
- Efficient card-based protocols for generating a hidden random permutation without fixed points
- Free-XOR in card-based garbled circuits
- scientific article; zbMATH DE number 1339969 (Why is no real title available?)
- scientific article; zbMATH DE number 1024066 (Why is no real title available?)
- More Efficient Match-Making and Satisfiability The Five Card Trick
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- Randomized response: a survey technique for eliminating evasive answer bias
- Single-shuffle card-based protocol with eight cards per gate
- Single-shuffle card-based protocols with six cards per gate
- Six-Card Secure AND and Four-Card Secure XOR
- The tail of the hypergeometric distribution
- Theory of Cryptography
This page was built for publication: Visualizing differentially private mechanisms with physical cards
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6908090)