Secret-shared shuffle from authenticated correlations

DOI10.1007/978-3-032-26734-4_11MaRDI QIDQ7363459zbMATH OpenFDO

Authors Xiangfu Song, Xiaojian Liang, Ye Dong, Jianli Bai, Pu Duan, Changyu Dong, Tianwei Zhang, Ee-Chien Chang

Publication date 29 September 2026

Full work available at URL https://doi.org/10.1007/978-3-032-26734-4_11

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• A Permutation Network
• Actively secure OT extension with optimal overhead
• Actively Secure Private Function Evaluation
• Amplification by shuffling: from local to central differential privacy via anonymity
• Circuits resilient to additive attacks with applications to secure computation
• Distributed differential privacy via shuffling
• Efficient Zero-Knowledge Argument for Correctness of a Shuffle
• Fast cut-and-choose-based protocols for malicious and covert adversaries
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Half-tree: halving the cost of tree expansion in COT and DPF
• How to hide circuits in MPC an efficient framework for private function evaluation
• scientific article; zbMATH DE number 3651744 (Why is no real title available?)
• scientific article; zbMATH DE number 176564 (Why is no real title available?)
• Multiparty computation for dishonest majority: from passive to active security at low cost
• Multiparty Computation from Somewhat Homomorphic Encryption
• Optimal Rearrangeable Multistage Connecting Networks
• Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
• Practically efficient multi-party sorting protocols from comparison sort algorithms
• Private set operations from oblivious switching
• Secret-shared shuffle
• Two-sided malicious security for private intersection-sum with cardinality

This page was built for publication: Secret-shared shuffle from authenticated correlations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7363459)