Cryptography for parallel RAM from indistinguishability obfuscation

DOI10.1145/2840728.2840769zbMATH Open1334.94068OpenAlexW2293676801MaRDI QIDQ2800564FDOQ2800564

Hong-Sheng Zhou, Kai-Min Chung, Yu-Chi Chen, Russell W. F. Lai, Sherman S. M. Chow, Wei-Kai Lin

Publication date: 15 April 2016

Published in: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2840728.2840769

zbMATH Keywords

RAMPRAMrandomized encodingindistinguishability obfuscationcomputation trace

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (15)

• NanoGRAM: garbled RAM with \(\widetilde{O}(\log N)\) overhead
• No-signaling linear PCPs
• Memory checking for parallel RAMs
• Forward-Secure Searchable Encryption on Labeled Bipartite Graphs
• Succinct garbling schemes from functional encryption through a local simulation paradigm
• Laconic function evaluation for Turing machines
• Collusion-resistant functional encryption for RAMs
• Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
• No-signaling linear PCPs
• SNARGs for P from sub-exponential DDH and QR
• Delegating RAM Computations with Adaptive Soundness and Privacy
• Forward secret encrypted RAM: lower bounds and applications
• On the optimal succinctness and efficiency of functional encryption and attribute-based encryption
• Fully-succinct publicly verifiable delegation from constant-size assumptions
• Adaptively secure garbling schemes for parallel computations

This page was built for publication: Cryptography for parallel RAM from indistinguishability obfuscation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2800564)