搜索结果: 1-7 共查到“军事学 2PC”相关记录7条 . 查询时间(0.046 秒)
Commodity-Based 2PC for Arithmetic Circuits
Secure Two-Party Computation Information Theoretic Security Oblivious Linear Evaluation
font style='font-size:12px;'>
2019/6/19
We revisit the framework of Commodity-based Cryptography presented by Beaver (STOC'97) with a focus on updating the framework to fit with modern multiparty computation (MPC) protocols. We study the po...
On Perfectly Secure 2PC in the OT-hybrid model
2PC perfect security OT-hybrid model
font style='font-size:12px;'>
2018/4/4
In addition to the obvious theoretical appeal of the question towards better understanding secure computation, perfect, as opposed to statistical reductions may be useful for designing MPC protocols w...
Non-Interactive Secure 2PC in the Offline/Online and Batch Settings
secure two-party computation garbled circuits batched cut-and-choose
font style='font-size:12px;'>
2017/2/20
In cut-and-choose protocols for two-party secure computation (2PC) the main overhead is the number of garbled circuits that must be sent. Recent work (Lindell, Riva; Huang et al., Crypto 2014) has sho...
Constant Round Maliciously Secure 2PC with Function-independent Preprocessing using LEGO
Secure Two-party Computation Implementation LEGO
font style='font-size:12px;'>
2016/12/7
Secure two-party computation (S2PC) allows two parties to compute a function on their
joint inputs while leaking only the output of the function. At TCC 2009 Orlandi and Nielsen proposed
the LEGO pr...
Fast Optimistically Fair Cut-and-Choose 2PC
secure two-party computation covert adversaries cut-and-choose
font style='font-size:12px;'>
2016/1/27
Secure two party computation (2PC) is a well-studied problem with many real world applications.
Due to Cleve’s result on general impossibility of fairness, however, the state-of-the-art
solutions on...
Richer Efficiency/Security Trade-offs in 2PC
cryptographic protocols secure two-party computation
font style='font-size:12px;'>
2016/1/4
The dual-execution protocol of Mohassel & Franklin (PKC 2006) is a highly efficient (each party
garbling only one circuit) 2PC protocol that achieves malicious security apart from leaking an arbitrar...
Blazing Fast 2PC in the Offline/Online Setting with Security for Malicious Adversaries
online consistency check implementation
font style='font-size:12px;'>
2015/12/22
Recently, several new techniques were presented to dramatically improve key parts of secure
two-party computation (2PC) protocols that use the cut-and-choose paradigm on garbled circuits
for 2PC wit...