Secure Multi-party Shuffling

DOI10.1007/978-3-319-25258-2_32zbMath1471.68040OpenAlexW2293776292MaRDI QIDQ3460735

Mahnush Movahedi, Jared Saia, Mahdi Zamani

Publication date: 8 January 2016

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-25258-2_32

Mathematics Subject Classification ID

Cryptography (94A60) Network protocols (68M12) Computer security (68M25) Communication complexity, information complexity (68Q11)

Related Items (3)

Secure multi-party computation in large networks ⋮ Uniform reliable broadcast in anonymous distributed systems with fair lossy channels ⋮ Spreading the privacy blanket: differentially oblivious shuffling for differential privacy

Cites Work

• A full proof of the BGW protocol for perfectly secure multiparty computation
• Sorting in \(c \log n\) parallel steps
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
• How to Shuffle in Public
• Software protection and simulation on oblivious RAMs
• Financial Cryptography
• Communication Locality in Secure Multi-party Computation
• Practically Efficient Multi-party Sorting Protocols from Comparison Sort Algorithms
• Fast byzantine agreement
• Cryptographic defense against traffic analysis
• Advances in Cryptology - EUROCRYPT 2004
• Randomized Shellsort
• A Permutation Network
• Brief announcement
• Theory of Cryptography

This page was built for publication: Secure Multi-party Shuffling