File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Path ORAM: An Extremely Simple Oblivious RAM Protocol

TitlePath ORAM: An Extremely Simple Oblivious RAM Protocol
Authors
Stefanov, EDijk, MVShi, EChan, HTHFletcher, CRen, LYu, XDevadas, S
KeywordsAccess pattern
Oblivious RAM
ORAM
Path ORAM
Issue Date2018
PublisherAssociation for Computing Machinery. The Journal's web site is located at http://jacm.acm.org/
Citation
Journal of the ACM, 2018, v. 65 n. 4, p. article no. 18 How to Cite?
DOI: http://dx.doi.org/10.1145/3177872
AbstractWe present Path ORAM, an extremely simple Oblivious RAM protocol with a small amount of client storage. Partly due to its simplicity, Path ORAM is the most practical ORAM scheme known to date with small client storage. We formally prove that Path ORAM has a O(log N) bandwidth cost for blocks of size B = Ω (log2 N) bits. For such block sizes, Path ORAM is asymptotically better than the best-known ORAM schemes with small client storage. Due to its practicality, Path ORAM has been adopted in the design of secure processors since its proposal.
DescriptionA conference version of the article has appeared in 20th ACM Conference on Computer and Communications Security (CCS), Berlin, Germany, 4-8 November 2013
Persistent Identifierhttp://hdl.handle.net/10722/290734
ISSN
0004-5411
2021 Impact Factor: 2.269
2020 SCImago Journal Rankings: 1.672
ISI Accession Number ID
WOS:000442938200002

 

DC FieldValueLanguage
dc.contributor.authorStefanov, E-
dc.contributor.authorDijk, MV-
dc.contributor.authorShi, E-
dc.contributor.authorChan, HTH-
dc.contributor.authorFletcher, C-
dc.contributor.authorRen, L-
dc.contributor.authorYu, X-
dc.contributor.authorDevadas, S-
dc.date.accessioned2020-11-02T05:46:21Z-
dc.date.available2020-11-02T05:46:21Z-
dc.date.issued2018-
dc.identifier.citationJournal of the ACM, 2018, v. 65 n. 4, p. article no. 18-
dc.identifier.issn0004-5411-
dc.identifier.urihttp://hdl.handle.net/10722/290734-
dc.descriptionA conference version of the article has appeared in 20th ACM Conference on Computer and Communications Security (CCS), Berlin, Germany, 4-8 November 2013-
dc.description.abstractWe present Path ORAM, an extremely simple Oblivious RAM protocol with a small amount of client storage. Partly due to its simplicity, Path ORAM is the most practical ORAM scheme known to date with small client storage. We formally prove that Path ORAM has a O(log N) bandwidth cost for blocks of size B = Ω (log2 N) bits. For such block sizes, Path ORAM is asymptotically better than the best-known ORAM schemes with small client storage. Due to its practicality, Path ORAM has been adopted in the design of secure processors since its proposal.-
dc.languageeng-
dc.publisherAssociation for Computing Machinery. The Journal's web site is located at http://jacm.acm.org/-
dc.relation.ispartofJournal of the ACM-
dc.rightsJournal of the ACM. Copyright © Association for Computing Machinery.-
dc.rights©ACM, YYYY. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in PUBLICATION, {VOL#, ISS#, (DATE)} http://doi.acm.org/10.1145/nnnnnn.nnnnnn-
dc.subjectAccess pattern-
dc.subjectOblivious RAM-
dc.subjectORAM-
dc.subjectPath ORAM-
dc.titlePath ORAM: An Extremely Simple Oblivious RAM Protocol-
dc.typeArticle-
dc.identifier.emailChan, HTH: hubert@cs.hku.hk-
dc.identifier.authorityChan, HTH=rp01312-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1145/3177872-
dc.identifier.scopuseid_2-s2.0-85052364322-
dc.identifier.hkuros318361-
dc.identifier.volume65-
dc.identifier.issue4-
dc.identifier.spagearticle no. 18-
dc.identifier.epagearticle no. 18-
dc.identifier.eissn1557-735X-
dc.identifier.isiWOS:000442938200002-
dc.publisher.placeUnited States-
dc.identifier.issnl0004-5411-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats