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

OSA Continuum

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

Inkyu Moon, You-Hyun Kim, Samaneh Gholami, Ongee Jeong

Published Jul 18, 2021• 7 citations
Publisher

Abstract

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.

DOI
10.1364/osac.426537

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

Modified plaintext attacks in a session for an optical cryptosystem based on DRPE with PFS

Sachin, Ravi Kumar, Phool Singh

In this paper, the security of an optical cryptosystem based on double random phase encoding (DRPE) with perfect forward secrecy (PFS) is analyzed for a particular session. In the cryptosystem, the PFS strategy is utilized to enhance the security and key management of the traditional DRPE scheme. Our analysis reveals that the use of PFS has certain advantages in the key management approach, but the method is still vulnerable against modified plaintext attacks when the attack is performed in the same session. Also, it is noted that the method is safe against conventional plaintext attacks, but it is vulnerable to the modified chosen and known plaintext attacks. The original plaintext can be easily retrieved with the proposed attack algorithms. Numerical simulation results are presented to validate the effectiveness of the proposed attack algorithms.

Applied Optics•Dec 17, 2021•30 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

Cryptosystem based on two-step phase-shifting interferometry and the RSA public-key encryption algorithm

Xiangfeng Meng, Xiang Peng, Lutong Cai +3 more

A hybrid cryptosystem is proposed, in which one image is encrypted to two interferograms with the aid of double random-phase encoding (DRPE) and two-step phase-shifting interferometry (2-PSI), then three pairs of public–private keys are utilized to encode and decode the session keys (geometrical parameters, the second random-phase mask) and interferograms. In the stage of decryption, the ciphered image can be decrypted by wavefront reconstruction, inverse Fresnel diffraction, and real amplitude normalization. This approach can successfully solve the problem of key management and dispatch, resulting in increased security strength. The feasibility of the proposed cryptosystem and its robustness against some types of attack are verified and analyzed by computer simulations.

Journal of Optics A Pure and Applied Optics•May 8, 2009•21 citations

Beyond eCK: Perfect Forward Secrecy Under Actor Compromise and Ephemeral-key Reveal

Cas J. F. Cremers, Michèle Feltz

Abstract. We show that it is possible to achieve perfect forward secrecy in two-message or one-round key exchange (KE) protocols even in the presence of very strong active adversaries that can reveal random values of sessions and compromise long-term secret keys of parties. We provide two new game-based security models for KE protocols with increasing security guarantees, namely, eCKw and eCK-PFS. The eCKw model is a slightly stronger variant of the extended Canetti-Krawczyk (eCK) security model. The eCK-PFS model captures perfect forward secrecy in the presence of eCKw adversaries. We propose a security-strengthening transformation (i. e., a compiler) from eCKw to eCK-PFS that can be applied to protocols that only achieve security in a weaker model than eCKw, which we call eCKpassive. We show that, given a two-message Diffie-Hellman type protocol secure in eCKpassive, our transformation yields a two-message protocol that is secure in eCK-PFS. We demonstrate how our transformation can be applied to concrete KE protocols. In particular, our methodology allows us to prove the security of the first known one-round protocol that achieves perfect forward secrecy under actor compromise and ephemeral-key reveal. 1

•Jan 1, 2015•0 citations

Efficient asymmetric image authentication schemes based on photon counting-double random phase encoding and RSA algorithms

Inkyu Moon, Faliu Yi, Mingu Han +1 more

Recently, double random phase encoding (DRPE) has been integrated with the photon counting (PC) imaging technique for the purpose of secure image authentication. In this scheme, the same key should be securely distributed and shared between the sender and receiver, but this is one of the most vexing problems of symmetric cryptosystems. In this study, we propose an efficient asymmetric image authentication scheme by combining the PC-DRPE and RSA algorithms, which solves key management and distribution problems. The retrieved image from the proposed authentication method contains photon-limited encrypted data obtained by means of PC-DRPE. Therefore, the original image can be protected while the retrieved image can be efficiently verified using a statistical nonlinear correlation approach. Experimental results demonstrate the feasibility of our proposed asymmetric image authentication method.

Applied Optics•May 23, 2016•34 citations
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.
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.
In this paper, the security of an optical cryptosystem based on double random phase encoding (DRPE) with perfect forward secrecy (PFS) is analyzed for a particular session. In the cryptosystem, the PFS strategy is utilized to enhance the security and key management of the traditional DRPE scheme. Our analysis reveals that the use of PFS has certain advantages in the key management approach, but the method is still vulnerable against modified plaintext attacks when the attack is performed in the same session. Also, it is noted that the method is safe against conventional plaintext attacks, but it is vulnerable to the modified chosen and known plaintext attacks. The original plaintext can be easily retrieved with the proposed attack algorithms. Numerical simulation results are presented to validate the effectiveness of the proposed attack algorithms.
A hybrid cryptosystem is proposed, in which one image is encrypted to two interferograms with the aid of double random-phase encoding (DRPE) and two-step phase-shifting interferometry (2-PSI), then three pairs of public–private keys are utilized to encode and decode the session keys (geometrical parameters, the second random-phase mask) and interferograms. In the stage of decryption, the ciphered image can be decrypted by wavefront reconstruction, inverse Fresnel diffraction, and real amplitude normalization. This approach can successfully solve the problem of key management and dispatch, resulting in increased security strength. The feasibility of the proposed cryptosystem and its robustness against some types of attack are verified and analyzed by computer simulations.
Abstract. We show that it is possible to achieve perfect forward secrecy in two-message or one-round key exchange (KE) protocols even in the presence of very strong active adversaries that can reveal random values of sessions and compromise long-term secret keys of parties. We provide two new game-based security models for KE protocols with increasing security guarantees, namely, eCKw and eCK-PFS. The eCKw model is a slightly stronger variant of the extended Canetti-Krawczyk (eCK) security model. The eCK-PFS model captures perfect forward secrecy in the presence of eCKw adversaries. We propose a security-strengthening transformation (i. e., a compiler) from eCKw to eCK-PFS that can be applied to protocols that only achieve security in a weaker model than eCKw, which we call eCKpassive. We show that, given a two-message Diffie-Hellman type protocol secure in eCKpassive, our transformation yields a two-message protocol that is secure in eCK-PFS. We demonstrate how our transformation can be applied to concrete KE protocols. In particular, our methodology allows us to prove the security of the first known one-round protocol that achieves perfect forward secrecy under actor compromise and ephemeral-key reveal. 1
Recently, double random phase encoding (DRPE) has been integrated with the photon counting (PC) imaging technique for the purpose of secure image authentication. In this scheme, the same key should be securely distributed and shared between the sender and receiver, but this is one of the most vexing problems of symmetric cryptosystems. In this study, we propose an efficient asymmetric image authentication scheme by combining the PC-DRPE and RSA algorithms, which solves key management and distribution problems. The retrieved image from the proposed authentication method contains photon-limited encrypted data obtained by means of PC-DRPE. Therefore, the original image can be protected while the retrieved image can be efficiently verified using a statistical nonlinear correlation approach. Experimental results demonstrate the feasibility of our proposed asymmetric image authentication method.