PrORAM

DOI10.1007/978-3-030-92068-5_17MaRDI QIDQ6041295zbMATH OpenOpenAlexFDO

Authors David G. Heath, Vladimir Kolesnikov

Publication date 26 May 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-92068-5_17

zbMATH Keywords

zero knowledgeoblivious RAM

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Sublinear zero-knowledge arguments for RAM programs
• Simple and efficient two-server ORAM
• Oblivious RAM with worst-case logarithmic overhead
• Sub-logarithmic distributed oblivious RAM with small block size
• Oblivious RAM with \textit{worst-case} logarithmic overhead

Cites work

• scientific article; zbMATH DE number 5485433 (Why is no real title available?)
• A Permutation Network
• Actively secure OT extension with optimal overhead
• Efficient pseudorandom correlation generators: silent OT extension and more
• Efficient zero-knowledge proofs of non-algebraic statements with sublinear amortized cost
• Fast reductions from RAMs to delegatable succinct constraint satisfaction problems
• OptORAMa: optimal oblivious RAM
• Perfectly secure oblivious RAM with sublinear bandwidth overhead
• Privacy-free garbled circuits with applications to efficient zero-knowledge
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Snarks for C: verifying program executions succinctly and in zero knowledge
• Software protection and simulation on oblivious RAMs
• Stacked garbling for disjunctive zero-knowledge proofs
• Stacked garbling. Garbled circuit proportional to longest execution path
• Sublinear zero-knowledge arguments for RAM programs
• The knowledge complexity of interactive proof-systems

Cited in

(1)

• Efficient proof of RAM programs from any public-coin zero-knowledge system

This page was built for publication: PrORAM

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