Pages that link to "Item:Q2976700"
From MaRDI portal
The following pages link to Communication and Randomness Lower Bounds for Secure Computation (Q2976700):
Displaying 17 items.
- Lower bounds and new constructions on secure group communication schemes (Q955028) (← links)
- Lower bounds on the probability of successful substitution of messages (Q1310761) (← links)
- The price of low communication in secure multi-party computation (Q1675733) (← links)
- Secure computation with low communication from cross-checking (Q1710664) (← links)
- Lower and upper bounds on the randomness complexity of private computations of AND (Q2175947) (← links)
- New Lower Bounds for Privacy in Communication Protocols (Q2948253) (← links)
- Нижние оценки для практической секретности ключа (Q3381874) (← links)
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity (Q3787911) (← links)
- Communication complexity of secure distributed computation in the presence of noise (Q4014135) (← links)
- Communication complexity of key agreement on small ranges (Q4596608) (← links)
- (Q4601830) (← links)
- Some Open Problems in Information-Theoretic Cryptography (Q5136294) (← links)
- Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND (Q5857004) (← links)
- The communication complexity of private simultaneous messages, revisited (Q5918864) (← links)
- On query-to-communication lifting for adversary bounds (Q6115393) (← links)
- Random sources in private computation (Q6135406) (← links)
- Tight bounds on the randomness complexity of secure multiparty computation (Q6166963) (← links)