搜索结果: 1-3 共查到“密码学 Two-Party Secure”相关记录3条 . 查询时间(0.093 秒)
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...
Information-Theoretic Conditions for Two-Party Secure Function Evaluation
Information-Theoretic Conditions Two-Party Secure Function Evaluation
2008/11/25
The standard security definition of unconditional secure function
evaluation, which is based on the ideal/real model paradigm, has
the disadvantage of being overly complicated to work with in practi...