608 research outputs found

    A New Image Encryption Algorithm Based Slicing and Displacement Followed By Symmetric and Asymmetric Cryptography Technique

    Get PDF
    This paper titled “A New Algorithm for Image Encryption Based on Slicing, Displacement Followed by Symmetric Encryption” is proposed for image encryption by studding the principle of the image encryption algorithm. In this, a new hybrid image encryption algorithm is proposed by analyzing the principle of the encryption algorithm based on the combination of symmetric and asymmetric encryption. The experimental results based on combination of symmetric and asymmetric encryption will approve the effectiveness of the proposed concept, and the combination of symmetric and asymmetric encryption will show large variation in key space and provide high-level security. Proposed algorithm will support to integrity, authorization, accuracy of images which is transmitting in public network. As we know that, an image-based data requires more effort during encryption and decryption. This research introduces a block-based algorithm which is the combination of “Slicing and Displacement of RGB value of a Pixel” and “Block Cipher” base image encryption algorithm. The original image was divided into four equal parts, where each part of image will rearranged into displacement of RGB value of a pixel and then resultant image will divided into pixel blocks. Read binary value of pixel blocks. This binary value will be process by encryption process through binary value of selected key. Now finally encrypted image will be produced. This process will repeat on each parts of image. After that each part will be combining and produce final cipher image. Encryption key will also encrypted by asymmetric key concept so key exchanging problem will not occur in this system. The Proposed Architecture for encryption and decryption of an image using suitable user-defined key is developed. The cipher image generated by this method can be very in size as the original image due to image scaling to make 128 bits block at a time and is suitable for practical use in the secure transmission of confidential information over the Internet. DOI: 10.17762/ijritcc2321-8169.15053

    Relating two standard notions of secrecy

    Get PDF
    Two styles of definitions are usually considered to express that a security protocol preserves the confidentiality of a data s. Reachability-based secrecy means that s should never be disclosed while equivalence-based secrecy states that two executions of a protocol with distinct instances for s should be indistinguishable to an attacker. Although the second formulation ensures a higher level of security and is closer to cryptographic notions of secrecy, decidability results and automatic tools have mainly focused on the first definition so far. This paper initiates a systematic investigation of the situations where syntactic secrecy entails strong secrecy. We show that in the passive case, reachability-based secrecy actually implies equivalence-based secrecy for digital signatures, symmetric and asymmetric encryption provided that the primitives are probabilistic. For active adversaries, we provide sufficient (and rather tight) conditions on the protocol for this implication to hold.Comment: 29 pages, published in LMC

    Evolution of Format Preserving Encryption on IoT Devices: FF1+

    Get PDF
    The Internet of Things (IoT) is a network of interconnected low-power sensing devices designed to interact and communicate with each other. To avoid compromising user privacy, it is necessary to encrypt these channels. We introduce Format Preserving Encryption (FPE), a modern cryptosystem that allows full customization of the ciphertext, while offering comparable security to AES. To gauge the performance of FPE, we compare the NIST-approved FF1 algorithm against several symmetric and asymmetric encryption schemes on a Raspberry Pi 3. While suitable for small plaintexts, FF1 breaks down for longer character strings. We propose a modified algorithm, FF1+, that implements dynamic round selection and key scheduling. Significant performance improvements are observed in our results, thus demonstrating FF1+ as a viable cryptosystem for IoT devices

    Lengths May Break Privacy – Or How to Check for Equivalences with Length

    Get PDF
    Security protocols have been successfully analyzed using symbolic models, where messages are represented by terms and protocols by processes. Privacy properties like anonymity or untraceability are typically expressed as equivalence between processes. While some decision procedures have been proposed for automatically deciding process equivalence, all existing approaches abstract away the information an attacker may get when observing the length of messages. In this paper, we study process equivalence with length tests. We first show that, in the static case, almost all existing decidability results (for static equivalence) can be extended to cope with length tests. In the active case, we prove decidability of trace equivalence with length tests, for a bounded number of sessions and for standard primitives. Our result relies on a previous decidability result from Cheval et al (without length tests). Our procedure has been implemented and we have discovered a new flaw against privacy in the biometric passport protocol

    Relating two standard notions of secrecy

    Get PDF
    Two styles of definitions are usually considered to express that a security protocol preserves the confidentiality of a data { t s}. Reach-ability-based secrecy means that { t s} should never be disclosed while equi-valence-based secrecy states that two executions of a protocol with distinct instances for { t s} should be indistinguishable to an attacker. Although the second formulation ensures a higher level of security and is closer to cryptographic notions of secrecy, decidability results and automatic tools have mainly focused on the first definition so far. This paper initiates a systematic investigation of situations where syntactic secrecy entails strong secrecy. We show that in the passive case, reachability-based secrecy actually implies equivalence-based secrecy for signatures, symmetric and asymmetric encryption provided that the primitives are probabilistic. For active adversaries in the case of symmetric encryption, we provide sufficient (and rather tight) conditions on the protocol for this implication to hold

    A Novel Secure Patient Data Transmission through Wireless Body Area Network: Health Tele-Monitoring

    Get PDF
    The security of sensitive data obtained from a patient has not been implemented properly because of energy issues of sensor nodes in Wireless Body Area Network (WBAN) and constrained resources such as computational power and low battery life. The main of this paper is to enhance the security level of data transmission between patient and health service provider by considering the availability of energy at sensor nodes. The proposed system consists of a hybrid Advanced Encryption Standard (AES) and Elliptic Curve Cryptography (ECC), which provides simple, fast and high cryptographic strength of data security. ECC is used for securing AES encryption keys, and AES algorithm is used for encrypting/decrypting text. A scenario where sensor nodes are continuously supplied energy from solar power is considered and based upon the energy availability; respective encryption technique is implemented. The result shows that the proposed EEHEE algorithm increases the encryption of the data file by more than 19% compared to the State of Art's solution. The proposed EEHEE system is 11% faster in encrypting data file and reduces the energy consumption by 34 % compared to the current best solution.  The proposed system concentrates on reducing the energy consumption in WBAN and increasing cryptographic strength to the system by using the hybrid symmetric and asymmetric algorithm. Thus, this study provides an efficient scheme to enhance security for real-time data transmission in telemedicine
    • 

    corecore