Related papers: Cryptanalysis of an image encryption scheme based …
In 2013, Tsai et al. cryptanalyzed Yeh et al. scheme and shown that Yeh et al., scheme is vulnerable to various cryptographic attacks and proposed an improved scheme. In this poster we will show that Tsai et al., scheme is also vulnerable…
A new technique for data hiding in digital image is proposed in this paper. Steganography is a well known technique for hiding data in an image, but generally the format of image plays a pivotal role in it, and the scheme is format…
This paper presents a new scheme for hiding a secret message in binary images. Given m*n cover image block, the new scheme can conceal as many as log(m*n +1) bits of data in block, by changing at most one bit in the block. The hiding…
To remove key escrow problem and avoid the need of secure channel in ID based cryptosystem Lee et al. proposed a secure key issuing protocol. However we show that it suffers from impersonation, insider attacks and incompetency of the key…
In this work, we exploit a serious security flaw in a code-based signature scheme from a 2019 work by Liu, Yang, Han and Wang. They adapt the McEliece cryptosystem to obtain a new scheme and, on top of this, they design an efficient digital…
This paper reports security problems with improper implementations of an improved version of FEA-M (fast encryption algorithm for multimedia). It is found that an implementation-dependent differential chosen-plaintext attack or its…
Perceptual image hashing methods are often applied in various objectives, such as image retrieval, finding duplicate or near-duplicate images, and finding similar images from large-scale image content. The main challenge in image hashing…
Chebyshev polynomials have been recently proposed for designing public-key systems. Indeed, they enjoy some nice chaotic properties, which seem to be suitable for use in Cryptography. Moreover, they satisfy a semi-group property, which…
A secure human identification protocol aims at authenticating human users to a remote server when even the users' inputs are not hidden from an adversary. Recently, the authors proposed a human identification protocol in the RSA Conference…
The breakthrough of achieving fully homomorphic encryption sparked enormous studies on where and how to apply homomorphic encryption schemes so that operations can be performed on encrypted data without the secret key while still obtaining…
Based on fixed point theory, this paper proposes a simple but efficient method for image integrity authentication, which is different from Digital Signature and Fragile Watermarking. By this method, any given image can be transformed into a…
Homomorphic encryption has largely been studied in context of public key cryptosystems. But there are applications which inherently would require symmetric keys. We propose a symmetric key encryption scheme with fully homomorphic evaluation…
Computationally hard problems based on coding theory, such as the syndrome decoding problem, have been used for constructing secure cryptographic schemes for a long time. Schemes based on these problems are also assumed to be secure against…
The safety of a quantum key distribution system relies on the fact that any eavesdropping attempt on the quantum channel creates errors in the transmission. For a given error rate, the amount of information that may have leaked to the…
A new scheme of probabilistic subgroup-related encryption is introduced. Some applications of this scheme based on the RSA, Diffie-Hellman and ElGamal encryption algorithms are described. Security assumptions and main advantages of this…
Several recently proposed code-based cryptosystems base their security on a slightly generalized version of the classical (syndrome) decoding problem. Namely, in the so-called restricted (syndrome) decoding problem, the error values stem…
The recently introduced approach for Encrypted Image Folding is generalized to make it Self Contained. The goal is achieved by enlarging the folded image so as to embed all the necessary information for the image recovery. The need for…
In this paper we review a number of issues on the security of quantum key distribution (QKD) protocols that bear directly on the relevant physics or mathematical representation of the QKD cryptosystem. It is shown that the cryptosystem…
In 2004, Das, Saxena and Gulati proposed a dynamic ID-based remote user authentication scheme which has many advantage such as no verifier table, user freedom to choose and change password and so on. However the subsequent papers have shown…
An analysis of a recently proposed cryptosystem based on chaotic oscillators and feedback inversion is presented. It is shown how the cryptosystem can be broken when Duffing's oscillator is considered. Some implementation problems of the…