Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Transactions on Systems Man and Cybernetics Systems

Multiparty Random Phase Wrapping Secret-Sharing Systems for Visual Data Security

You-Hyun Kim, Ongee Jeong, Inkyu Moon, Bahram Javidi

Published Mar 13, 2025• 2 citations
Publisher

Abstract

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.

DOI
10.1109/tsmc.2025.3541827

Related papers

Secure Random Phase Key Exchange Schemes for Image Cryptography

You-Hyun Kim, Minwoo Sim, Inkyu Moon +1 more

We propose novel random phase key exchange schemes for image cryptography, which are complex sinusoidal waveform versions of the Diffie-Hellman (DH) key exchange algorithm. We demonstrate that the proposed schemes can be particularly helpful to establish a shared secret key in Fourier optics-based image cryptosystems since the problem of symmetric secret key establishment is one of the fundamental difficulties in Fourier optics-based image cryptography. We also propose a ring-type key exchange system in which multiple users can securely share a secret key, which is an extension of the key exchange scheme for two users. The schemes are verified by numerical simulations.

IEEE Internet of Things Journal•Sep 18, 2019•12 citations

Double random phase encoding schemes with perfect forward secrecy for robust image cryptography

Inkyu Moon, You-Hyun Kim, Samaneh Gholami +1 more

Digital cryptosystems can provide perfect forward secrecy (PFS) for key exchange protocols based on the Diffie–Hellman (DH) scheme. However, key exchange algorithms are optimally designed only to encode small datasets, such as text and voice sets, which makes rapidly processing large-scale datasets difficult. In this paper, we propose new schemes that can efficiently and securely provide PFS in double random phase encoding (DRPE) schemes for robust image cryptography. We demonstrate that the proposed complex sinusoidal waveform versions of the DH algorithm with fusion of a random phase mask (RPM) and ephemeral secret exponents can guarantee PFS. Different experimental results reveal that the proposed schemes can enhance the security of DRPE-based image cryptosystems using a one-time RPM and PFS. We also propose a ring-type PFS scheme in which an unlimited number of users can securely share a temporary session key, which is an extension of PFS for only two users. We provide formal proof for the schemes and prove feasibility through numerical simulations.

OSA Continuum•Jul 18, 2021•7 citations

Universal share based quantum multi secret image sharing scheme

Dipak K. Rabari, Yogesh K. Meghrajani, Laxmi S. Desai

Image security for information has become increasingly critical as internet become more prevalent due to hacking and unauthorized access. To ensure the security of confidential image data, image encryption using visual cryptography plays a crucial role. To share multiple images using visual cryptography, the company organizer utilizes the concept of a universal or common share. Likewise, quantum computing is an emerging technology that facilitates secure communication. The ability of quantum computers to solve certain mathematical problems efficiently threatens the security of many current encryption algorithms. Hence, to leverage the strengths of quantum computing and visual cryptography, this research introduces a novel universal share-based quantum multi-secret sharing technique for secure image communication. Quantum computing enables the scheme to exhibit high resilience to different eavesdropping threats. Consequently, the proposed method offers robust security solution for sharing confidential images across a range of applications, including enterprise data access and military communications.

arXiv:2509.12979•Sep 16, 2025•0 citations

Realising high-dimensional quantum secret sharing with structured photons

Michael De Oliveira, Jonathan Pinnell, Isaac M. Nape +2 more

Quantum secret sharing (QSS) is a cryptographic multiparty communication technique in which a secret is divided and shared among N parties and then securely reconstructed by (N-1) cooperating parties, making it perfect for storing and sharing highly sensitive data. Challenges in high dimensional state preparation, transformation and detection, the key steps of any QSS protocol, have so far hindered experimental realisation. Here, by taking advantage of the high-dimensional encoding space accessible by a photon's orbital angular momentum, we present a toolbox for realising practical high-dimensional single photon QSS schemes that are easily scalable in both dimension and number of participants. Our implementations realised a new record in both the number of participants (N=10) and the dimensionality (d=11), with the latter facilitating the transfer of 2.89 bits of information per photon. This work is an important step towards securely distributing information across a network of nodes.

