搜索结果: 1-2 共查到“密码学 two-party secure computation”相关记录2条 . 查询时间(0.156 秒)
Fast Two-Party Secure Computation with Minimal Assumptions
the Yao protocol malicious model circuit-level cut-and-choose depth complexity
2013/4/18
All recent implementations of two-party secure computation protocols require specific complexity assumptions for their correctness and/or efficiency (e.g., DDH, homomorphic encryption, Sigma protocols...
The first and still most popular solution for secure two-party computation relies
on Yao’s garbled circuits. Unfortunately, Yao’s construction provide security only against
passive adversaries. Seve...