tmrkm · Zenodo (CERN European Organization for Nuclear Research) · 2025
This source code is a Java implementation of the FME (Filtering‑with‑Multiple‑Encryption) protocol in the following paper: Takao Murakami, Yuichi Sei, Reo Eriguchi, "Augmented Shuffle Differential Privacy Protocols for Large-Domain Categorical and Key-Value Data," NDSS 2026. See https://github.com/Filtering-Multiple-Encryption/Filtering-Multiple-Encryption for more details.
Cited by 0Open access
tmrkm · Zenodo (CERN European Organization for Nuclear Research) · 2025
This source code is a Java implementation of the FME (Filtering‑with‑Multiple‑Encryption) protocol in the following paper: Takao Murakami, Yuichi Sei, Reo Eriguchi, "Augmented Shuffle Differential Privacy Protocols for Large-Domain Categorical and Key-Value Data," NDSS 2026. See https://github.com/Filtering-Multiple-Encryption/Filtering-Multiple-Encryption for more details.
Cited by 0Open access
tmrkm · Zenodo (CERN European Organization for Nuclear Research) · 2025
No description provided.
Cited by 0Open access
Alex Biryukov · 2025
Cited by 0
SpringerReference · 2012
Cited by 0
Jiawang Yi, Guanzheng Tan · Applied Optics · 2016
In traditional optical multiple-image encryption schemes, different images typically have almost the same encryption or decryption process. Provided that an attacker manages to correctly decrypt some image, the conventional attacks upon other images are much easier to be made. In this paper, a binary-tree encryption strategy for multiple images is proposed to resist the attacks in this case. The encryption schemes produced by this strategy can not only increase the security of multiple-image encryption, but also realize an authority management with high security among the users sharing a cipher image. For a simulation test, we devise a basic binary-tree encryption scheme, whose encryption nodes are based on an asymmetric double random phase encoding in the gyrator domain. The favorable simulation results about the tested scheme can testify to the feasibility of the strategy.
Cited by 22
Abdurrahman Hazer, Remzi Yıldırım · OSA Imaging and Applied Optics Congress 2021 (3D, COSI, DH, ISA, pcAOP) · 2021
A method including diffractive encoding and intermodulation has been developed to both encode multiple images and use communication bandwidth efficiently. Experimental results show that 1500 images are sent to different users as single encoded image.
Cited by 1
M. Anuradha, Sathyapriya Loganathan, G. Suseela et al. · 2023
Since the information technology revolution, cryptography has been essential for protecting sensitive information and communication. A plethora of algorithms have been developed to safeguard data and protect data integrity, with the goal of improving data security and protection. Modern cryptography is based on a variety of encryption techniques, namely Hybrid cryptography and multiple cryptography. Hybrid cryptography combines asymmetric key and symmetric key encryption to combine the strengths of both. Multiple cryptography is the process of encrypting a previously encrypted message one or more times, each time using the same or a different symmetric or asymmetric algorithm. The study proposes an approach that seeks to incorporate both hybrid and multiple cryptography as a way to combine all of their benefits while also minimizing the drawbacks that each technique has on its own to provide an additional layer of security. Although these techniques have all contributed to data protection, not all of them have been successful in providing a high level of security as they have shown a propensity for being targeted and exploited over time. This research project implements a cryptosystem based on Hybrid Multiple Cryptography (HMC) which is a novel scheme for data encryption that offers a greater level of security for sending data in an Android messaging application, in order to showcase the system's security capabilities in real time.
Cited by 1
2008
Abstract. Encryption of data using multiple, independent encryption schemes ("multiple encryption") has been suggested in a variety of contexts, and can be used, for example, to protect against partial key exposure or cryptanalysis, or to enforce threshold access to data. Most prior work on this subject has focused on the security of multiple encryption against chosen-plaintext attacks, and has shown constructions secure in this sense based on the chosen-plaintext security of the component schemes. Subsequent work has sometimes assumed that these solutions are also secure against chosen-ciphertext attacks when component schemes with stronger security properties are used. Unfortunately, this intuition is false for all existing multiple encryption schemes. Here, in addition to formalizing the problem of chosen-ciphertext security for multiple encryption, we give simple, efficient, and generic constructions of multiple encryption schemes secure against chosen-ciphertext attacks (based on any component schemes secure against such attacks) in the standard model. We also give a more efficient construction from any (hierarchical) identity-based encryption scheme secure against selectiveidentity chosen plaintext attacks. Finally, we discuss a wide range of applications for our proposed schemes. 1 Introduction Encrypting data using multiple, independent instantiations of a basic encryp-tion scheme (or schemes) is a simple-- yet powerful-- approach which can
Cited by 0
Mrs Raman Chawla · International Journal Of Engineering And Computer Science · 2015
The growth rate of the internet exceeds day by day. With the fast growth of internet, there is need to protect the sensitive data from unauthorized access. Cryptography plays a major role in the field of network security. There are many encryption techniques available currently to secure the data. Cryptography can be defined as the art or science of altering information or change it to a chaotic state, so that the real information is hard to extract during transfer over any unsecured channel. Latest advancements in technology and new concepts like quantum cryptography have added a complete new dimension to data security. The strength of this cryptographic technique comes from the fact that no one can read (or steal) the information without altering its content. This alteration alerts the communicators about the possibility of a hacker and thus promising a highly secure data transfer. Audio cryptography can be employed in audio distribution for the purpose of guaranteeing the confidentiality. Electronic commerce in audio products would be facilitated by the development of solutions which can ensure security/privacy, efficiency in compressed domain to reduce the bandwidth requirements, flexibility of implementing progressive audio quality control and computationally inexpensive to be used in real-time systems. Audio cryptography aims to minimize the residual intelligibility of the original audio and control the access to only authorized users. It is similar to but not a direct application of normal cryptographic techniques. The main advantage is that scrambled audio are still validly formatted which can be played by the corresponding players. In this research work, a novel method for audio encryption is proposed using random permutation with multiple key applications. The proposed method would not only provide highly secure audio but also efficient for audio file having higher frequency band. MATLAB R2013a has been used as an implementation platform using signal processing tool box.
Cited by 5
DONG Jiabin, LU Chenxu, YU Jiawen et al. · SHILAP Revista de lepidopterología · 2018
With rapid development of internet technology, disclosures of communication privacy and information took place frequently. Thus, information security technology, especially for multiple-image encryption technique, had become focus both at home and abroad. Several major developments of multiple-image encryption technique in recent years were summarized in this paper, including encryption techniques based on multiplexing, holography, compressive sensing, and chaotic maps. Besides the characteristic and realization of every encryption method were introduced. Finally the existing problems and prospects were discussed.
Cited by 0Open access
Atsushi Fujioka, Eiichiro Fujisaki, Keita Xagawa · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · 2014
We study non-malleability of multiple public-key encryption (ME) schemes. The main difference of ME from the threshold public-key encryption schemes is that there is no dealer to share a secret among users; each user can independently choose their own public-keys; and a sender can encrypt a message under ad-hoc multiple public keys of his choice. In this paper we tackle non-malleability of ME. We note that the prior works only consider confidentiality of messages and treat the case that all public keys are chosen by honest users. In the multiple public-key setting, however, some application naturally requires non-malleability of ciphertexts under multiple public keys including malicious users'. Therefore, we study the case and have obtained the following results:·We present three definitions of non-malleability of ME, simulation-based, comparison-based, and indistinguishability-based ones. These definitions can be seen as an analogue of those of non-malleable public-key encryption (PKE) schemes. Interestingly, our definitions are all equivalent even for the “invalid-allowing” relations. We note that the counterparts of PKE are not equivalent for the relations.·The previous strongest security notion for ME, “indistinguishability against strong chosen-ciphertext attacks (sMCCA)” [1], does not imply our notion of non-malleability against chosen-plaintext attacks.·Non-malleability of ME guarantees that the single message indistinguishability-based notion is equivalent to the multiple-message simulation-based notion, which provides designers a fundamental benefit.·We define new, stronger decryption robustness for ME. A non-malleable ME scheme is meaningful in practice if it also has the decryption robustness.·We present a constant ciphertext-size ME scheme (meaning that the length of a ciphertext is independent of the number of public-keys) that is secure in our strongest security notion of non-malleability. Indeed, the ciphertext overhead (i.e., the length of a ciphertext minus that of a plaintext) is the combined length of two group elements plus one hash value, regardless of the number of public keys. Then, the length of the partial decryption of one user consists of only two group elements, regardless of the length of the plaintext.
Cited by 0
Guohai Situ, Jingjuan Zhang · Optics Letters · 2005
We introduce the technique of wavelength multiplexing into a double random-phase encoding system to achieve multiple-image encryption. Each primary image is first encrypted by the double phase encoding method and then superposed to yield the final enciphered image. We analyze the minimum separation between two adjacent multiplexing wavelengths through cross talk and the multiplexing capacity through the correlation coefficient. Computer simulations are performed to demonstrate the concept. This technique can be used for hiding multiple images as well.
Cited by 401
Hong Di, Kangfeng Zheng, Xin Zhang et al. · Applied Optics · 2012
We present multiple-image encryption (MIE) based on compressive holography. In the encryption, a holographic technique is employed to record multiple images simultaneously to form a hologram. The two-dimensional Fourier data of the hologram are then compressed by nonuniform sampling, which gives rise to compressive encryption. Decryption of individual images is cast into a minimization problem. The minimization retains the sparsity of recovered images in the wavelet basis. Meanwhile, total variation regularization is used to preserve edges in the reconstruction. Experiments have been conducted using holograms acquired by optical scanning holography as an example. Computer simulations of multiple images are subsequently demonstrated to illustrate the feasibility of the MIE scheme.
Cited by 48Open access
Chin, Ji Jian, Poh, Geong Sen, Mohamad, Moesfa Soeheila · Siti Hasmah Digital Library-MMU Institutiona Repository (Multimedia University) · 2018
Cited by 0
Huy Quoc Le, Dung Hoang Duong, Willy Susilo et al. · Lecture notes in computer science · 2022
Cited by 0
Wei Lin, Jinlong Fei, Yuefei Zhu et al. · 2014
Research on unknown network protocol reverse engineering is of great significance in many network security applications. Currently most of methods are limited in analyzing plain-text protocols, and a few of method can partly analyze the encryption protocol which is powerless for multiple encryption protocol or sectional encryption protocol. This paper proposes a method of encrypted protocol reverse engineering based on dynamic taint analysis. The method uses Pin to record executed instructions, and then conducts off-line analysis of the data dependencies to build two taint propagation graphs on instruction and function level, then recover the decryption process. The decrypted plaintext can be located due to the decryption process feature. And then, the format of protocol can be parsed. Experiments show that the method can accurately locate the decrypted protocol data of the multiple encryption and sectional encryption protocol, and restore the original format.
Cited by 4
Ke Zheng, Zhang, Ey Lam et al. · 2012
Cited by 0
Iosr Journals, Sangeeta Sharma Soumya Balachandran · Figshare · 2014
Cited by 0Open access
Sapna Sinha, Vishal Bhatnagar · 2012
art of hiding information behind the image is a popular concept. In this paper we have introduced a blend of multiple encryption techniques to hide information behind an image. In this paper we have discussed Steganography and encryption techniques that can be combined in several ways to strengthen information security. The effectiveness of the individual encryption techniques is pondered upon. The planned work flow to develop such an application is also discussed.
Cited by 0