搜索结果: 1-7 共查到“军队指挥学 maliciously secure two-party computation”相关记录7条 . 查询时间(0.1 秒)
Mon$\mathbb{Z}_{2^k}$a: Fast Maliciously Secure Two Party Computation on $\mathbb{Z}_{2^k}$
cryptographic protocols protocol consists
font style='font-size:12px;'>
2019/2/28
In this paper we present a new 2-party protocol for secure computation over rings of the form Z2kZ2k. As many recent efficient MPC protocols supporting dishonest majority, our protocol consists of a h...
Authenticated Garbling and Efficient Maliciously Secure Two-Party Computation
two-party computation secure computation
font style='font-size:12px;'>
2017/2/20
We propose a simple and efficient framework for obtaining efficient constant-round protocols for maliciously secure two-party computation. Our framework uses a function-independent preprocessing phase...
Efficient Maliciously Secure Two Party Computation for Mixed Programs
cryptographic protocols secure computation
font style='font-size:12px;'>
2017/2/20
We propose a new approach for practical secure two-party computation (2PC) achieving security in the presence of malicious adversaries. Given a program to compute, the idea is to identify subcomputati...
Constant-Round Maliciously Secure Two-Party Computation in the RAM Model
RAM cryptographic protocols
font style='font-size:12px;'>
2016/12/10
The random-access memory (RAM) model of computation allows program constant-time memory lookup and is more applicable in practice today, covering many important algorithms. This is in contrast to the ...
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...
TinyLEGO: An Interactive Garbling Scheme for Maliciously Secure Two-Party Computation
Secure Computation XOR-Homomorphic Commitments Garbled Circuits
font style='font-size:12px;'>
2015/12/31
We show that an interactive garbling scheme combined with a Universally Composable (UC) secure oblivious transfer protocol can be used in a black-box manner to implement two-party computation (2PC) UC...
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...