Secret-Shared Shuffle
- 5 December 2020
- book chapter
- Published by Springer Nature
- p. 342-372
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Secure Multiparty RAM Computation in Constant Rounds2016
- Revisiting Square-Root ORAM: Efficient Random Access in Multi-party Computation2016
- ObliVM: A Programming Framework for Secure Computation2015
- Efficient, Oblivious Data Structures for MPC2014
- Garbled RAM Revisited2014
- How to Hide Circuits in MPC an Efficient Framework for Private Function Evaluation2013
- Secure two-party computation in sublinear (amortized) time2012
- Extending Oblivious Transfers Efficiently2003
- How to construct random functionsJournal of the ACM, 1986
- Optimal Rearrangeable Multistage Connecting NetworksBell System Technical Journal, 1964