Score:0

Can we calculate absolute value function in homomorphic encryption efficiently?

mn flag

Is it feasible to efficiently calculate a homomorphic absolute value function over ciphertext given a pair of numbers $a$ and $b$, i.e., |a-b|? Although there are approximate methods that use addition and multiplication, their runtime in my project is intolerable. Is there any homomorphic absolute value function that is faster than homomorphic multiplication? And what if $a$ and $b$ are real-value vectors?

kelalaka avatar
in flag
Welcome to Cryptography. Your question is not clear to me. Are you asking $FHE\_ABS(x)$ function that calculates the absolute value of an encrypted value? Could you provide links to existing ones?
kelalaka avatar
in flag
You can [edit] your question to clarify.
I sit in a Tesla and translated this thread with Ai:

mangohost

Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.