scispace - formally typeset
Proceedings ArticleDOI

A secure data transfer mechanism using single-handed re-encryption technique

Reads0
Chats0
TLDR
An improvement is performed in Libert and Vergnaud scheme by improving the security levels of encryption using ASCII values by justifying the strength of this Non-Transitive Unidirectional Proxy Re-Encryption (PRE) schemes with experimental results.
Abstract
To improve the network security by a cryptographic primitive called proxy re-encryption in which a proxy can transform a ciphertext encrypted under one key without seeing the actual plaintext into an encryption of the same plaintext under another key This cryptographic concept has recently drawn renewed interest Some researchers also showed how to properly define chosen-ciphertext security for the primitive This system supports bidirectional as the translation key allows converting ciphertexts in both directions The proposed concept presents the unidirectional proxy re-encryption schemes with chosen-ciphertext security without using the random oracle idealization In 2008, Libert and Vergnaud presented the first construction of unidirectional proxy re-encryption scheme with chosen-ciphertext security in the standard model The limitation of their scheme is the longer length of original ciphertext and re-encrypted ciphertext In this paper, an improvement is performed in Libert and Vergnaud scheme by improving the security levels of encryption using ASCII values The proposed work additionally outlines Non-Transitive Unidirectional Proxy Re-Encryption (PRE) schemes This paper justifies the strength of this PRE with experimental results

read more

Citations
More filters
Proceedings ArticleDOI

A survey on security over data outsourcing

TL;DR: This paper surveyed all the different types of techniques used to enhance the security of outsourced data, like Attribute based encryption (ABE), Key management, Anonymous authentication, User revocation and Access control.
Proceedings ArticleDOI

The Computational Complexity of the Algorithm for Identifying the Source of Data Transmitted by Limited Length Blocks

TL;DR: In this paper, the authors describe the possible way of using Cipher Block Chaining (CBCH) for authentication in automated systems and present a mathematical model for assessing its computational complexity.
Journal ArticleDOI

Enhanced Schmidt-Samoa cryptosystem for data confidentiality in cloud computing

TL;DR: An enhanced Schmidt-Samoa ESS public key cryptosystem is proposed to address the problem of complexity in implementing SSC in the cloud, and proves that the time required to perform the data encryption and decryption in ESS is lower and the time necessary to perform cryptanalysis is higher compared with SSC.
Proceedings ArticleDOI

Formal Analysis of the Signal Protocol Using the Scyther Tool

TL;DR: In this work, the signal protocol is analyzed in three phases: registration phase, sending and receiving message phase, and sending a reply phase and the obtained results are addressed and compared with those from mathematical and other model checking approaches.
Proceedings ArticleDOI

The Model of Parallel Processing of Messages Buffered in the Shared Memory

TL;DR: In this article , the authors proposed to use indirect addressing in order to increase the processing speed of incoming packets and to reduce the amount of internal buffer memory, and the operation of the independent computing modules in a quasi-multitasking mode ensures the processing of messages from 10 remote sources without significant loss in performance of the authentication receiver.
References
More filters
Journal ArticleDOI

Improved proxy re-encryption schemes with applications to secure distributed storage

TL;DR: Performance measurements of the experimental file system demonstrate the usefulness of proxy re-encryption as a method of adding access control to a secure file system and present new re-Encryption schemes that realize a stronger notion of security.
Book ChapterDOI

Divertible protocols and atomic proxy cryptography

TL;DR: A definition of protocol divertibility is given that applies to arbitrary 2-party protocols and is compatible with Okamoto and Ohta's definition in the case of interactive zero-knowledge proofs and generalizes to cover several protocols not normally associated with divertibility.
Proceedings ArticleDOI

Chosen-ciphertext secure proxy re-encryption

TL;DR: Ateniese et al. as discussed by the authors proposed a security against chosen ciphertext attacks for proxy re-encryption (PRE) schemes based on the Decisional Bilinear Diffie-Hellman assumption.
Posted Content

Chosen-Ciphertext Secure Proxy Re-Encryption.

TL;DR: Ateniese et al. as mentioned in this paper proposed a denition of security against chosen ciphertext attacks for proxy re-encryption (PRE) schemes, and presented a scheme that satises the denition.
Journal ArticleDOI

Unidirectional Chosen-Ciphertext Secure Proxy Re-Encryption

TL;DR: This paper presents the first unidirectional proxy re-encryption schemes with chosen-ciphertext security in the standard model (i.e., without the random oracle idealization) and considers a more realistic adversarial model where attackers may choose dishonest users' keys on their own.
Related Papers (5)