Pages that link to "Item:Q1209990"
From MaRDI portal
The following pages link to A communication-privacy tradeoff for modular addition (Q1209990):
Displaying 10 items.
- Summing over a network without revealing summands (Q1119609) (← links)
- Quantum verifiable protocol for secure modulo zero-sum randomness (Q2101598) (← links)
- Lower and upper bounds on the randomness complexity of private computations of AND (Q2175947) (← links)
- Optimality of a protocol by Feige-Kilian-Naor for three-party secure computation (Q2179390) (← links)
- A survey and refinement of repairable threshold schemes (Q2413291) (← links)
- On the Communication Required for Unconditionally Secure Multiplication (Q2829225) (← links)
- Distributed Private Data Analysis: Simultaneously Solving How and What (Q3600234) (← links)
- On the number of random bits in totally private computation (Q4645176) (← links)
- Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND (Q5857004) (← links)
- Tight bounds on the randomness complexity of secure multiparty computation (Q6166963) (← links)