搜索结果: 1-2 共查到“军事学 Deterministic 2-Party”相关记录2条 . 查询时间(0.075 秒)
Completeness Theorems with Constructive Proofs for Finite Deterministic 2-Party Functions
oblivious transfer complete primitives information-theoretic security universal composability secure function evaluation
2011/1/5
In this paper we present simple but comprehensive combinatorial criteria for completeness of finite deterministic 2-party functions with respect to information-theoretic security. We give a general pr...
A Zero-One Law for Deterministic 2-Party Secure Computation
Zero-One Law Deterministic 2-Party Secure Computation
2010/3/16
We use security in the Universal Composition framework as a means to study the \cryptographic
complexity" of 2-party secure computation tasks (functionalities). We say that a
functionality F reduces...