Secure Multi-party Shuffling
- 20 November 2015
- book chapter
- Published by Springer Nature
- Vol. 2015, 459-473
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Practically Efficient Multi-party Sorting Protocols from Comparison Sort Algorithms2013
- Randomized ShellsortJournal of the ACM, 2011
- How to Shuffle in Public2007
- Provable Unlinkability against Traffic AnalysisLecture Notes in Computer Science, 2004
- Dining Cryptographers Revisited2004
- Software protection and simulation on oblivious RAMsJournal of the ACM, 1996
- The dining cryptographers problem: Unconditional sender and recipient untraceabilityJournal of Cryptology, 1988
- Sorting inc logn parallel stepsCombinatorica, 1983
- Untraceable electronic mail, return addresses, and digital pseudonymsCommunications of the ACM, 1981
- A Permutation NetworkJournal of the ACM, 1968