Pages that link to "Item:Q4377451"
From MaRDI portal
The following pages link to Randomness in Private Computations (Q4377451):
Displaying 17 items.
- Randomness in distribution protocols (Q675065) (← links)
- Private computation using a PEZ dispenser. (Q1426438) (← links)
- Forward induction and public randomization (Q1815194) (← links)
- Randomness complexity of private computation (Q1961058) (← links)
- Randomness versus fault-tolerance (Q1976006) (← links)
- Private circuits with quasilinear randomness (Q2170088) (← links)
- Lower and upper bounds on the randomness complexity of private computations of AND (Q2175947) (← links)
- Distribution design (Q2800555) (← links)
- On the Communication Required for Unconditionally Secure Multiplication (Q2829225) (← links)
- Privacy with Imperfect Randomness (Q3457080) (← links)
- Computing with Very Weak Random Sources (Q4268718) (← links)
- (Q4418642) (← links)
- (Q5090444) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313033) (← links)
- Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND (Q5857004) (← links)
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (Q5900938) (← links)
- Tight bounds on the randomness complexity of secure multiparty computation (Q6166963) (← links)