搜索结果: 1-6 共查到“Two-Party Computation Using”相关记录6条 . 查询时间(0.171 秒)
Faster Maliciously Secure Two-Party Computation Using the GPU
cryptographic protocols implementation secure two-party computation
font style='font-size:12px;'>
2016/1/23
We present a new protocol for maliciously secure two-party computation based on cut-and-choose of garbled circuits using the recent idea of “forge-and-loose”, which eliminates around a factor 3 of ga...
Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose
cryptographic protocols
font style='font-size:12px;'>
2013/4/18
Beginning with the work of Lindell and Pinkas, researchers have proposed several protocols for secure two-party computation based on the cut-and-choose paradigm. In existing instantiations of this par...
Fast and Maliciously Secure Two-Party Computation Using the GPU
cryptographic protocols implementation two-party computation
font style='font-size:12px;'>
2013/2/21
We describe, and implement, a maliciously secure protocol for secure two-party computation, based on Yao's garbled circuit and an efficient OT extension, in a parallel computational model. The impleme...
(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
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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...
(Efficient) Universally Composable Two-Party Computation Using a Minimal Number of Stateless Tokens
Universally Composable Two-Party Computation Using Minimal Number
font style='font-size:12px;'>
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...