搜索结果: 1-7 共查到“军队指挥学 Dishonest Majority”相关记录7条 . 查询时间(0.125 秒)
Information-Theoretic Broadcast with Dishonest Majority for Long Messages
Byzantine broadcast information-theoretic security dishonest majority
2018/11/16
Byzantine broadcast is a fundamental primitive for secure computation. In a setting with nn parties in the presence of an adversary controlling at most tt parties, while a lot of progress in optimizin...
Most multi-party computation protocols allow secure computation of arithmetic circuits over a finite field, such as the integers modulo a prime. In the more natural setting of integer computations mod...
On the Computational Overhead of MPC with Dishonest Majority
secure computation MPC threshold cryptography
2016/6/22
We consider the situation where a large number n of players want to securely compute a large function f with security against an adaptive, malicious adversary which might corrupt tn of the parties f...
Dishonest Majority Multi-Party Computation for Binary Circuits
cryptographic protocols global authentications
2016/1/26
We extend the Tiny-OT two party protocol of Nielsen et al (CRYPTO 2012) to the case
of n parties in the dishonest majority setting. This is done by presenting a novel way of transferring
pairwise au...
An architecture for practical actively secure MPC with dishonest majority
An architecture practical actively secure MPC dishonest majority
2013/4/18
We present a runtime environment for executing secure programs via a multi-party computation protocol in the preprocessing model. The runtime environment is general and allows arbitrary reactive compu...
Multiparty Computation for Dishonest Majority: from Passive to Active Security at Low Cost
Dishonest Majority Passive to Active Security Low Cost
2010/7/13
Multiparty computation protocols have been known for more than twenty years now, but due to their lack of efficiency their use is still limited in real-world applications: the goal of this paper is th...
Secure Computability of Functions in the IT setting with Dishonest Majority and Applications to Long-Term Security
long-term security information-theoretic security corrupted majority
2009/6/5
It is well known that general secure function evaluation (SFE) with information-theoretical (IT) security is
infeasible in presence of a corrupted majority in the standard model. On the other hand, t...