Pages that link to "Item:Q1961058"
From MaRDI portal
The following pages link to Randomness complexity of private computation (Q1961058):
Displaying 6 items.
- Binary decompositions of probability densities and random-bit simulation (Q777909) (← links)
- Lower and upper bounds on the randomness complexity of private computations of AND (Q2175947) (← links)
- On the Communication Required for Unconditionally Secure Multiplication (Q2829225) (← links)
- Randomness-efficient non-interactive zero knowledge (Q4572000) (← links)
- (Q5090444) (← links)
- Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND (Q5857004) (← links)
