Zvika Brakerski, Craig Gentry, and Vinod Vaikuntanathan.In CRYPTO (Lecture Notes in Computer Science), Reihaneh Safavi-Naini and Ran Canetti (Eds.), Vol. Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP. In International Conference on Applied Cryptography and Network Security. Private database queries using somewhat homomorphic encryption. Dan Boneh, Craig Gentry, Shai Halevi, Frank Wang, and David J Wu.
In Proceedings of the 18th ACM conference on Computer and communications security. Countering gattaca: efficient and secure testing of fully-sequenced human genomes. Pierre Baldi, Roberta Baronio, Emiliano De Cristofaro, Paolo Gasti, and Gene Tsudik.In International Conference on Selected Areas in Cryptography.
A full RNS variant of FV like somewhat homomorphic encryption schemes.
Jean-Claude Bajard, Julien Eynard, M Anwar Hasan, and Vincent Zucca. Unobservable Communication over Fully Untrusted Infrastructure. In 2018 IEEE Symposium on Security and Privacy (SP). PIR with compressed queries and amortized query processing. Sebastian Angel, Hao Chen, Kim Laine, and Srinath Setty. For a larger example, an intersection of 2 size sets of arbitrary length items has an online running time of $12$ seconds (multi-threaded), with less than 18 MB of total communication. Our protocols outperform previous ones: for an intersection of 2 20 and $512$ size sets of arbitrary length items our protocol has a total online running time of just $1$~second (single thread), and a total communication cost of 4 MB. We build upon the unbalanced PSI protocol of Chen, Laine, and Rindal (CCS~2017) in several ways: we add efficient support for arbitrary length items, we construct and implement an unbalanced Labeled PSI protocol with small communication complexity, and also strengthen the security model using Oblivious Pseudo-Random Function (OPRF) in a pre-processing phase. Also, in a Labeled PSI setting, the sender holds a label per each item in its set, and the receiver obtains the labels from the items in the intersection. We are interested in the unbalanced PSI setting, where (1) the receiver's set is significantly smaller than the sender's, and (2) the receiver (with the smaller set) has a low-power device. Private Set Intersection (PSI) allows two parties, the sender and the receiver, to compute the intersection of their private sets without revealing extra information to each other.
0 kommentar(er)
