搜索结果: 1-15 共查到“two-party”相关记录107条 . 查询时间(0.111 秒)
Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation
oblivious transfer differential privacy hardness amplification
2019/6/4
Consider a PPT two-party protocol Π=(A,B)Π=(A,B) in which the parties get no private inputs and obtain outputs OA,OB∈{0,1}OA,OB∈{0,1}, and let VAVA and VBVB denote the parties' individual views. Proto...
Two-Party ECDSA from Hash Proof Systems and Efficient Instantiations
threshold cryptography two-party ECDSA
2019/5/21
ECDSA is a widely adopted digital signature standard. Unfortunately, efficient distributed variants of this primitive are notoriously hard to achieve and known solutions often require expensive zero k...
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...
Two Party Distribution Testing: Communication and Security
foundations secure computation distribution testing
2018/11/12
We study the problem of discrete distribution testing in the two-party setting. For example, in the standard closeness testing problem, Alice and Bob each have tt samples from, respectively, distribut...
Secure Certification of Mixed Quantum States with Application to Two-Party Randomness Generation
quantum cryptography Mixed Quantum States
2018/11/8
We investigate sampling procedures that certify that an arbitrary quantum state on nn subsystems is close to an ideal mixed state φ⊗nφ⊗n for a given reference state φφ, up to errors on a f...
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 Two-party Threshold ECDSA from ECDSA Assumptions
threshold cryptography elliptic curve cryptography multi-party computation
2018/5/28
The Elliptic Curve Digital Signature Algorithm (ECDSA) is one of the most widely used schemes in deployed cryptography. Through its applications in code and binary authentication, web security, and cr...
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...
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...
EzPC: Programmable, Efficient, and Scalable Secure Two-Party Computation
Secure Computation secure machine learning prediction
2017/11/21
We present EZPC: a secure two-party computation (2PC) framework that generates efficient 2PC protocols from high-level, easy-to-write, programs. EZPC provides formal correctness and security guarantee...
We revisit the exact round complexity of secure two-party computation. While four rounds are known to be sufficient for securely computing general functions that provide output to one party [Katz-Ostr...
Secure Two-Party Computation with Fairness -- A Necessary Design Principle
secure computation fairness definitions of security
2017/9/28
Protocols for secure two-party computation enable a pair of mutually distrustful parties to carry out a joint computation of their private inputs without revealing anything but the output. One importa...
Round-Optimal Secure Two-Party Computation from Trapdoor Permutations
Two-Party Computation Oblivious Transfer Simultaneous Model Exchange Channel
2017/9/25
In this work we continue the study on the round complexity of secure two-party computation with black-box simulation. Katz and Ostrovsky in CRYPTO 2004 showed a 5 (optimal) round construction assuming...
TinyOLE: Efficient Actively Secure Two-Party Computation from Oblivious Linear Function Evaluation
Two-party computation Oblivious Linear Function Evaluation
2017/8/22
Conceptually our techniques lift the techniques for basing practical actively secure 2PC of Boolean circuits on OT introduced under the name TinyOT by Nielsen, Nordholt, Orlandi and Burra at Crypto 20...