Parallel Oblivious Array Access for Secure Multiparty Computation and Privacy-Preserving Minimum Spanning Trees
In this paper, we describe efficient protocols to perform in parallel many reads and writes in private arrays according to private indices. The protocol is implemented on top of the Arithmetic Black Box (ABB) and can be freely composed to build larger privacypreserving applications. For a large clas...
Main Author: | Laud Peeter |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2015-06-01
|
Series: | Proceedings on Privacy Enhancing Technologies |
Subjects: | |
Online Access: | https://doi.org/10.1515/popets-2015-0011 |
Similar Items
-
Generation and Distribution of Quantum Oblivious Keys for Secure Multiparty Computation
by: Mariano Lemus, et al.
Published: (2020-06-01) -
Privacy-preserving record linkage in large databases using secure multiparty computation
by: Peeter Laud, et al.
Published: (2018-10-01) -
Preprocessing Based Verification of Multiparty Protocols with Honest Majority
by: Laud Peeter, et al.
Published: (2017-10-01) -
Randomized Oblivious Transfer for Secure Multiparty Computation in the Quantum Setting
by: Bruno Costa, et al.
Published: (2021-07-01) -
Externally Verifiable Oblivious RAM
by: Gancher Joshua, et al.
Published: (2017-04-01)