Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts (Q6111544): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Asymptotically Tight Bounds for Composing ORAM with PIR / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computationally volume-hiding structured encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: OptORAMa: optimal oblivious RAM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oblivious RAM with \textit{worst-case} logarithmic overhead / rank
 
Normal rank
Property / cites work
 
Property / cites work: Is There an Oblivious RAM Lower Bound? / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for one-round oblivious RAM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oblivious hashing revisited, and applications to asymptotically efficient ORAM and OPRAM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structured Encryption and Controlled Disclosure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistically-secure ORAM with $\tilde{O}(\log^2 n)$ Overhead / rank
 
Normal rank
Property / cites work
 
Property / cites work: Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing ORAM and Using It Efficiently for Secure Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structured encryption and dynamic leakage suppression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Software protection and simulation on oblivious RAMs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-server distributed ORAM with sublinear computation and constant rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Oblivious Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structured encryption and leakage suppression / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logarithmic lower bound for oblivious RAM (for all Parameters) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743385 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Yes, there is an oblivious RAM lower bound! / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for multi-server oblivious RAMs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for differentially private RAMs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oblivious RAM Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oblivious RAM with O((logN)3) Worst-Case Cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path ORAM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Is there an oblivious RAM lower bound for online reads? / rank
 
Normal rank

Latest revision as of 15:15, 1 August 2024

scientific article; zbMATH DE number 7708473
Language Label Description Also known as
English
Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts
scientific article; zbMATH DE number 7708473

    Statements

    Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts (English)
    0 references
    0 references
    0 references
    0 references
    7 July 2023
    0 references
    secure memory access primitive
    0 references
    hash queue data structure
    0 references
    0 references
    0 references

    Identifiers