Pages that link to "Item:Q2944525"
From MaRDI portal
The following pages link to Secure multiparty computation of approximations (Q2944525):
Displaying 19 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)
- A note on secure multiparty computation via higher residue symbols (Q2040551) (← links)
- Secure multiparty computation with sublinear preprocessing (Q2170009) (← links)
- How should we solve search problems privately? (Q2267364) (← links)
- An equational approach to secure multi-party computation (Q2986886) (← links)
- (Q3500748) (← links)
- Secure Two-Party Computation of Squared Euclidean Distances in the Presence of Malicious Adversaries (Q3600327) (← links)
- On Secure Multi-party Computation in Black-Box Groups (Q3612572) (← links)
- (Q4249652) (← links)
- (Q4535073) (← links)
- Communication Locality in Secure Multi-party Computation (Q4910288) (← links)
- Two Party Distribution Testing: Communication and Security (Q5091163) (← links)
- (Q5127928) (← links)
- Fast Private Norm Estimation and Heavy Hitters (Q5445506) (← links)
- Secure sampling with sublinear communication (Q6114277) (← links)