Cryptology ePrint Archive: Report 2014/630
Available versions in chronological order
20140820:190022 (posted 20-Aug-2014 19:00:22 UTC)
Efficient Oblivious Parallel Array Reads and Writes for Secure Multiparty Computation
Peeter Laud
20141125:153304 (posted 25-Nov-2014 15:33:04 UTC)
Privacy-Preserving Minimum Spanning Trees through Oblivious Parallel RAM for Secure Multiparty Computation
Peeter Laud
[
Cryptology ePrint archive
]