搜索结果: 46-60 共查到“军事学 two-party computation”相关记录65条 . 查询时间(0.179 秒)
Secure Two-Party Computation with Low Communication
Secure Two-Party Computation Extractable Hash Functions Communication and Round Complexity Non-Interactive Secure Computation Delegatable Computation
2012/3/26
We propose a 2-party UC-secure protocol that can compute any function securely. The protocol requires only two messages, communication that is poly-logarithmic in the size of the circuit description o...
We propose a new approach to practical two-party computation secure against an active adversary. All prior practical protocols were based on Yao's garbled circuits. We use an OT-based approach and get...
(Efficient) Universally Composable Two-Party Computation Using a Minimal Number of Stateless Tokens
(Efficient) Universally Composable Two-Party Computation Using a Minimal Number f Stateless Tokens
2012/6/14
We continue the line of work initiated by Katz (Eurocrypt 2007) on using tamper-proof hardware tokens for universally composable secure computation with no additional setup. As our main result, we sho...
(Efficient) Universally Composable Two-Party Computation Using a Minimal Number of Stateless Tokens
Minimal Number Stateless Tokens
2012/3/20
We continue the line of work initiated by Katz (Eurocrypt 2007) on using tamper-proof hardware tokens for universally composable secure computation with no additional setup. As our main result, we sho...
Leakage Resilient Secure Two-Party Computation
cryptographic protocols / Secure Two party Computation Leakage Resilient Oblivious Transfer
2012/3/28
In the traditional {\em secure function evaluation} setting, some set of distrusting parties jointly compute a function of their respective inputs {\em securely} as if the computation is executed in a...
Randomized Secure Two-Party Computation for Modular Conversion, Zero Test, Comparison, MOD and Exponentiation
applications / secure two-party computation randomized algorithm efficiency
2012/3/23
When secure arithmetic is required, computation based on secure multiplication ($\MULT$) is much more efficient than computation based on secure boolean circuits. However, a typical application can al...
Distributed Oblivious RAM for Secure Two-Party Computation
Oblivious RAM Cloud Computing Multi-Server Model Software Protection Secure Computation
2012/3/27
Secure two-party computation protocol allows two players, Alice with secret input $x$ and Bob with secret input $y$, to jointly execute an arbitrary program $\pi(x,y)$ such that only the output of the...
(Efficient) Universally Composable Two-Party Computation Using a Minimal Number of Stateless Tokens
Universally Composable Two-Party Computation Using Minimal Number
2012/8/28
We continue the line of work initiated by Katz (Eurocrypt 2007) on using tamper-proof hardware tokens for universally composable secure computation with no additional setup. As our main result, we sho...
Leakage Resilient Secure Two-Party Computation
cryptographic protocols Secure Two party Computation Leakage Resilient Oblivious Transfer
2011/6/9
In the traditional secure function evaluation setting, some set of distrusting parties jointly compute a function of their respective inputs securely which means that the real-life computation should ...
A New Approach to Practical Active-Secure Two-Party Computation
A New Approach Practical Active-Secure Two-Party Computation
2011/3/10
We propose a new approach to practical two-party computation secure against an active
adversary. All prior practical protocols were based on Yao’s protocol.We use an OT-based approach and
get effici...
Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
cryptographic protocols secure two-party computation efficiency DDH
2010/7/13
Protocols for secure two-party computation enable a pair of parties to compute a function of their inputs while preserving security properties such as privacy, correctness and independence of inputs. ...
Secure Two-Party Computation is Practical
Secure Two-Party Computation Secure multi-party computation AES encryption
2009/7/14
Secure multi-party computation has been considered by the
cryptographic community for a number of years. Until recently it has
been a purely theoretical area, with few implementations with which
to...
Adaptively Secure Two-Party Computation with Erasures
Adaptively Secure Two-Party Computation Erasures
2009/6/11
In the setting of multiparty computation a set of parties with private inputs wish to compute
some joint function of their inputs, whilst preserving certain security properties (like privacy and
cor...
Complete Fairness in Secure Two-Party Computation
cryptography secure computation fairness distributed computing
2009/6/5
In the setting of secure two-party computation, two mutually distrusting parties wish to
compute some function of their inputs while preserving, to the extent possible, various security
properties s...
Partial Fairness in Secure Two-Party Computation
Partial Fairness Secure Two-Party Computation
2009/6/4
Complete fairness is impossible to achieve, in general, in secure two-party computation. In
light of this, various techniques for obtaining partial fairness in this setting have been suggested.
We e...