Unbalanced private set intersection cardinality protocol with low communication cost

Lv, Siyi; Ye, Jinhui; Yin, Sijie; Cheng, Xiaochun; Chen, Feng; Liu, Xiaoyan; Li, Rui; Li, Zhaohui; Liu, Zheli; Zhou, Li

doi:10.1016/j.future.2019.09.022

Cited by 34 publications

(25 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A new and improved method, that is, 1-out-of-2 oblivious transfer (OT) extension, was used in this protocol, which is especially efficient when generating large numbers of OPRF instances. Lv et al [11] studied the unbalanced private set intersection cardinality based on commutative encryption in the semi-honest model.…”

Section: A Related Workmentioning

confidence: 99%

Efficient Threshold Private Set Intersection

Zhang

Chang

2021

IEEE Access

View full text Add to dashboard Cite

Section: A Related Workmentioning

confidence: 99%

Efficient Threshold Private Set Intersection

Zhang

Chang

2021

IEEE Access

View full text Add to dashboard Cite

“…x 3 + 2x 2 + 3x + 4 can be further represented by a vector (9,5,15,4). Next, we have (x 3 + 2x 2 + 3x + 4)…”

Section: Plaintext Encodingmentioning

confidence: 99%

“…Meanwhile, (9,5,15,4)•(9,5,15,4) mod 17 = (81,25,225,16) mod 17 = (13,8,4,16). We may verify that 3x 3 + 7x 2 + 3x + 6 can be represented by (13,8,4,16). Similarly, (x 3 + 2x 2 + 3x + 4) + (x 3 + 2x 2 + 3x + 4) mod x 4 + 1 = (2x 3 + 4x 2 + 6x + 8) ∼ = (1,10,13,8) = (9,5,15,4) + (9,5,15,4) mod 17.…”

Section: Plaintext Encodingmentioning

confidence: 99%

See 1 more Smart Citation

An Efficient BGV-type Encryption Scheme for IoT Systems

Yuan

Gao

2020

Applied Sciences

View full text Add to dashboard Cite

Internet of Thing (IoT) systems usually have less storage and computing power than desktop systems. This paper proposes an efficient BGV-type homomorphic encryption scheme in order fit for secure computing on IoT system. Our scheme reduces the storage space for switch keys and ciphertext evaluation time comparing with previous BGV-type cryptosystems. Specifically, the switch key in homomorphic computations can be a constant but no longer one for each level. Moreover, the product of two ciphertexts can be at the same sublayer as them and the multiplication operations can be repeated between two sublayers. As a result, the multiplication times will not be limited by L in an L-level circuit and, thus, the ciphertext evaluation time will decrease significantly. We implement the scheme with the C language. The performance test shows that the efficiency of the improved scheme is better than Helib in same configurations.

show abstract

“…Recently, Dong and Loukides [41 ] employed Flajolet–Martin (FM) sketch [42 ] to design an approximate PSI‐CA protocol with logarithmic complexity. More recently, Lv et al [43 ] proposed an unbalanced PSI‐CA with linear communication and computation complexity.…”

Section: Introductionmentioning

confidence: 99%