Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
© 2018 Society for Industrial and Applied Mathematics. We show how to construct indistinguishability obfuscation (\bfi/bfO) for RAM programs with bounded space, assuming/bfi/bfO for circuits and one-way functions, both with subexponential security. That is, given a RAM program whose computation requ...
Main Authors: | Bitansky, Nir (Author), Canetti, Ran (Author), Garg, Sanjam (Author), Holmgren, Justin (Author), Jain, Abhishek (Author), Lin, Huijia (Author), Pass, Rafael (Author), Telang, Sidharth (Author), Vaikuntanathan, Vinod (Author) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor) |
Format: | Article |
Language: | English |
Published: |
Society for Industrial & Applied Mathematics (SIAM),
2021-11-08T20:25:00Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Indistinguishability Obfuscation from Functional Encryption
by: Bitansky, Nir, et al.
Published: (2018) -
Indistinguishability Obfuscation: From Approximate to Exact
by: Bitansky, Nir, et al.
Published: (2017) -
Succinct garbled RAM from indistinguishablity obfuscation
by: Holmgren, Justin Lee
Published: (2016) -
Limits on the Locality of Pseudorandom Generators and Applications to Indistinguishability Obfuscation
by: Lombardi, Alex, et al.
Published: (2021) -
Structure Versus Hardness Through the Obfuscation Lens
by: Bitansky, Nir, et al.
Published: (2022)