Perfectly secure oblivious parallel RAM (Q1631354)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Perfectly secure oblivious parallel RAM	scientific article

Statements

scholarly article

0 references

Perfectly secure oblivious parallel RAM (English)

0 references

T.-H. Hubert Chan

0 references

0 references

0 references

publication date

6 December 2018

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-030-03810-6_23

0 references

Sorting in \(c \log n\) parallel steps

0 references

Oblivious RAMs without cryptogrpahic assumptions

0 references

Locality-preserving oblivious RAM

0 references

Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs

0 references

Oblivious Parallel RAM and Applications

0 references

On the depth of oblivious parallel RAM

0 references

Oblivious hashing revisited, and applications to asymptotically efficient ORAM and OPRAM

0 references

Perfectly secure oblivious parallel RAM

0 references

Circuit OPRAM: unifying statistically and computationally secure ORAMs and OPRAMs

0 references

Oblivious Parallel RAM: Improved Efficiency and Generic Constructions

0 references

Statistically-secure ORAM with $\tilde{O}(\log^2 n)$ Overhead

0 references

Perfectly Secure Oblivious RAM without Random Oracles

0 references

Searchable encryption with optimal locality: achieving sublogarithmic read efficiency

0 references

Binary AMD Circuits from Secure Multiparty Computation

0 references

Optimizing ORAM and Using It Efficiently for Secure Computation

0 references

Software protection and simulation on oblivious RAMs

0 references

Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation

0 references

0 references

Efficient Non-interactive Secure Computation

0 references

0 references

Self-routing superconcentrators

0 references

Perfectly secure oblivious RAM with sublinear bandwidth overhead

0 references

Oblivious RAM with O((logN)3) Worst-Case Cost

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-030-03810-6_23

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1631354

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1631354&oldid=36454410"