Simple and efficient two-server ORAM (Q1710667)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Simple and efficient two-server ORAM	scientific article

Statements

scholarly article

0 references

Simple and efficient two-server ORAM (English)

0 references

0 references

0 references

Jonathan N. Katz

0 references

publication date

23 January 2019

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-030-03332-3_6

0 references

Asymptotically Tight Bounds for Composing ORAM with PIR

0 references

Verifiable Oblivious Storage

0 references

Function Secret Sharing

0 references

0 references

0 references

Three-Party ORAM for Secure Computation

0 references

TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption

0 references

Optimizing ORAM and Using It Efficiently for Secure Computation

0 references

Automata, Languages and Programming

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

Distributed Oblivious RAM for Secure Two-Party Computation

0 references

0 references

Oblivious RAM Revisited

0 references

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

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-030-03332-3_6

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1710667

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