The following pages link to (Q5089211):
Displaying 4 items.
- Communication complexity of secure distributed computation in the presence of noise (Q4014135) (← links)
- On the Optimality of Secret Key Agreement via Omniscience (Q4569189) (← links)
- Communication complexity of key agreement on small ranges (Q4596608) (← links)
- Comments On “Information-Theoretic Key Agreement of Multiple Terminals—Part I” (Q5369881) (← links)