Cryptography for Parallel RAM from Indistinguishability Obfuscation

DOI10.1145/2840728.2840769zbMath1334.94068OpenAlexW2293676801MaRDI QIDQ2800564

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

PRAMRAMrandomized encodingindistinguishability obfuscationcomputation trace

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (11)

Succinct garbling schemes from functional encryption through a local simulation paradigm ⋮ Delegating RAM Computations with Adaptive Soundness and Privacy ⋮ SNARGs for P from sub-exponential DDH and QR ⋮ Adaptively secure garbling schemes for parallel computations ⋮ On the optimal succinctness and efficiency of functional encryption and attribute-based encryption ⋮ Laconic function evaluation for Turing machines ⋮ Collusion-resistant functional encryption for RAMs ⋮ NanoGRAM: garbled RAM with \(\widetilde{O}(\log N)\) overhead ⋮ Fully-succinct publicly verifiable delegation from constant-size assumptions ⋮ No-signaling linear PCPs ⋮ No-signaling linear PCPs

This page was built for publication: Cryptography for Parallel RAM from Indistinguishability Obfuscation