More is less: perfectly secure oblivious algorithms in the multi-server setting (Q1710668)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7005638
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | More is less: perfectly secure oblivious algorithms in the multi-server setting |
scientific article; zbMATH DE number 7005638 |
Statements
More is less: perfectly secure oblivious algorithms in the multi-server setting (English)
0 references
23 January 2019
0 references
oblivious RAM
0 references
perfect security
0 references
0 references
0.8424642086029053
0 references
0.8393600583076477
0 references
0.8349214792251587
0 references
0.8160348534584045
0 references
0.8125978112220764
0 references
