Pages that link to "Item:Q1954202"
From MaRDI portal
The following pages link to On private computation in incomplete networks (Q1954202):
Displaying 11 items.
- Improving the characterization of P-stability for applications in network privacy (Q277631) (← links)
- Private computation: \(k\)-connected versus 1-connected networks (Q850501) (← links)
- Oblivious transfer in incomplete networks (Q1629424) (← links)
- Communication protocols for secure distributed computation of binary functions. (Q1854343) (← links)
- Randomized component based secure secret reconstruction in insecure networks (Q2154040) (← links)
- Is information-theoretic topology-hiding computation possible? (Q2175925) (← links)
- Privacy-constrained network formation (Q2411529) (← links)
- Privacy in non-private environments (Q2429730) (← links)
- (Q4418642) (← links)
- Structural Information and Communication Complexity (Q5710094) (← links)
- Must the communication graph of MPC protocols be an expander? (Q6110384) (← links)