I want to implement the ATV-FHE scheme as described by Adriana López-Alt, Eran Tromer, Vinod Vaikuntanathan: On-the-Fly Multiparty Computation on the Cloud via Multikey Fully Homomorphic Encryption (ePrint revised 2014, originally in Proceeding of STOC 2012); and based on it I want to compare homomorphically a vector of integers. Would this be a valuable application, something that is both new and useful ?

By new, I mean that the integer comparison I want to implement is for a multikey FHE. For FHE there are some very good implementations that deal with homomorphic integer comparison and sorting.

  • $\begingroup$ Any idea of why the scheme has been cited as ATV rather than LTV? The first author seems to refer to herself by the name López-Alt. $\endgroup$
    – fgrieu
    Nov 25 '15 at 7:00
  • $\begingroup$ Are you sure sorting was ever introduced with FHE? "Bit-Slice Auction Circuit" (IACR 2002/189) could be a hint on comparing operation. $\endgroup$ Nov 26 '15 at 10:46
  • $\begingroup$ I have come across some papers that deal with homomorphic sorting, like Recent Advances in Homomorphic Encryption researchgate.net/publication/… and Low Depth Circuits for homomorphic sorting which can be found here eprint.iacr.org/2015/274.pdf $\endgroup$ Nov 27 '15 at 12:08

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.