搜索结果: 76-83 共查到“军事学 secure computation”相关记录83条 . 查询时间(0.296 秒)
L1 - A Programming Language for Mixed-Protocol Secure Computation
secure computation compiler framework implementation performance homomorphic encryption yao garbled circuits
2010/11/16
Secure Computation (SC) enables secure distributed computation of arbitrary functions of private inputs. It has many useful applications, e.g. benchmarking or auctions. Several general protocols for S...
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...
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...
Universally Composable Two-Party and Multi-Party Secure Computation
IBM T.J. Watson Research Center Telcordia Technologies
2009/4/15
We show how to securely realize any two-party and multi-party functionality in a universally
composable way, regardless of the number of corrupted participants. That is, we consider an
asynchronous ...
In recent years there has been massive progress in the development of technologies for storing
and processing of data. If statistical analysis could be applied to such data when it is distributed bet...
New Constructions for UC Secure Computation using Tamper-proof Hardware
New Constructions UC Secure Computation Tamper-proof Hardware
2008/8/12
The Universal Composability framework was introduced by Canetti to study the security
of protocols which are concurrently executed with other protocols in a network environment.
Unfortunately it was...
Almost-everywhere Secure Computation
Secure multi-party computation almost-everywhere agreement secure message ansmission
2008/7/17
In this paper, we show how to circumvent this impossibility result and achieve meaningful security guarantees for graphs with small degree (such as expander graphs and several other topologies). In fa...
Secure computation on incomplete networks
almost everywhere agreement almost everywhere secure computation expander graphs
2008/5/29
Secure multiparty computation of a multivariate function is a central problem in cryptography. It is known that secure multiparty computation can be realized by a set of n parties iff the connectivity...