搜索结果: 1-11 共查到“密码学 OT extension”相关记录11条 . 查询时间(0.046 秒)
SpOT-Light: Lightweight Private Set Intersection from Sparse OT Extension
private set intersection OT extension
2019/6/4
We describe a novel approach for two-party private set intersection (PSI) with semi-honest security. Compared to existing PSI protocols, ours has a more favorable balance between communication and com...
Efficient Pseudorandom Correlation Generators: Silent OT Extension and More
Secure computation correlated randomness pseudorandom correlation generator
2019/5/9
Secure multiparty computation (MPC) often relies on sources of correlated randomness for better efficiency and simplicity. This is particularly useful for MPC with no honest majority, where input-inde...
Actively Secure OT-Extension from q-ary Linear Codes
cryptographic protocols oblivious transfer
2018/6/19
We consider recent constructions of 11-out-of-NN OT-extension from Kolesnikov and Kumaresan (CRYPTO 2013) and from Orrú et al. (CT-RSA 2017), based on binary error-correcting codes. We generalize thei...
On the Round Complexity of OT Extension
Oblivious Transfer Extension Symmetric Key Primitives Random Oracle Model
2017/12/13
We show that any OT extension protocol based on one-way functions (or more generally any symmetric-key primitive) either requires an additional round compared to the base OTs or must make a non-black-...
SWiM: Secure Wildcard Pattern Matching From OT Extension
Pattern Matching Oblivious Transfer PRF
2017/11/28
Suppose a server holds a long text string and a receiver holds a short pattern string. Secure pattern matching allows the receiver to learn the locations in the long text where the pattern appears, wh...
Scalable Private Set Intersection Based on OT Extension
oblivious transfer private set intersection
2016/12/8
Private set intersection (PSI) allows two parties to compute the intersection of their sets without revealing any information about items that are not in the intersection. It is one of the best studie...
Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection
Oblivious transfer private set intersection multi-party computation
2016/12/8
This paper describes a 1-out-of-N oblivious transfer (OT) extension protocol with active security, which achieves very low overhead compared with the passively secure protocol of Kolesnikov and Kumare...
Oblivious Transfer (OT) is one of the most fundamental cryptographic primitives with wide-spread application in general secure multi-party computation (MPC) as well as in a number of tailored and spec...
Faster Private Set Intersection based on OT Extension
private set intersection oblivious transfer implementation
2016/1/9
Private set intersection (PSI) allows two parties to compute
the intersection of their sets without revealing any
information about items that are not in the intersection.
It is one of the best stu...
Actively Secure OT Extension with Optimal Overhead
cryptographic protocols oblivious transfer extensions
2015/12/30
We describe an actively secure OT extension protocol in the
random oracle model with efficiency very close to the passively secure
IKNP protocol of Ishai et al. (Crypto 2003). For computational secu...
Improved OT Extension for Transferring Short Secrets
OT extension 1-out-of-2 OT 1-out-of-n OT
2014/3/11
We propose an optimization and generalization of OT extension of Ishai et al. of Crypto 2003. For computational security parameter k, our OT extension for short secrets off ers O(log k) factor perform...
