Hey r/compsci, I just finished writing a post about a 1988 paper that completely blew my mind, and I wanted to share the idea and get your take on it.

Most of crypto relies on computational assumptions: things we hope are hard, like “factoring is tough” or “you can’t invert a one-way function.”

But back in 1988, Ben-Or, Goldwasser, Kilian, and Wigderson (BGKW) tossed all that out. They didn’t replace computational hardness with another computational assumption; they replaced it with a physical one: isolation.

Instead of assuming an attacker can’t compute something, you just assume two cooperating provers can’t talk to each other during the proof. They showed that isolation itself can be seen as a cryptographic primitive.

That one shift is huge:

**Unconditional S…

Similar Posts

Loading similar posts...

Keyboard Shortcuts

Navigation
Next / previous item
j/k
Open post
oorEnter
Preview post
v
Post Actions
Love post
a
Like post
l
Dislike post
d
Undo reaction
u
Recommendations
Add interest / feed
Enter
Not interested
x
Go to
Home
gh
Interests
gi
Feeds
gf
Likes
gl
History
gy
Changelog
gc
Settings
gs
Browse
gb
Search
/
General
Show this help
?
Submit feedback
!
Close modal / unfocus
Esc

Press ? anytime to show this help