搜索结果: 1-15 共查到“军事学 secure two-party computation”相关记录51条 . 查询时间(0.125 秒)
Mon$\mathbb{Z}_{2^k}$a: Fast Maliciously Secure Two Party Computation on $\mathbb{Z}_{2^k}$
cryptographic protocols protocol consists
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...
Efficient Zero-Knowledge for NP from Secure Two-Party Computation
Zero-knowledge claw-free permutation two-party computation
2019/1/30
Ishai et al. [28, 29] introduced a powerful technique that provided a general transformation from secure multiparty computation (MPC) protocols to zero-knowledge (ZK) proofs in a black-box way, called...
Optimizing Authenticated Garbling for Faster Secure Two-Party Computation
secure two-party computation malicious security
2018/6/7
Wang et al. (CCS 2017) recently proposed a protocol for malicious secure two-party computation that represents the state-of-the- art with regard to concrete efficiency in both the single-execution and...
Secure Two-Party Computation over Unreliable Channels
Secure multiparty computation Unreliable Channels Error-Correction
2018/5/28
We consider information-theoretic secure two-party computation in the plain model where no reliable channels are assumed, and all communication is performed over the binary symmetric channel (BSC) tha...
Combining Private Set-Intersection with Secure Two-Party Computation
PSI PSM set-intersection
2018/1/31
Private Set-Intersection (PSI) is one of the most popular and practically relevant secure two-party computation (2PC) tasks. Therefore, designing special-purpose PSI protocols (which are more efficien...
EzPC: Programmable, Efficient, and Scalable Secure Two-Party Computation
Secure Computation secure machine learning prediction
2017/11/21
We present EZPC: a secure two-party computation (2PC) framework that generates efficient 2PC protocols from high-level, easy-to-write, programs. EZPC provides formal correctness and security guarantee...
We revisit the exact round complexity of secure two-party computation. While four rounds are known to be sufficient for securely computing general functions that provide output to one party [Katz-Ostr...
Secure Two-Party Computation with Fairness -- A Necessary Design Principle
secure computation fairness definitions of security
2017/9/28
Protocols for secure two-party computation enable a pair of mutually distrustful parties to carry out a joint computation of their private inputs without revealing anything but the output. One importa...
Round-Optimal Secure Two-Party Computation from Trapdoor Permutations
Two-Party Computation Oblivious Transfer Simultaneous Model Exchange Channel
2017/9/25
In this work we continue the study on the round complexity of secure two-party computation with black-box simulation. Katz and Ostrovsky in CRYPTO 2004 showed a 5 (optimal) round construction assuming...
TinyOLE: Efficient Actively Secure Two-Party Computation from Oblivious Linear Function Evaluation
Two-party computation Oblivious Linear Function Evaluation
2017/8/22
Conceptually our techniques lift the techniques for basing practical actively secure 2PC of Boolean circuits on OT introduced under the name TinyOT by Nielsen, Nordholt, Orlandi and Burra at Crypto 20...
Authenticated Garbling and Efficient Maliciously Secure Two-Party Computation
two-party computation secure computation
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
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...
Designing Fully Secure Protocols for Secure Two-Party Computation of Constant-Domain Functions
Fairness Secure Two-Party Computation Malicious Adversaries
2017/2/20
In a sense, a two-party protocol achieves fairness if the output from the computation is obtained simultaneously by both parties. A seminal result by Cleve (STOC 1986) states that fairness is impossib...
Constant-Round Maliciously Secure Two-Party Computation in the RAM Model
RAM cryptographic protocols
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 ...
In 2000, Canetti, Goldreich, Goldwasser and Micali (STOC’00) proposed the notion of resettable
zero-knowledge, which considers the scenario where a malicious verifier can reset the
prover and force ...