搜索结果: 1-15 共查到“密码学 Multi-Party Computation”相关记录74条 . 查询时间(0.077 秒)
Beyond Honest Majority: The Round Complexity of Fair and Robust Multi-party Computation
Fairness and Guaranteed Output Delivery MPC Round Complexity
2019/9/5
Two of the most sought-after properties of Multi-party Computation (MPC) protocols are fairness and guaranteed output delivery (GOD), the latter also referred to as robustness. Achieving both, however...
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...
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...
Efficient Information Theoretic Multi-Party Computation from Oblivious Linear Evaluation
information theoretic multi-party computation oblivious linear evaluation
2019/1/2
Oblivious linear evaluation (OLE) is a two party protocol that allows a receiver to compute an evaluation of a sender's private, degree 11 polynomial, without letting the sender learn the evaluation p...
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...
Function-Dependent Commitments for Verifiable Multi-Party Computation
Commitments Homomorphic Cryptography Verifiable Computation
2018/7/9
In cloud computing, delegated computing raises the security issue of guaranteeing data authenticity during a remote computation. Existing solutions do not simultaneously provide fast correctness verif...
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...
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...
Error-Detecting in Monotone Span Programs with Application to Communication Efficient Multi-Party Computation
MPC cryptographic protocols
2018/5/22
Recent improvements in the state-of-the-art of MPC for non-full-threshold access structures introduced the idea of using a collision-resistant hash functions and redundancy in the secret-sharing schem...
Universally Composable Secure Two and Multi-party Computation in the Corruptible Tamper-Proof Hardware Token Model
tamper-proof token corruptible setup assumption
2017/11/13
In this work we introduce the corruptible token model. This model generalizes the stateless tamper-proof token model introduced by Katz (EUROCRYPT '07) and relaxes the trust assumption. Our improved m...
Scalable Multi-party Computation for zk-SNARK Parameters in the Random Beacon Model
SNARKs zero-knowledge multi-party computation
2017/11/1
Zero-knowledge succinct non-interactive arguments of knowledge (zk-SNARKs) have emerged as a valuable tool for verifiable computation and privacy preserving protocols. Currently practical schemes requ...
Round-Optimal Secure Multi-Party Computation
Secure Multi-Party Computation Garbled Circuits Round Complexity
2017/11/1
Secure multi-party computation (MPC) is a central cryptographic task that allows a set of mutually distrustful parties to jointly compute some function of their private inputs where security should ho...