In a data-driven society, individuals and companies encounter numerous situations where private information is an important resource. How can parties handle confidential data if they do not trust everyone involved? This text is the first to present a comprehensive treatment of unconditionally secure techniques for multiparty computation (MPC) and secret sharing. In a secure MPC, each party possesses some private data, while secret sharing provides a way for one party to spread information on a secret such that all parties together hold full information, yet no single party has all the information. The authors present basic feasibility results from the last 30 years, generalizations to arbitrary access structures using linear secret sharing, some recent techniques for efficiency improvements, and a general treatment of the theory of secret sharing, focusing on asymptotic results with interesting applications related to MPC.
Cited By
- Desai A, Bautista O and Akkaya K Privacy-Preserving Collision Detection for Drone-based Aerial Package Delivery using Secure Multi-Party Computation Proceedings of the Twenty-fourth International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing, (510-515)
- Golob S, Pentyala S, Dowsley R, David B, Larangeira M, De Cock M and Nascimento A A Decentralized Information Marketplace Preserving Input and Output Privacy Proceedings of the Second ACM Data Economy Workshop, (1-6)
- Castro Fernandez R (2023). Data-Sharing Markets: Model, Protocol, and Algorithms to Incentivize the Formation of Data-Sharing Consortia, Proceedings of the ACM on Management of Data, 1:2, (1-25), Online publication date: 13-Jun-2023.
- Samanthula B and Patel H Privacy-Preserving and Outsourced Computation Framework for Power Usage Control in Smart Grids Proceedings of the 2023 ACM Workshop on Secure and Trustworthy Cyber-Physical Systems, (1-7)
- Chau S and Zhou Y Blockchain-enabled decentralized privacy-preserving group purchasing for retail energy plans Proceedings of the Thirteenth ACM International Conference on Future Energy Systems, (172-187)
- Peter E, Namboodiri K and Rajan B A Secretive Coded Caching for Shared Cache Systems using Placement Delivery Arrays 2022 IEEE International Symposium on Information Theory (ISIT), (1402-1407)
- An J, Wang Z, He X, Gui X, Cheng J and Gui R (2022). PPQC: A Blockchain-Based Privacy-Preserving Quality Control Mechanism in Crowdsensing Applications, IEEE/ACM Transactions on Networking, 30:3, (1352-1367), Online publication date: 1-Jun-2022.
- Wang N, Chau S and Zhou Y (2022). Privacy-preserving energy storage sharing with blockchain and secure multi-party computation, ACM SIGEnergy Energy Informatics Review, 1:1, (32-50), Online publication date: 1-Nov-2021.
- Wang N, Chau S and Zhou Y Privacy-Preserving Energy Storage Sharing with Blockchain Proceedings of the Twelfth ACM International Conference on Future Energy Systems, (185-198)
- Kapusta K, Rambaud M and Memmi G Revisiting Shared Data Protection Against Key Exposure Proceedings of the 15th ACM Asia Conference on Computer and Communications Security, (165-177)
- Wu Y, Cai S, Xiao X, Chen G and Ooi B (2020). Privacy preserving vertical federated learning for tree-based models, Proceedings of the VLDB Endowment, 13:12, (2090-2103), Online publication date: 1-Aug-2020.
- García-Marco I, Márquez-Corbella I and Ruano D (2020). High dimensional affine codes whose square has a designed minimum distance, Designs, Codes and Cryptography, 88:8, (1653-1672), Online publication date: 1-Aug-2020.
- Arias-Cabarcos P, Krupitzer C and Becker C (2019). A Survey on Adaptive Authentication, ACM Computing Surveys, 52:4, (1-30), Online publication date: 31-Jul-2020.
- Bitar R and Jaggi S Communication Efficient Secret Sharing in the Presence of Malicious Adversary 2020 IEEE International Symposium on Information Theory (ISIT), (548-553)
- Falk B, Heninger N and Rudow M (2020). Properties of constacyclic codes under the Schur product, Designs, Codes and Cryptography, 88:6, (993-1021), Online publication date: 1-Jun-2020.
- Catrina O Optimization and Tradeoffs in Secure Floating-Point Computation Proceedings of the 6th Conference on the Engineering of Computer Based Systems, (1-10)
- Zewail A and Yener A Secure Caching and Delivery for Combination Networks with Asymmetric Connectivity 2019 IEEE Information Theory Workshop (ITW), (1-5)
- Cheraghchi M (2019). Nearly optimal robust secret sharing, Designs, Codes and Cryptography, 87:8, (1777-1796), Online publication date: 1-Aug-2019.
- Feng J, Yang L and Zhang R (2019). Practical Privacy-preserving High-order Bi-Lanczos in Integrated Edge-Fog-Cloud Architecture for Cyber-Physical-Social Systems, ACM Transactions on Internet Technology, 19:2, (1-18), Online publication date: 31-May-2019.
- Gupta P, Li Y, Mehrotra S, Panwar N, Sharma S and Almanee S (2019). Obscure, Proceedings of the VLDB Endowment, 12:9, (1030-1043), Online publication date: 1-May-2019.
- Eshun S and Palmieri P A privacy-preserving protocol for indoor wi-fi localization Proceedings of the 16th ACM International Conference on Computing Frontiers, (380-385)
- Alexandru A and Pappas G Encrypted LQG using labeled homomorphic encryption Proceedings of the 10th ACM/IEEE International Conference on Cyber-Physical Systems, (129-140)
- Bangalore L, Choudhury A and Garimella G Round efficient computationally secure multi-party computation revisited Proceedings of the 20th International Conference on Distributed Computing and Networking, (292-301)
- Choi J, Butler K and Genge B (2019). Secure Multiparty Computation and Trusted Hardware, Security and Communication Networks, 2019, Online publication date: 1-Jan-2019.
- Nateghizad M, Veugen T, Erkin Z and Lagendijk R Secure Equality Testing Protocols in the Two-Party Setting Proceedings of the 13th International Conference on Availability, Reliability and Security, (1-10)
- D'Oliveira R and Rouayheb S Lifting Private Information Retrieval from Two to any Number of Messages 2018 IEEE International Symposium on Information Theory (ISIT), (1744-1748)
- von Maltitz M and Carle G Leveraging Secure Multiparty Computation in the Internet of Things Proceedings of the 16th Annual International Conference on Mobile Systems, Applications, and Services, (508-510)
- CACM Staff (2018). Predicting failure of the university, Communications of the ACM, 61:4, (8-9), Online publication date: 26-Mar-2018.
- Bitar R and Rouayheb S (2018). Staircase Codes for Secret Sharing With Optimal Communication and Read Overheads, IEEE Transactions on Information Theory, 64:2, (933-943), Online publication date: 1-Feb-2018.
- Lyu L, He X, Law Y and Palaniswami M Privacy-Preserving Collaborative Deep Learning with Application to Human Activity Recognition Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, (1219-1228)
- Ah-Fat P and Huth M Secure Multi-party Computation Proceedings of the 6th International Conference on Principles of Security and Trust - Volume 10204, (71-92)
- Mishra M, Dey B, Prabhakaran V and Diggavi S (2017). Wiretapped Oblivious Transfer, IEEE Transactions on Information Theory, 63:4, (2560-2595), Online publication date: 1-Apr-2017.
- Bogdanov A, Guo S and Komargodski I Threshold Secret Sharing Requires a Linear Size Alphabet Proceedings, Part II, of the 14th International Conference on Theory of Cryptography - Volume 9986, (471-484)
Recommendations
Verifiable Threshold Secret Sharing and Full Fair Secure Two-Party Computation
AST '09: Proceedings of the 2009 International e-Conference on Advanced Science and TechnologyBased on the verifiable encryption and zero-knowledge proof protocols of Jarecki and Shmatikov and Pedersen’s verifiable threshold secret sharing scheme, this paper proposes a new full fair secure two-party computation protocols. For getting full fair, ...
Secret sharing with secure secret reconstruction
AbstractThreshold secret sharing is a fundamental building block in information security to provide secrecy and robustness services for various cryptographic protocols. According to the definition of (t, n) threshold secret sharing, the secret ...
Quantum strongly secure ramp secret sharing
Quantum secret sharing is a scheme for encoding a quantum state (the secret) into multiple shares and distributing them among several participants. If a sufficient number of shares are put together, then the secret can be fully reconstructed. If an ...