Adaptive garbled RAM from laconic oblivious transfer

DOI10.1007/978-3-319-96878-0_18MaRDI QIDQ775994zbMATH OpenOpenAlexFDO

Authors Sanjam Garg, Rafail Ostrovsky, Akshayaram Srinivasan

Publication date 30 June 2020

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

zbMATH Keywords

adaptive garbled RAM scheme

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Cryptography (94A60) Database theory (68P15)

Recommendations

• Adaptively secure garbling with near optimal online complexity
• Perfectly secure oblivious RAM with sublinear bandwidth overhead
• Oblivious RAM Revisited
• Adaptively indistinguishable garbled circuits
• Adaptive security of practical garbling schemes
• scientific article; zbMATH DE number 1302802
• Adaptively secure garbling schemes for parallel computations
• Adaptively secure garbled circuits from one-way functions
• Efficient adaptively secure zero-knowledge from garbled circuits
• Adaptive oblivious transfer with access control from lattice assumptions

Cited in

(12)

• Adaptively secure garbling schemes for parallel computations
• Bounded Collusion ABE for TMs from IBE
• Delegating RAM computations with adaptive soundness and privacy
• Adaptive succinct garbled RAM or: how to delegate your database
• Collusion-resistant functional encryption for RAMs
• \textsc{EpiGRAM}: practical garbled RAM
• Laconic function evaluation, functional encryption and obfuscation for RAMs with sublinear computation
• On the optimal succinctness and efficiency of functional encryption and attribute-based encryption
• Cut-and-choose for garbled RAM
• Adaptively secure garbling with near optimal online complexity
• The cost of adaptivity in security games on graphs
• New constructions of hinting PRGs, OWFs with encryption, and more

This page was built for publication: Adaptive garbled RAM from laconic oblivious transfer

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