Towards More Secure Constructions of Adjustable Join Schemes

Khazaei, Shahram; Rafiee, Mojtaba

doi:10.1109/tdsc.2020.3022320

Cited by 3 publications

(3 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…More precisely, during encryption, each set is appropriately expanded to the size of the universal set, and then, during evaluation, it should be checked for each element of the universal set whether this element exists in the queried sets or not. It should be noted that in the literature, the problem of computing the set intersection in polynomial time, without restrictions on the size of the universal set and without disclosing any information except the intersection result, is known as an open problem [ 5 , 14 ].…”

Section: Our Constructionmentioning

confidence: 99%

“…Multi-adjustable Join (M-Adjoin) Schemes. The M-Adjoin scheme, first proposed by Khazaei and Rafiee [ 14 , 15 ], is a symmetric-key primitive that supports the secure join queries for a list of column labels on an encrypted database. The scenario model for this functionality consists of two main parties: a user and a server.…”

Section: Introductionmentioning

confidence: 99%

“… In order to increase efficiency, the evaluation of set intersection must be done in polynomial-time complexity while no information is revealed except the intersection result. In the literature, the computation of set intersection in such a setting and without any constraints on the problem is known as an open problem and is investigated from a theoretical perspective [ 5 , 14 ]. To overcome this problem, we consider a relaxed version in which size of universal set shared between clients is polynomial in security parameter.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Flexible multi-client functional encryption for set intersection

Rafiee

2023

J Supercomput

View full text Add to dashboard Cite

A multi-client functional encryption ( ) scheme [Goldwasser–Gordon–Goyal 2014] for set intersection is a cryptographic primitive that enables an evaluator to learn the intersection from all sets of a predetermined number of clients, without need to learn the plaintext set of each individual client. Using these schemes, it is impossible to compute the set intersections from arbitrary subsets of clients, and thus, this constraint limits the range of its applications. To provide such a possibility, we redefine the syntax and security notions of schemes, and introduce flexible multi-client functional encryption ( ) schemes. We extend the security of schemes to security of schemes in a straightforward way. For a universal set with polynomial size in security parameter, we propose an construction for achieving security. Our construction computes set intersection for n clients that each holds a set with m elements, in time . We also prove the security of our construction under DDH1 that it is a variant of the symmetric external Diffie–Hellman (SXDH) assumption.

show abstract

Section: Our Constructionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%