Live data from Hacker News

Practical homomorphic encryption over integers (2017)

arxiv.org

11–20 of 57 posts

Re: Practical homomorphic encryption over integers (2017)

#11
post #3
post #2

This is one of the current 'tech' trends that I'm following, the idea of homomorphic encryption is really cool. I feel like there is a lot of real world applications for it, but I have failed to find them yet.

One of the big ones is internet searches. Also processing PII/HIPAA data.

How does this affect internet searches?

Re: Practical homomorphic encryption over integers (2017)

#12
post #3

Earlier quoted context omitted.

One of the big ones is internet searches. Also processing PII/HIPAA data.

How does this affect internet searches?

Potentially a search engine could provide results without knowing the actual query, although that would make it difficult to identify new trends or determine which results are/aren't being clicked, so it probably wouldn't be competitive as a general purpose search engine.

Re: Practical homomorphic encryption over integers (2017)

#13
post #4
post #2

This is one of the current 'tech' trends that I'm following, the idea of homomorphic encryption is really cool. I feel like there is a lot of real world applications for it, but I have failed to find them yet.

I really want to sarcastically say "blockchain homomorphic encryption", but, well, it's not necessarily a terrible idea, honestly. One can imagine some combination of the primitives in which you could prove that you added here the same amount you subtracted from there, that neither total is below zero, but for which the number actually transferred is encrypted. The current use case for something like BitCoin is often…

I think this is what zcash already does.

Re: Practical homomorphic encryption over integers (2017)

#14
post #13
post #4

Earlier quoted context omitted.

I really want to sarcastically say "blockchain homomorphic encryption", but, well, it's not necessarily a terrible idea, honestly. One can imagine some combination of the primitives in which you could prove that you added here the same amount you subtracted from there, that neither total is below zero, but for which the number actually transferred is encrypted. The current use case for something like BitCoin is often…

I think this is what zcash already does.

zCash uses zk-SNARKs for secret transactions. Which are awesome. But homomorphic encryption allows general-purpose computation.

Re: Practical homomorphic encryption over integers (2017)

#15
post #5
post #2

This is one of the current 'tech' trends that I'm following, the idea of homomorphic encryption is really cool. I feel like there is a lot of real world applications for it, but I have failed to find them yet.

The "Confidential Transactions" scheme for cryptocurrencies uses homomorphic encryption. The idea is that you can prove that the encrypted input and output amounts in a transaction balance to zero, without having to actually reveal what any of those amounts are. See https://people.xiph.org/~greg/confidential_values.txt

CTs don't use homomorphic encryption. They use "additively homomorphic commitments" which are, essentially, cryptographic proofs.

Re: Practical homomorphic encryption over integers (2017)

#17
Homomorphic encryption is cool, but it's not the sort of thing most developers will want to use in their apps. Most cryptography failures (BEAST, CRIME, the Apple iMessage attack, etc.) that allow plaintext recovery are the result of chosen-ciphertext attacks.

You want authenticated encryption instead. https://tonyarcieri.com/all-the-crypto-code-youve-ever-writt...

You can sort of build something authenticated on top of a homomorphic cryptosystem, but it's kind of a hack: https://paragonie.com/blog/2017/12/assuring-ciphertext-integ...

Re: Practical homomorphic encryption over integers (2017)

#18

Homomorphic encryption is cool, but it's not the sort of thing most developers will want to use in their apps. Most cryptography failures (BEAST, CRIME, the Apple iMessage attack, etc.) that allow plaintext recovery are the result of chosen-ciphertext attacks. You want authenticated encryption instead. https://tonyarcieri.com/all-the-crypto-code-youve-ever-writt... You can sort of build something authenticated on top…

It's not something most developers will want to use in their apps for application security, but it is absolutely something that folks may want to use when training machine learning models based on customer data. As I understand it, this is one of the big "pie in the sky" goals for homomorphic encryption—having an encrypted model trained on encrypted data that only the customer can use for inference.

Re: Practical homomorphic encryption over integers (2017)

#19
post #14
post #13

Earlier quoted context omitted.

I think this is what zcash already does.

zCash uses zk-SNARKs for secret transactions. Which are awesome. But homomorphic encryption allows general-purpose computation.

These fully homomorphic encryption systems can do boolean circuits, which are no more powerful than the arithmetic circuits you get with zk-SNARKs (in fact, are an instance of arithmetic circuits). And with some zk-SNARKs, you get recursive composition, which lets you do arbitrarily many steps of a transition function expressed as a zk-SNARK, which is just as general purpose (albeit more involved) as applying a bunch of boolean circuits to some data.

Re: Practical homomorphic encryption over integers (2017)

#20
post #2

This is one of the current 'tech' trends that I'm following, the idea of homomorphic encryption is really cool. I feel like there is a lot of real world applications for it, but I have failed to find them yet.

One of the things another team at my organisation is working on is using it so that competitors can pool their data to do better analytics over the whole corpus without actually revealing their secrets to the other company - https://www.n1analytics.com/.
Post reply on HN