scientific article; zbMATH DE number 1962807
From MaRDI portal
Publication:4418642
Recommendations
- Structural Information and Communication Complexity
- On private computation in incomplete networks
- scientific article; zbMATH DE number 1942421
- Private computation: k-connected versus 1-connected networks
- Topology-hiding computation beyond semi-honest adversaries
- Non trivial computations in anonymous dynamic networks
- On communication protocols that compute almost privately
- On communication protocols that compute almost privately
- Private computation of polynomials over networks
- Randomness in Private Computations
Cited in
(16)- Oblivious transfer in incomplete networks
- On private computation in incomplete networks
- Lower and upper bounds on the randomness complexity of private computations of AND
- Communications in unknown networks: preserving the secret of topology
- On the computational complexities of three problems related to a privacy measure for large networks under active attack
- Computing in social networks
- Improving the characterization of P-stability for applications in network privacy
- scientific article; zbMATH DE number 1942421 (Why is no real title available?)
- Secure Distributed Computing Made (Nearly) Optimal
- The Simultaneous Number-in-Hand Communication Model for Networks: Private Coins, Public Coins and Determinism
- Structural Information and Communication Complexity
- Random sources in private computation
- Tight bounds on the randomness complexity of secure multiparty computation
- Randomness in private sequential stateless protocols
- Private computation: k-connected versus 1-connected networks
- A one-round secure message broadcasting protocol through a key sharing tree
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4418642)
