The privacy of dense symmetric functions

DOI10.1007/BF01277955zbMath0817.94009MaRDI QIDQ1842776

Netta Shani, Benny Chor

Publication date: 8 August 1995

Published in: Computational Complexity (Search for Journal in Brave)

zbMATH Keywords

arithmetic progressionspartition argumentsprivate distributed computationssymmetric functions of Boolean arguments

Mathematics Subject Classification ID

Related Items (3)

On the number of random bits in totally private computation ⋮ On privacy and partition arguments ⋮ Quantum verifiable protocol for secure modulo zero-sum randomness

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Privacy and Communication Complexity
• A Zero-One Law for Boolean Privacy

This page was built for publication: The privacy of dense symmetric functions