Pages that link to "Item:Q5176017"
From MaRDI portal
The following pages link to Communication preserving protocols for secure function evaluation (Q5176017):
Displayed 21 items.
- Efficient set operations in the presence of malicious adversaries (Q434343) (← links)
- Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs (Q901372) (← links)
- Private multiparty sampling and approximation of vector combinations (Q1014646) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- Multi-value private information retrieval with colluding databases via trace functions (Q2053906) (← links)
- Breaking the circuit size barrier for secure computation under quasi-polynomial LPN (Q2056771) (← links)
- A balm: defend the clique-based attack from a fundamental aspect (Q2082182) (← links)
- Secure multiparty computation with sublinear preprocessing (Q2170009) (← links)
- Communication Optimal Tardos-Based Asymmetric Fingerprinting (Q2790060) (← links)
- On the Communication Required for Unconditionally Secure Multiplication (Q2829225) (← links)
- Breaking the Circuit Size Barrier for Secure Computation Under DDH (Q2835599) (← links)
- Communication-Efficient Private Protocols for Longest Common Subsequence (Q3623051) (← links)
- (Q5002694) (← links)
- On the Bottleneck Complexity of MPC with Correlated Randomness (Q5087257) (← links)
- Two Party Distribution Testing: Communication and Security (Q5091163) (← links)
- Cryptography and cryptographic protocols (Q5138490) (← links)
- Fast Private Norm Estimation and Heavy Hitters (Q5445506) (← links)
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation (Q5738973) (← links)
- Secure computation of the median (and other elements of specified ranks) (Q5962224) (← links)
- Sublinear secure computation from new assumptions (Q6114267) (← links)
- Maliciously secure massively parallel computation for all-but-one corruptions (Q6155275) (← links)