On the number of random bits in totally private computation

DOI10.1007/3-540-60084-1_72zbMath1412.68062OpenAlexW1595485507MaRDI QIDQ4645176

Alfredo De Santis, Giuseppe Persiano, Carlo Blundo, Ugo Vaccaro

Publication date: 10 January 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60084-1_72

zbMATH Keywords

Boolean functionShannon entropyrandom sourcerandom inputprivate input

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Measures of information, entropy (94A17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounds on tradeoffs between randomness and communication complexity
• A communication-privacy tradeoff for modular addition
• On the structure of the privacy hierarchy
• The privacy of dense symmetric functions
• Privacy and Communication Complexity
• Randomness in distribution protocols
• Randomness-optimal unique element isolation, with applications to perfect matching and related problems
• A Zero-One Law for Boolean Privacy

This page was built for publication: On the number of random bits in totally private computation