The complexity of secure RAMs (Q6057308): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: OptORAMa: optimal oblivious RAM / 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: Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / 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: Q5743386 / 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 encrypted multi-maps and searchable encryption in the leakage cell probe model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for differentially private RAMs / rank
 
Normal rank

Latest revision as of 02:44, 3 August 2024

scientific article; zbMATH DE number 7745695
Language Label Description Also known as
English
The complexity of secure RAMs
scientific article; zbMATH DE number 7745695

    Statements