A Novel Approach for Improving Privacy of Data Using Dynamic Key Generation

In today?s computer world security, integrity, confidentiality of the organization?s data is the most important issue. This approach deals with the security of the data that organization manages and works with. It proposes a technique based on generating multiple numbers of keys to secure data u sing Data encryption standard (DES) and RSA algorithm. DES algorithm is used for encryption and decryption. RSA algorithm is used for key generation. The feature of such an approach includes high data security and high feasibility for practical implementation. This proposed methodology is helpful for hiding data in the applications like Online Transaction, Stock Maintenance, Payroll etc

A novel steganography approach for audio files

We present a novel robust and secure steganography technique to hide images into audio files aiming at increasing the carrier medium capacity. The audio files are in the standard WAV format, which is based on the LSB algorithm while images are compressed by the GMPR technique which is based on the Discrete Cosine Transform (DCT) and high frequency minimization encoding algorithm. The method involves compression-encryption of an image file by the GMPR technique followed by hiding it into audio data by appropriate bit substitution. The maximum number of bits without significant effect on audio signal for LSB audio steganography is 6 LSBs. The encrypted image bits are hidden into variable and multiple LSB layers in the proposed method. Experimental results from observed listening tests show that there is no significant difference between the stego audio reconstructed from the novel technique and the original signal. A performance evaluation has been carried out according to quality measurement criteria of Signal-to-Noise Ratio (SNR) and Peak Signal-to-Noise Ratio (PSNR)

On the efficiency of revocation in RSA-based anonymous systems

© 2016 IEEEThe problem of revocation in anonymous authentication systems is subtle and has motivated a lot of work. One of the preferable solutions consists in maintaining either a whitelist L-W of non-revoked users or a blacklist L-B of revoked users, and then requiring users to additionally prove, when authenticating themselves, that they are in L-W (membership proof) or that they are not in L-B (non-membership proof). Of course, these additional proofs must not break the anonymity properties of the system, so they must be zero-knowledge proofs, revealing nothing about the identity of the users. In this paper, we focus on the RSA-based setting, and we consider the case of non-membership proofs to blacklists L = L-B. The existing solutions for this setting rely on the use of universal dynamic accumulators; the underlying zero-knowledge proofs are bit complicated, and thus their efficiency; although being independent from the size of the blacklist L, seems to be improvable. Peng and Bao already tried to propose simpler and more efficient zero-knowledge proofs for this setting, but we prove in this paper that their protocol is not secure. We fix the problem by designing a new protocol, and formally proving its security properties. We then compare the efficiency of the new zero-knowledge non-membership protocol with that of the protocol, when they are integrated with anonymous authentication systems based on RSA (notably, the IBM product Idemix for anonymous credentials). We discuss for which values of the size k of the blacklist L, one protocol is preferable to the other one, and we propose different ways to combine and implement the two protocols.Postprint (author's final draft

Decrypting SSL/TLS traffic for hidden threats detection

The paper presents an analysis of the main mechanisms of decryption of SSL/TLS traffic. Methods and technologies for detecting malicious activity in encrypted traffic that are used by leading companies are also considered. Also, the approach for intercepting and decrypting traffic transmitted over SSL/TLS is developed, tested and proposed. The developed approach has been automated and can be used for remote listening of the network, which will allow to decrypt transmitted data in a mode close to real time.Comment: 4 pages, 1 table, 1 figur

Survey and Idea of Enhancement over Various RSA based Cryptographic Techniques

Internet and its applications are growing very fast, since the need to secure these applications are very fast. For secure transmission of data over network, encryption is very important methodology. This cause a major concern for privacy and security etc. cryptography is a standard way to secure the data over the medium. In a distributed network, when information has to be send over network, cryptography become important part of secure communication. Cryptography has been developed from the Greek word krypto and graphin which means is hiding information from unauthorized person. In recent years various encryption decryption methods have been proposed and used to protect confidential information. In this survey paper various RSA based techniques are studied and described. This paper includes the survey of the work done by various researchers in the field of cryptography and idea about modified approach