Figure - available from: Soft Computing
This content is subject to copyright. Terms and conditions apply.
Source publication
In this paper we show some new ideas of hiding several secrets with the use of fuzzy vault construction and, in addition, a few systems based on presented concept. The main assumption is that all pieces of information are put into single vault and each of the secrets is linked with individual key. The keys are required to be disjunctive, and each o...
Similar publications
This article proposes bit flipping method to conceal secret data in the original image. Here a block consists of 2 pixels and thereby flipping one or two LSBs of the pixels to hide secret information in it. It exists in two variants. Variant-1 and Variant-2 both use 7th and 8th bit of a pixel to conceal the secret data. Variant-1 hides 3 bits per a...
![FIGURE 13. The model architecture of ADV EMB scheme [88].](publication/340180303/figure/fig3/AS:873317967855617@1585226637328/The-model-architecture-of-ADV-EMB-scheme-88_Q320.jpg)
![FIGURE 14. The model architecture of GSK method [16].](publication/340180303/figure/fig4/AS:873317967884296@1585226637358/The-model-architecture-of-GSK-method-16_Q320.jpg)
In the past few years, the Generative Adversarial Network (GAN), which proposed in 2014, has achieved great success. There have been increasing research achievements based on GAN in the field of computer vision and natural language processing. Image steganography is an information security technique aiming at hiding secret messages in common digita...
Image Steganography is data hiding technology to transmit securely significant data in an open channel. In this paper, we present performance analysis of Least Significant Bit (LSB) substitution and Pixel-Value Differencing (PVD) methods commonly used in image steganography. The comparison of these methods is performed by using Peak Signal-toNoise...
Citations
... Other examples of steganography include combinations with cryptography [47,48], watermarking [27,49] or secret sharing [50][51][52], multi-secret steganography used for concealing more than one message in a single container [53], techniques that do not require a predefined medium but generate the carrier from scratch [54,55], format-specific methods destined for particular files [36,56,57], the creation of subliminal channels in existing schemes to achieve better undetectability [58,59], systems that use biometric authentication for data hiding [60,61], combining various techniques to obtain secure data transmission in telemedicine applications [62,63], and many more. ...
In this paper, several ideas of data hiding in WebP images are presented. WebP is a long-known, but not very poplar file format that provides lossy or lossless compression of data, in the form of a still image or an animation. A great number of WebP features are optional, so the structure of the image offers great opportunities for data hiding. The article describes distinct approaches to steganography divided into two categories: format-based and data-based. Among format-based methods, we name simple injection, multi-secret steganography that uses thumbnails, hiding a message in metadata or in a specific data chunk. Data-based methods achieve secret concealment with the use of a transparent, WebP-specific algorithm that embeds bits by choosing proper prediction modes and alteration of the color indexing transform. The capacity of presented techniques varies. It may be unlimited for injection, up to a few hundred megabytes for other format-based algorithms, or be content-dependent in data-based techniques. These methods fit into the container modification branch of steganography. We also present a container selection technique which benefits from available WebP compression parameters. Images generated with the described methods were tested with three applications, including the Firefox web browser, GNU Image Manipulation Program, and ImageMagick. Some of the presented techniques can be combined in order to conceal more than one message in a single carrier.
... Additional concerns arising from this is what do when an e-mail account or phone has also been stolen or has been changed? It could result that in such cases the account would remain locked forever [6]. ...
In recent years, the number of personal accounts assigned to one business user has been constantly growing. There could be as many as 191 individual login credentials used by an average employee, according to a 2017 study. The most recurrent problems associated with this situation faced by users are the strength of passwords and ability to recall them. Researchers have proven that “users are aware of what constitutes a secure password but may forgo these security measures in terms of more convenient passwords, largely depending on account type”. Reusing the same password across multiple platforms or creating one with dictionary words has also been proved to be a common practice amongst many. In this paper, a novel password-reminder scheme will be presented. The goal was that the user creates a CAPTCHA-like image with a hidden meaning, that only he or she can decode. The image must be in some way related to that individual’s memory or her/his unique knowledge or experience. With this image, being presented each time during logging in, the user is asked to associate a password consisting of two or more words and a number. If the image is selected properly and strong association with a person’s visual memory has been linked to it, the chances of recalling a lengthy password he/she created should not present a problem.
... Designing innovation in fuzzy is not just the main thrust for the advancement of fuzzy arithmetic hypothesis, yet additionally the center of fuzzy math helping the public creation practice. Application of fuzzy is more and more increasing, it includes fuzzy controller [7][8][9], representation of knowledge in fuzzy [10][11][12], Coding and fuzzy information [13][14][15][16][17], fuzzy evaluation, prediction and decision technology [18][19][20] and so on. The researchers gradually attract the topological indices on fuzzy graph. ...
Fuzzy information plays a significant part in everyday life, and information is typically denoted by fuzzy graphs, where structure of graph is utilized to portray the related design of the fuzzy information. Bipolar fuzzy graph (BFG) indices were discussed in this article. Zagreb first and second index, Randic and Harmonic and Estrada index were discussed. Union and intersection for those indices are determined. Lower and Upper bound for first Zagreb and Randic indices for BFG is proved.
... A fuzzy vault development based on iris images. EUREKA: Physics and Engi neering,5,[3][4][5][6][7][8][9][10][11][12] ...
... Any random points are introduced to cover the genuine elements, which do not cheat on the P polynomial. As shown in Fig. 1, such random points are named chaff points [2,11]. ...
Biometric systems gather information from the person's biometric attributes, used extensively to authorize the individuals. Due to the obvious convenience of using specific individual traits such as face, fingerprints, palm veins, and irises, biometric authentication is becoming more common. In particular, Iris systems are in high demand for high-assurance applications, because they contain a broad feature set and remain stable. Authentication methods based on iris biometrics are now commonly used in a variety of fields. This is due to the fact that iris biometric authentication is both safer and more comfortable than conventional passwords. Template Security is a major concern in biometric systems. The template security mechanism ensures reusable, permanent, and un-linkable models. The Fuzzy Vault strategy is one of the most popular security schemes for Template protection.
Fuzzy vault has demonstrated to be an effective protection method but lacks revocability and security attacks. This article introduced an improved fuzzy vault system. The improved fuzzy vault system was introduced, which uses more than one key to protect biometric data. Different keys make the search space more detailed. The additional key was used to encrypt vault data, which stopped the intruder from accessing the information on the person's biometry. The system was tested using CASIA.v1 and IITD.v1 datasets, and findings showed that the system ensures the protection and authentication of the iris templates without compromising performance. The proposed modification gave a 0.0 % False Accepted Rate (FAR) for both the dataset and False Rejected Rate (FRR), 0.14 % for CASIA v1 and 0.12 % for ITTD v1 False Rejected rate
... With the continuous maturity of the mathematical theory and application technology of fuzzy systems, the application of fuzzy mathematics methods in the engineering field has received more and more attention, and the fields of application have become more and more extensive. The main aspects include general fuzzy controller [7][8][9], fuzzy knowledge representation [10][11][12], fuzzy information theory [13,14] and fuzzy information coding [15][16][17], fuzzy prediction technology [18], fuzzy decision and evaluation technology [19,20], fuzzy statistical theory and application [21], fuzzy operational research [including fuzzy optimization [22], fuzzy random service system, fuzzy linear programming [23], fuzzy countermeasures, etc.] and its applications. ...
Fuzzy data plays an important role in daily life, and fuzzy structured data is usually represented by fuzzy graphs, where the graph structure is used to describe the associated structure of the fuzzy data. Based on the definition of Wiener index on bipolar fuzzy incidence graphs, this article continues to study the characteristics of this distance based topological index. The lower and upper bounds for positive and negative Wiener index of fuzzy bipolar incidence graph are determined respectively, and the relationship of Wiener index between original graph and its subgraph is discussed. The Wiener absolute index on bipolar fuzzy incidence graph is introduced accordingly, and several conclusions are determined in terms of geodesics distance analysis. Furthermore, we demonstrate the equality of Wiener index and Wiener absolute index for two isomorphic bipolar fuzzy incidence graphs.
... Toony et al. (Toony et al. 2009) hid a secret image by employing a fuzzy coding/decoding method proposed in (Martino et al. 2008) to enhance the embedding rate and security. Koptyra and Ogiela (Koptyra and Ogiela 2019) proposed a new approach of information coding and hiding using fuzzy vault. ...
This paper proposes an adaptive fuzzy inference approach for color image steganography, taking into account the influence of image complexity such as pixel similarity, pixel brightness and color sensitivity. A fuzzy inference system is designed as a classifier which adopts the features of the cover image as its crisp input values and produces semantic concepts corresponding to the payload of image sub-classes. Furthermore, least significant bit substitution is used to hide the data adaptively according to the output of fuzzy inference system and the human eye sensitivity to the R, G, B color components. A chaotic method and random sequence scrambling are applied to the secret message to generate the random sequence which prevents the secret message from attackers. The proposed method hides a large amount of data with good quality of stego-image from the human visual system and guarantees the confidentiality in the communication. Experimental results show better mean square error, peak signal-to-noise ratio, structural similarity and payload, verifying that the proposed method can yield better performance than some state-of-the-art works. The robustness of the method is tested by RS steganalysis and pixel difference histogram analysis.
... The fact of passing messages between sender and recipient is kept secret by embedding messages in inconspicuous containers. These may be either common files, for example images and videos, or unexpected media, like geospatial data [1], network packets [2] and others [3]. In the digital era nearly any type of file may carry additional hidden data, but images are among most popular because the human visual system is unable to perceive subtle changes introduced by embedding process. ...
... Eigenface-based feature calculation is performed after designation of E [n·m,l] in (5). We have to subtract mean vector M from the face image I i in the same manner, as it was performed in (3). Image I i may be replaced by any face image, also not included in D, however it has to have the same resolution as images in D, namely m × n. ...
In this paper we propose a novel transform domain steganography technique—hiding a message in components of linear combination of high order eigenfaces vectors. By high order we mean eigenvectors responsible for dimensions with low amount of overall image variance, which are usually related to high-frequency parameters of image (details). The study found that when the method was trained on large enough data sets, image quality was nearly unaffected by modification of some linear combination coefficients used as PCA-based features. The proposed method is only limited to facial images, but in the era of overwhelming influence of social media, hundreds of thousands of selfies uploaded every day to social networks do not arouse any suspicion as a potential steganography communication channel. From our best knowledge there is no description of any popular steganography method that utilizes eigenfaces image domain. Due to this fact we have performed extensive evaluation of our method using at least 200 000 facial images for training and robustness evaluation of proposed approach. The obtained results are very promising. What is more, our numerical comparison with other state-of-the-art algorithms proved that eigenfaces-based steganography is among most robust methods against compression attack. The proposed research can be reproduced because we use publicly accessible data set and our implementation can be downloaded.
... Using adaptive techniques, the researchers tried to improve the imperceptibility of the stego-image which ultimately leads to better embedding efficiency and with high embedding capacity if the error rate is minimum at the retrieval time, then the chances of detection of secret data will be least. For this researcher's switched to machine learning algorithms [121] such as Support Vector Machine (SVM) [161], Genetic Algorithm (GA) [98,143], Fuzzy Logic [71,78,142], Neural Networks (NN) [4] etc. The machine learning algorithms has been used in image steganography either for finding the area for embedding or pre-processing of the cover or secret image to enhance the security. ...
Steganography and steganalysis is a relatively new-fangled scientific discipline in security systems and digital forensics, respectively, but one that has matured greatly over the past two decades. In any specialism of human endeavour, it is imperative to periodically pause and review the state of the discipline for what has been achieved till date. This article scrutinizes where the discipline of steganography and steganalysis at this point in time in context to the common user and new researchers in terms of current trends. Also, what has been accomplished in order to critically examine what has been done well and what ought to be done better. The state-of-the-art techniques for steganography and steganalysis (image and video) have been deliberated for the last 5 years literature. Further, the paper also takes stock the dataset and tools available for multimedia steganography and steganalysis with the examples where steganography has been used in real-life. It is a corpus of the author’s opinion and the viewpoints of different other researchers and practitioners, working in this discipline. Additionally, experiments were done using image steganography techniques to analyse the recent trends. This survey is intended to provide a complete guide for common people and new researchers and scholars approaching this field, sight on the existing and the future of steganography and steganalysis.
... Sometimes, the steganography is used solely; in other cases, it is combined with other means of information security [5]. The one example is to disperse the message in the container with steganographic key. ...
This paper shows how to diffuse a message and hide it in multiple PDF files. Presented method uses dereferenced objects and secret splitting or sharing algorithms. It is applicable to various types of PDF files, including text documents, presentations, scanned images etc. Because hiding process is based on structure manipulation, the solution may be easily combined with content-dependent steganographic techniques. The hidden pages are not visible in typical application usage, which was tested with seven different programs.
... The idea of the FVS is to use biometric features to lock a random key encoded as the coefficients of a selected polynomial p by projecting these features onto p and adding chaff points in order to obscure the projected biometric features. The FVS is one of the most accepted and well-studied [17], [18] approaches for binding biometric data with cryptographic keys. However, several studies showed that it is vulnerable to various attacks such as brute-Copyright c 2020 The Institute of Electronics, Information and Communication Engineers force [19], correlation [20], record multiplicity [21], and collusion [22] attacks. ...
Biometric template protection techniques have been proposed to address security and privacy issues inherent to biometric-based authentication systems. However, it has been shown that the robustness of most of such techniques against reversibility and linkability attacks are overestimated. Thus, a thorough security analysis of recently proposed template protection schemes has to be carried out. Negative iris recognition is an interesting iris template protection scheme based on the concept of negative databases. In this paper, we present a comprehensive security analysis of this scheme in order to validate its practical usefulness. Although the authors of negative iris recognition claim that their scheme possesses both irreversibility and unlinkability, we demonstrate that more than 75% of the original iris-code bits can be recovered using a single protected template. Moreover, we show that the negative iris recognition scheme is vulnerable to attacks via record multiplicity where an adversary can combine several transformed templates to recover more proportion of the original iris-code. Finally, we demonstrate that the scheme does not possess unlinkability. The experimental results, on the CASIA-IrisV3 Interval public database, support our theory and confirm that the negative iris recognition scheme is susceptible to reversibility, linkability, and record multiplicity attacks.
