搜索结果: 1-15 共查到“军事学 secure multiparty computation”相关记录44条 . 查询时间(0.093 秒)
Efficient Information-Theoretic Secure Multiparty Computation over Z/pkZ via Galois Rings
MPC Galois Rings
2019/7/30
At CRYPTO 2018, Cramer et al. introduced a secret-sharing based protocol called SPDZ2kZ2k that allows for secure multiparty computation (MPC) in the dishonest majority setting over the ring of integer...
Four-Round Secure Multiparty Computation from General Assumptions
multi-party computation oblivious transfer round optimal
2019/2/28
In this work we continue the study on the round complexity of secure multi-party computation with black-box simulation in the simultaneous broadcast model where all the parties get the output.
On Round Optimal Secure Multiparty Computation from Minimal Assumptions
cryptographic protocols multiparty computation
2019/2/28
We study the problem of constructing secure multiparty computation (MPC) protocols in the standard broadcast communication model from {\em minimal} assumptions. We focus on security in the plain model...
Efficient and Secure Multiparty Computation from Fixed-Key Block Ciphers
random permutation mode secure computation
2019/1/26
Many implementations of secure computation use fixed-key AES (modeled as a random permutation); this results in substantial performance benefits due to existing hardware support for~AES and the abilit...
Insured MPC: Efficient Secure Multiparty Computation with Punishable Abort
MPC cryptographic protocols
2018/11/7
Fairness in Secure Multiparty Computation (MPC) is known to be impossible to achieve in the presence of a dishonest majority. Previous works have proposed combining MPC protocols with Cryptocurrencies...
Guaranteed output delivery: We also construct protocols that achieve security with guaranteed output delivery: (i) Against fail-stop adversaries, we construct two round MPC either in the (bare) public...
On the Message Complexity of Secure Multiparty Computation
Secure Multiparty Computation MPC
2018/1/11
We study the minimal number of point-to-point messages required for general secure multiparty computation (MPC) in the setting of computational security against semi-honest, static adversaries who may...
Efficient Maliciously Secure Multiparty Computation for RAM
Multiparty computation oblivious RAM garbled circuits
2017/10/10
A crucial issue, that mostly affects the performance of actively secure computation of RAM programs, is the task of reading/writing from/to memory in a private and authenticated manner. Previous works...
MCMix: Anonymous Messaging via Secure Multiparty Computation
anonymity messaging multiparty computation
2017/8/17
We present ‘MCMix’, an anonymous messaging system that completely hides communication metadata and can scale in the order of hundreds of thousands of users. Our approach is to isolate two suitable fun...
Committed MPC - Maliciously Secure Multiparty Computation from Homomorphic Commitments
secret sharing commitments malicious model
2017/6/9
We present a new approach to secure multiparty computation against a static and malicious dishonest majority. Unlike previous protocols that were based on working on MAC-ed secret shares, our approach...
We present a new approach towards constructing round-optimal secure multiparty computation (MPC) protocols against malicious adversaries without trusted setup assumptions. Our approach builds on ideas...
Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model
adaptive security Yao garbled circuits secure computation
2017/1/3
Yao's garbling scheme is one of the basic building blocks of cryptographic protocol design. Originally designed to enable two-message, two-party secure computation, the scheme has been extended in man...
Algorithmic Mechanism Construction bridging Secure Multiparty Computation and Intelligent Reasoning
Algorithmic mechanism Intelligent reasoning Threat analytics
2016/12/10
This work presents the construction of intelligent algorithmic mechanism based on multidimensional view of intelligent reasoning, threat analytics, cryptographic solutions and secure multiparty comput...
Binary AMD Circuits from Secure Multiparty Computation
Algebraic Manipulation Detection AMD Circuits Secure Multiparty Computation
2016/12/10
An AMD circuit over a finite field FF is a randomized arithmetic circuit that offers the ``best possible protection'' against additive attacks. That is, the effect of every additive attack that may bl...
On Adaptively Secure Multiparty Computation with a Short CRS
secure multiparty computation adaptive security round complexity
2016/12/8
In the setting of multiparty computation, a set of mutually distrusting parties wish to securely
compute a joint function of their private inputs. A protocol is adaptively secure if honest parties
m...