Pages that link to "Item:Q2944525"
From MaRDI portal
The following pages link to Secure multiparty computation of approximations (Q2944525):
Displaying 8 items.
- Efficient set operations in the presence of malicious adversaries (Q434343) (← links)
- Quantum state secure transmission in network communications (Q726483) (← links)
- The communication complexity of the Hamming distance problem (Q845704) (← links)
- Matching with don't-cares and a small number of mismatches (Q976093) (← links)
- Private multiparty sampling and approximation of vector combinations (Q1014646) (← links)
- How should we solve search problems privately? (Q2267364) (← links)
- Two Party Distribution Testing: Communication and Security (Q5091163) (← links)
- Fast Private Norm Estimation and Heavy Hitters (Q5445506) (← links)
