Efficient, oblivious data structures for MPC (Q2936626)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient, oblivious data structures for MPC |
scientific article; zbMATH DE number 6383752
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient, oblivious data structures for MPC |
scientific article; zbMATH DE number 6383752 |
Statements
Efficient, Oblivious Data Structures for MPC (English)
0 references
6 January 2015
0 references
multiparty computation
0 references
data structures
0 references
oblivious RAM
0 references
shortest path algorithm
0 references
0.8774330019950867
0 references
0.8182850480079651
0 references
0.8055495023727417
0 references
0.8043694496154785
0 references
0.7967245578765869
0 references
