The following pages link to (Q4418642):
Displaying 13 items.
- Improving the characterization of P-stability for applications in network privacy (Q277631) (← links)
- Private computation: \(k\)-connected versus 1-connected networks (Q850501) (← links)
- A one-round secure message broadcasting protocol through a key sharing tree (Q989505) (← links)
- Oblivious transfer in incomplete networks (Q1629424) (← links)
- On private computation in incomplete networks (Q1954202) (← links)
- Lower and upper bounds on the randomness complexity of private computations of AND (Q2175947) (← links)
- Communications in unknown networks: preserving the secret of topology (Q2382672) (← links)
- On the computational complexities of three problems related to a privacy measure for large networks under active attack (Q2419112) (← links)
- Computing in social networks (Q2637316) (← links)
- The Simultaneous Number-in-Hand Communication Model for Networks: Private Coins, Public Coins and Determinism (Q5496150) (← links)
- Structural Information and Communication Complexity (Q5710094) (← links)
- Random sources in private computation (Q6135406) (← links)
- Tight bounds on the randomness complexity of secure multiparty computation (Q6166963) (← links)
