A communication-privacy tradeoff for modular addition
From MaRDI portal
Publication:1209990
DOI10.1016/0020-0190(93)90120-XzbMath0780.68003MaRDI QIDQ1209990
Publication date: 16 May 1993
Published in: Information Processing Letters (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10)
Related Items (9)
Lower and upper bounds on the randomness complexity of private computations of AND ⋮ Optimality of a protocol by Feige-Kilian-Naor for three-party secure computation ⋮ A survey and refinement of repairable threshold schemes ⋮ Tight bounds on the randomness complexity of secure multiparty computation ⋮ On the number of random bits in totally private computation ⋮ Distributed Private Data Analysis: Simultaneously Solving How and What ⋮ On the Communication Required for Unconditionally Secure Multiplication ⋮ Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND ⋮ Quantum verifiable protocol for secure modulo zero-sum randomness
Cites Work
This page was built for publication: A communication-privacy tradeoff for modular addition
