Pages that link to "Item:Q5176017"
From MaRDI portal
The following pages link to Communication preserving protocols for secure function evaluation (Q5176017):
Displayed 10 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)
- 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)
- 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)