Pages that link to "Item:Q1305927"
From MaRDI portal
The following pages link to Characterizing linear size circuits in terms of privacy (Q1305927):
Displaying 6 items.
- Privacy-free garbled circuits for formulas: size zero and information-theoretic (Q1675725) (← links)
- Lower and upper bounds on the randomness complexity of private computations of AND (Q2175947) (← links)
- Privacy in non-private environments (Q2429730) (← links)
- (Q5090444) (← links)
- Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND (Q5857004) (← links)
- Random sources in private computation (Q6135406) (← links)