Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
branja
on Aug 7, 2017
|
parent
|
context
|
favorite
| on:
TFHE: Fast Fully-Homomorphic Encryption Over the T...
all the fun problems in CS are intractible
_d4bj
on Aug 7, 2017
[–]
I think the OP is referring to simulating an oblivious Turing machine on the encrypted data, which itself is a Turing machine and some data.
I don't think this is known to be intractable, just really slow (for now).
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
