How to securely perform computations on secret-shared data

A secret sharing scheme is an important cryptographic procedure that enables the secure distribution of secret information, such as private images, in an untrusted network. However, in all secret sharing schemes, the sizes of the shares increase in proportion to the size of the secret information, because they involve computationally expensive polynomials of degree $n-1$ (n is total number of shares) and increasingly large modulus of modulo operations for security. Moreover, with large share sizes, it is not easy in practice to encrypt them quickly using block cipher algorithms. Therefore, ensuring the security of secret sharing for large-scale visual data with a reasonable share length and efficiently encrypting n shares properly represents formidable challenges. To overcome these challenges in secret sharing schemes, we propose new multiparty random phase wrapping secret sharing systems for visual datasets. Computational optical imaging enables the acquisition of wrapped phase information, ranging from –$\pi $to$ \pi $, to be expressed in the form of a complex sinusoidal waveform. The proposed scheme allows for large-scale secret data—such as confidential digital images and visual data, including optical images—to be securely and efficiently shared and distributed to multiple parties or agencies utilizing a digital representation of a complex sinusoidal waveform of the secret information. The proposed scheme can be useful in cryptographic key escrow systems and in use with large-scale secret data.A secret sharing scheme is an important cryptographic procedure that enables the secure distribution of secret information, such as private images, in an untrusted network. However, in all secret sharing schemes, the sizes of the shares increase in proportion to the size of the secret information, because they involve computationally expensive polynomials of degree$n-1$(n is total number of shares) and increasingly large modulus of modulo operations for security. Moreover, with large share sizes, it is not easy in practice to encrypt them quickly using block cipher algorithms. Therefore, ensuring the security of secret sharing for large-scale visual data with a reasonable share length and efficiently encrypting n shares properly represents formidable challenges. To overcome these challenges in secret sharing schemes, we propose new multiparty random phase wrapping secret sharing systems for visual datasets. Computational optical imaging enables the acquisition of wrapped phase information, ranging from –$\pi $to$\pi $, to be expressed in the form of a complex sinusoidal waveform. The proposed scheme allows for large-scale secret data—such as confidential digital images and visual data, including optical images—to be securely and efficiently shared and distributed to multiple parties or agencies utilizing a digital representation of a complex sinusoidal waveform of the secret information. The proposed scheme can be useful in cryptographic key escrow systems and in use with large-scale secret data.

IEEE Transactions on Systems Man and Cybernetics SystemsMar 13, 20252 citations

Secure Computation

Silvio M. Micali, Phillip Rogaway

Springer eBooksAug 11, 2007153 citations

A review of research on secret sharing

Ruoying Chen

This article explores the importance and challenges of secret sharing technology in the context of rapid advancements in information technology. With increasing attention on data security and privacy protection, secret sharing serves as a key cryptographic technique that ensures secure data transmission, storage, and multi-party computation by dividing secrets into multiple shares. However, existing solutions encounter performance bottlenecks when dealing with large-scale datasets, managing share updates in dynamic environments, and facing quantum computing threats. This article systematically summarizes the basic concepts, theories, classifications, and characteristics of secret sharing while analyzing its applications in financial security, medical privacy, and other fields. Furthermore, it presents recent research progress on dynamic secret sharing and anti-quantum secret sharing. The findings indicate that dynamic secret sharing schemes improve long-term key storage security, while anti-quantum secret sharing provides a solution to counteract quantum computing threats. This study not only deepens understanding of secret sharing technology but also offers insights for future research directions, significantly contributing to enhancing data protection levels.This article explores the importance and challenges of secret sharing technology in the context of rapid advancements in information technology. With increasing attention on data security and privacy protection, secret sharing serves as a key cryptographic technique that ensures secure data transmission, storage, and multi-party computation by dividing secrets into multiple shares. However, existing solutions encounter performance bottlenecks when dealing with large-scale datasets, managing share updates in dynamic environments, and facing quantum computing threats. This article systematically summarizes the basic concepts, theories, classifications, and characteristics of secret sharing while analyzing its applications in financial security, medical privacy, and other fields. Furthermore, it presents recent research progress on dynamic secret sharing and anti-quantum secret sharing. The findings indicate that dynamic secret sharing schemes improve long-term key storage security, while anti-quantum secret sharing provides a solution to counteract quantum computing threats. This study not only deepens understanding of secret sharing technology but also offers insights for future research directions, significantly contributing to enhancing data protection levels.

Applied and Computational EngineeringSep 20, 20242 citations

Secure Multiparty Computation and Secret Sharing

Ronald Cramer, Ivan Damgård, Jesper Buus Nielsen

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.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.

Cambridge University Press eBooksJun 30, 2015591 citations

Secure Computation with Preprocessing via Function Secret Sharing

Elette Boyle, Niv Gilboa, Yuval Ishai

Lecture notes in computer scienceJan 1, 2019113 citations

n-1

(n is total number of shares) and increasingly large modulus of modulo operations for security. Moreover, with large share sizes, it is not easy in practice to encrypt them quickly using block cipher algorithms. Therefore, ensuring the security of secret sharing for large-scale visual data with a reasonable share length and efficiently encrypting n shares properly represents formidable challenges. To overcome these challenges in secret sharing schemes, we propose new multiparty random phase wrapping secret sharing systems for visual datasets. Computational optical imaging enables the acquisition of wrapped phase information, ranging from –$\pi

to

\pi $, to be expressed in the form of a complex sinusoidal waveform. The proposed scheme allows for large-scale secret data—such as confidential digital images and visual data, including optical images—to be securely and efficiently shared and distributed to multiple parties or agencies utilizing a digital representation of a complex sinusoidal waveform of the secret information. The proposed scheme can be useful in cryptographic key escrow systems and in use with large-scale secret data.