搜索结果: 1-15 共查到“军事学 Multiparty computation”相关记录89条 . 查询时间(0.093 秒)
Efficient Information-Theoretic Secure Multiparty Computation over Z/pkZ via Galois Rings
MPC Galois Rings
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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...
Two round multiparty computation via Multi-key fully homomorphic encryption with faster homomorphic evaluations
Multi-key fully homomorphic encryption (MKFHE) NTRU two-round MPC
font style='font-size:12px;'>
2019/1/4
Multi-key fully homomorphic encryption (MKFHE) allows computations on ciphertexts encrypted by different users (public keys), and the results can be jointly decrypted using the secret keys of all the ...
Insured MPC: Efficient Secure Multiparty Computation with Punishable Abort
MPC cryptographic protocols
font style='font-size:12px;'>
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...
Round-Optimal Secure Multiparty Computation with Honest Majority
Secure Computation MPC
font style='font-size:12px;'>
2018/6/6
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...
Computer-aided proofs for multiparty computation with active security
formal verification secure multiparty computation
font style='font-size:12px;'>
2018/5/28
Secure multi-party computation (MPC) is a general cryptographic technique that allows distrusting parties to compute a function of their individual inputs, while only revealing the output of the funct...
A Note on the Communication Complexity of Multiparty Computation in the Correlated Randomness Model
multiparty computation correlated randomness model information- theoretic security
font style='font-size:12px;'>
2018/5/22
Secure multiparty computation (MPC) addresses the challenge of evaluating functions on secret inputs without compromising their privacy. An central question in multiparty communication is to understan...
On the Message Complexity of Secure Multiparty Computation
Secure Multiparty Computation MPC
font style='font-size:12px;'>
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...
Fairness in an Unfair World: Fair Multiparty Computation from public Bulletin Boards
Fair Multiparty Computation public Bulletin Boards
font style='font-size:12px;'>
2017/11/13
Secure multiparty computation allows mutually distrusting parties to compute a function on their private inputs such that nothing but the function output is revealed. Achieving fairness --- that all p...
Efficient Maliciously Secure Multiparty Computation for RAM
Multiparty computation oblivious RAM garbled circuits
font style='font-size:12px;'>
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...
Non-Interactive Multiparty Computation without Correlated Randomness
secure multiparty computation non-interactive indistinguishability obfuscation
font style='font-size:12px;'>
2017/9/14
We study the problem of non-interactive multiparty computation (NI-MPC) where a group of completely asynchronous parties can evaluate a function over their joint inputs by sending a single message to ...
MCMix: Anonymous Messaging via Secure Multiparty Computation
anonymity messaging multiparty computation
font style='font-size:12px;'>
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...
Lower bounds on communication for multiparty computation of multiple «AND» instances with secret sharing
information theory secret sharing
font style='font-size:12px;'>
2017/7/6
The present report contains a proof of a linear lower bound for a typical three-party secure computation scheme of nn independent ANDAND functions. The goal is to prove some linear communication lower...