•Aug 20, 2020•0 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.

Cambridge University Press eBooks•Jun 30, 2015•591 citations

Secret key sharing schemes in optical cryptosystems based on double random phase encoding

Inkyu Moon, You-Hyun Kim

This paper overviews new secret key sharing schemes which can be useful in optical cryptosystems based on double random phase encoding. These key sharing schemes, which are complex waveform versions of the Diffie-Hellman (DH) key exchange, allow us to establish the shared secret key in the Fourier optics-based cryptosystems. We show that the presented schemes can also be applied to cryptosystems in which multiple users can share a secret key securely.

SPIE Three-Dimensional Imaging, Visualization, and Display•Apr 22, 2020•0 citations
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 degreen−1n-1n−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.
We propose novel random phase key exchange schemes for image cryptography, which are complex sinusoidal waveform versions of the Diffie-Hellman (DH) key exchange algorithm. We demonstrate that the proposed schemes can be particularly helpful to establish a shared secret key in Fourier optics-based image cryptosystems since the problem of symmetric secret key establishment is one of the fundamental difficulties in Fourier optics-based image cryptography. We also propose a ring-type key exchange system in which multiple users can securely share a secret key, which is an extension of the key exchange scheme for two users. The schemes are verified by numerical simulations.
Digital cryptosystems can provide perfect forward secrecy (PFS) for key exchange protocols based on the Diffie–Hellman (DH) scheme. However, key exchange algorithms are optimally designed only to encode small datasets, such as text and voice sets, which makes rapidly processing large-scale datasets difficult. In this paper, we propose new schemes that can efficiently and securely provide PFS in double random phase encoding (DRPE) schemes for robust image cryptography. We demonstrate that the proposed complex sinusoidal waveform versions of the DH algorithm with fusion of a random phase mask (RPM) and ephemeral secret exponents can guarantee PFS. Different experimental results reveal that the proposed schemes can enhance the security of DRPE-based image cryptosystems using a one-time RPM and PFS. We also propose a ring-type PFS scheme in which an unlimited number of users can securely share a temporary session key, which is an extension of PFS for only two users. We provide formal proof for the schemes and prove feasibility through numerical simulations.
Image security for information has become increasingly critical as internet become more prevalent due to hacking and unauthorized access. To ensure the security of confidential image data, image encryption using visual cryptography plays a crucial role. To share multiple images using visual cryptography, the company organizer utilizes the concept of a universal or common share. Likewise, quantum computing is an emerging technology that facilitates secure communication. The ability of quantum computers to solve certain mathematical problems efficiently threatens the security of many current encryption algorithms. Hence, to leverage the strengths of quantum computing and visual cryptography, this research introduces a novel universal share-based quantum multi-secret sharing technique for secure image communication. Quantum computing enables the scheme to exhibit high resilience to different eavesdropping threats. Consequently, the proposed method offers robust security solution for sharing confidential images across a range of applications, including enterprise data access and military communications.
Quantum secret sharing (QSS) is a cryptographic multiparty communication technique in which a secret is divided and shared among N parties and then securely reconstructed by (N-1) cooperating parties, making it perfect for storing and sharing highly sensitive data. Challenges in high dimensional state preparation, transformation and detection, the key steps of any QSS protocol, have so far hindered experimental realisation. Here, by taking advantage of the high-dimensional encoding space accessible by a photon's orbital angular momentum, we present a toolbox for realising practical high-dimensional single photon QSS schemes that are easily scalable in both dimension and number of participants. Our implementations realised a new record in both the number of participants (N=10) and the dimensionality (d=11), with the latter facilitating the transfer of 2.89 bits of information per photon. This work is an important step towards securely distributing information across a network of nodes.
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.