Also from the same author: Satellite Internet [0] [0] https://tools.ietf.org/html/draft-omar-si-00
Their construction relies on two unproven conjectures. In particular the "Extractable Witness Encryption" conjecture is impossible under a reasonable falsifiable assumption:…
You could say that. Every time you want to run a computation on your FHE-enabled VPS you would need to upload data proportional to the maximum number of operations in the computation. Otherwise, re-running the same…
Aren't there MASSIVE (read: showstopper) complications when you want to use FHE for "looping" computations? I always thought FHE was only good if you can fully unroll your "fixed-length" computation, and even then you…
There's a bit of a terminology confusion here. When they say "spinlock", most people mean a pure spinlock that spins forever until it succeeds. "Mutex" on the other hand might have a fast-path that spins a few times…
They are also the projects that get the most attention. I wouldn't rule out that python/javascript/whatever projects have just as many, if not even more, security flaws than your typical widely-used C library. They are…
I used boost extensively in the past (2006-2011). But I have been disillusioned by all the accidental complexity. It's easy to use the complicated parts of boost, but you lose sight of the inefficiencies you introduce…
Ah, gotcha, so it's not the graph of the function that convexity refers to but the volume above the graph of the function.
Compile time is a pretty big reason.
How can a non-linear function even be convex in shape? I assume you mean the whole volume below or above the function and not just the function's surface itself? Also, what about the case where the function isn't…
Also from the same author: Satellite Internet [0] [0] https://tools.ietf.org/html/draft-omar-si-00
Their construction relies on two unproven conjectures. In particular the "Extractable Witness Encryption" conjecture is impossible under a reasonable falsifiable assumption:…
You could say that. Every time you want to run a computation on your FHE-enabled VPS you would need to upload data proportional to the maximum number of operations in the computation. Otherwise, re-running the same…
Aren't there MASSIVE (read: showstopper) complications when you want to use FHE for "looping" computations? I always thought FHE was only good if you can fully unroll your "fixed-length" computation, and even then you…
There's a bit of a terminology confusion here. When they say "spinlock", most people mean a pure spinlock that spins forever until it succeeds. "Mutex" on the other hand might have a fast-path that spins a few times…
They are also the projects that get the most attention. I wouldn't rule out that python/javascript/whatever projects have just as many, if not even more, security flaws than your typical widely-used C library. They are…
I used boost extensively in the past (2006-2011). But I have been disillusioned by all the accidental complexity. It's easy to use the complicated parts of boost, but you lose sight of the inefficiencies you introduce…
Ah, gotcha, so it's not the graph of the function that convexity refers to but the volume above the graph of the function.
Compile time is a pretty big reason.
How can a non-linear function even be convex in shape? I assume you mean the whole volume below or above the function and not just the function's surface itself? Also, what about the case where the function isn't…