1
$\begingroup$

Are there any homomorphic schemes that can homomorphically compute addition and/or multiplication of encrypted floating Point data?

$\endgroup$
2
  • 2
    $\begingroup$ As you should be able to emulate FP using integer based instructions I presume that any homomorphic scheme that has the right operations available can also be used for FP calculations. If that will be efficient is unlikely. FP ops are lossy most of the time and therefore not very usable for reversible encryption; encryption schemes that are natively based on FP are rather uncommon. $\endgroup$
    – Maarten Bodewes
    Dec 29, 2017 at 12:47
  • $\begingroup$ I cant get your point .... what I read is that a chance of the FP data cannot be under the cloud computations........ And can you please explain more why FP ineffective $\endgroup$
    – 3355
    Dec 29, 2017 at 13:27

0

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Browse other questions tagged or ask your own question.