Black-box parallel garbled RAM

DOI10.1007/978-3-319-63715-0_3MaRDI QIDQ1678363zbMATH OpenOpenAlexFDO

Authors Steve Lu, Rafail Ostrovsky

Publication date 15 November 2017

Full work available at URL https://doi.org/10.1007/978-3-319-63715-0_3

zbMATH Keywords

black-box cryptographygarbled RAMone-way functionsPRAMsecure computation

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Garbled RAM from one-way functions
• How to garble RAM programs?
• Oblivious parallel RAM and applications
• Garbled RAM revisited
• Adaptively secure garbling schemes for parallel computations

Cited in

(19)

• Constant-round maliciously secure two-party computation in the RAM model
• \textsc{EpiGRAM}: practical garbled RAM
• Adaptively secure computation for RAM programs
• Adaptively secure garbling schemes for parallel computations
• Oblivious parallel RAM and applications
• Cryptography for parallel RAM from indistinguishability obfuscation
• Garbled RAM from one-way functions
• How to garble RAM programs?
• Garbled RAM revisited
• Collusion-resistant functional encryption for RAMs
• NanoGRAM: garbled RAM with \(\widetilde{O}(\log N)\) overhead
• Succinct arguments for RAM programs via projection codes
• Tri-state circuits. A circuit model that captures RAM
• Memory checking for parallel RAMs
• Privacy-preserving Dijkstra
• \textsf{PicoGRAM}: practical garbled RAM from decisional Diffie-Hellman
• Multiparty garbling from OT with linear scaling and RAM support
• Efficient permutation correlations and batched random access for two-party computation
• \textsf{Zebra}: arithmetic garbled RAM for large words from DCR

This page was built for publication: Black-box parallel garbled RAM

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