搜索结果: 1-15 共查到“军队指挥学 Secure 2-party computation”相关记录94条 . 查询时间(0.031 秒)
A High-Assurance, Automatically-Synthesized, Evaluator for Machine-Checked (Proactively) Secure Multi-Party Computation
Secure Multi-Party Computation Verified Implementation High-Assurance Cryptography
2019/8/14
Secure Multi-Party Computation (MPC) enables a group of nn distrusting parties to jointly compute a function using private inputs. MPC guarantees correctness of computation and confidentiality of inpu...
Fast Actively Secure Five-Party Computation with Security Beyond Abort
Secure Multiparty Computation Guaranteed Output Delivery Fairness
2019/7/26
Secure Multi-party Computation (MPC) with small population and honest majority has drawn focus specifically due to customization in techniques and resulting efficiency that the constructions can offer...
Privacy-Preserving Classification of Personal Text Messages with Secure Multi-Party Computation: An Application to Hate-Speech Detection
cryptographic protocols SMC
2019/6/26
Classification of personal text messages has many useful applications in surveillance, e-commerce, and mental health care, to name a few. Giving applications access to personal texts can easily lead t...
Improved Building Blocks for Secure Multi-Party Computation based on Secret Sharing with Honest Majority
cryptographic protocols secret sharing
2019/6/19
Secure multi-party computation permits evaluation of any desired functionality on private data without disclosing the data to the participants and is gaining its popularity due to increasing collectio...
MPCircuits: Optimized Circuit Generation for Secure Multi-Party Computation
Multi-party computation secure function evaluation logic synthesis
2019/3/13
Secure Multi-party Computation (MPC) is one of the most influential achievements of modern cryptography: it allows evaluation of an arbitrary function on private inputs from multiple parties without r...
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...
BeeHive: Double Non-interactive Secure Multi-party Computation
Secure multi-party computation secret sharing non-interactive
2018/8/16
Currently, round complexity and communication complexity are two fundamental issues of secure multi-party computation (MPC) since all known schemes require communication for each multiplication operat...
Improved Signature Schemes for Secure Multi-Party Computation with Certified Inputs
cryptographic protocols Certified Inputs
2018/8/16
The motivation for this work comes from the need to strengthen security of secure multi-party protocols with the ability to guarantee that the participants provide their truthful inputs in the computa...
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 Multi-Party Computation from Strongly Uniform Key Agreement
MPC maliciously secure OT LPN
2018/5/28
We give a construction of a secure multi-party computation (MPC) protocol from a special type of key agreement, where the distribution of the messages sent by one of the parties is computationally clo...
We settle the exact round complexity of three-party computation (3PC) in honest-majority setting, for a range of security notions such as selective abort, unanimous abort, fairness and guaranteed outp...
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...
From Keys to Databases -- Real-World Applications of Secure Multi-Party Computation
Cryptography Protocols Multi-Party Computation
2018/5/22
We discuss the widely increasing range of applications of a cryptographic technique called Multi-Party Computation. For many decades this was perceived to be of purely theoretical interest, but now it...
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...