Pages that link to "Item:Q4012449"
From MaRDI portal
The following pages link to Privacy and Communication Complexity (Q4012449):
Displayed 22 items.
- Zero-information protocols and unambiguity in Arthur-Merlin communication (Q343848) (← links)
- On \(d\)-multiplicative secret sharing (Q604627) (← links)
- On communication protocols that compute almost privately (Q714841) (← links)
- Characterizing linear size circuits in terms of privacy (Q1305927) (← links)
- On the structure of the privacy hierarchy (Q1324758) (← links)
- Protecting data privacy in private information retrieval schemes (Q1577014) (← links)
- Another step towards realizing random oracles: non-malleable point obfuscation (Q1648795) (← links)
- The privacy of dense symmetric functions (Q1842776) (← links)
- On privacy and partition arguments (Q1854427) (← links)
- On private computation in incomplete networks (Q1954202) (← links)
- Upper bounds on the Boolean rank of Kronecker products (Q2146742) (← links)
- On fully secure MPC with solitary output (Q2175916) (← links)
- Completeness for symmetric two-party functionalities: revisited (Q2413612) (← links)
- On the computational complexities of three problems related to a privacy measure for large networks under active attack (Q2419112) (← links)
- Privacy in non-private environments (Q2429730) (← links)
- On the Communication Required for Unconditionally Secure Multiplication (Q2829225) (← links)
- Computing (and Life) Is All about Tradeoffs (Q2848971) (← links)
- Founding Cryptography on Tamper-Proof Hardware Tokens (Q3408202) (← links)
- On the number of random bits in totally private computation (Q4645176) (← links)
- Quantifying the leakage of quantum protocols for classical two-party cryptography (Q5175596) (← links)
- Susceptible Two-Party Quantum Computations (Q5502797) (← links)
- On perfectly secure two-party computation for symmetric functionalities with correlated randomness (Q6169419) (← links)