搜索结果: 1-15 共查到“军事学 OT”相关记录22条 . 查询时间(0.046 秒)
Efficient Range-Trapdoor Functions and Applications: Rate-1 OT and More
Trapdoor functions range trapdoor hash power DDH
font style='font-size:12px;'>
2019/9/3
Substantial work on trapdoor functions (TDFs) has led to many powerful notions and applications. However, despite tremendous work and progress, all known constructions have prohibitively large public ...
SpOT-Light: Lightweight Private Set Intersection from Sparse OT Extension
private set intersection OT extension
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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...
Multi-Authority Attribute-Based Encryption from LWE in the OT Model
attribute-based encryption LWE
font style='font-size:12px;'>
2019/3/13
In a (ciphertext policy) attribute-based encryption (ABE) scheme, a ciphertext is associated with a predicate ϕϕ and a secret key is associated with a string xx such that a key decrypts a ci...
Actively Secure OT-Extension from q-ary Linear Codes
cryptographic protocols oblivious transfer
font style='font-size:12px;'>
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...
Two-Message Statistical Sender-Private OT from LWE
oblivious transfer learning with errors
font style='font-size:12px;'>
2018/6/5
We construct a two-message oblivious transfer (OT) protocol without setup that guarantees statistical privacy for the sender even against malicious receivers. Receiver privacy is game based and relies...
On Perfectly Secure 2PC in the OT-hybrid model
2PC perfect security OT-hybrid model
font style='font-size:12px;'>
2018/4/4
In addition to the obvious theoretical appeal of the question towards better understanding secure computation, perfect, as opposed to statistical reductions may be useful for designing MPC protocols w...
On the Round Complexity of OT Extension
Oblivious Transfer Extension Symmetric Key Primitives Random Oracle Model
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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...
k-Round MPC from k-Round OT via Garbled Interactive Circuits
MPC DDH
font style='font-size:12px;'>
2017/11/27
At the core of our constructions is a new framework for garbling interactive circuits. Roughly speaking, it allows for garbling interactive machines that participates in interactions of a special form...
Resource-efficient OT combiners with active security
oblivious transfer combiners secret sharing
font style='font-size:12px;'>
2017/6/9
An OT-combiner takes nn implementations of the oblivious transfer (OT) functionality, some of which may be faulty, and produces a secure instance of oblivious transfer as long as a large enough number...
Scalable Private Set Intersection Based on OT Extension
oblivious transfer private set intersection
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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...
Fast Actively Secure OT Extension for Short Secrets
cryptographic protocols OT
font style='font-size:12px;'>
2016/12/8
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
font style='font-size:12px;'>
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...