Results 1  10
of
3,125
CCASecure Proxy Reencryption without Pairings
 of Lecture Notes in Computer Science
, 2009
"... In a proxy reencryption scheme, a semitrusted proxy can transform a ciphertext under Alice’s public key into another ciphertext that Bob can decrypt. However, the proxy cannot access the plaintext. Due to its transformation property, proxy reencryption can be used in many applications, such as en ..."
Abstract

Cited by 26 (1 self)
 Add to MetaCart
, such as encrypted email forwarding. In this paper, by using signature of knowledge and FijisakiOkamoto conversion, we propose a proxy reencryption scheme without pairings, in which the proxy can only transform the ciphertext in one direction. The proposal is secure against chosen ciphertext attack (CCA
Unidirectional ChosenCiphertext Secure Proxy ReEncryption
 In PKC’08, LNCS
"... Abstract. In 1998, Blaze, Bleumer and Strauss introduced a cryptographic primitive called proxy reencryption (PRE) in which a proxy can transform – without seeing the plaintext – a ciphertext encrypted under one key into an encryption of the same plaintext under another key. The concept has recentl ..."
Abstract

Cited by 38 (1 self)
 Add to MetaCart
proxy reencryption schemes with chosenciphertext security in the standard model (i.e. without the random oracle idealization). The first system provably fits a unidirectional extension of the CanettiHohenberger security model. As a second contribution, the paper considers a more realistic adversarial
Efficient Unidirectional Proxy ReEncryption
"... Abstract. Proxy reencryption (PRE) allows a semitrusted proxy to convert a ciphertext originally intended for Alice into one encrypting the same message for Bob. The proxy only needs a reencryption key given by Alice, and cannot learn anything about the message encrypted. This adds flexibility in ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
in various data security applications, such as confidential email, digital right management and distributed storage. In this paper, we study unidirectional PRE, where the reencryption key only enables delegation in one direction but not the opposite. In PKC 2009, Shao and Cao [23] proposed a unidirectional
Securely Obfuscating Reencryption
 Theory of Cryptography Conference TCC
, 2007
"... We present a positive obfuscation result for a traditional cryptographic functionality. This positive result stands in contrast to wellknown impossibility results [3] for general obfuscation and recent impossibility and improbability [13] results for obfuscation of many cryptographic functionalitie ..."
Abstract

Cited by 20 (0 self)
 Add to MetaCart
functionalities. Whereas other positive obfuscation results in the standard model apply to very simple point functions, our obfuscation result applies to the significantly more complex and widelyused reencryption functionality. This functionality takes a ciphertext for message m encrypted under Alice’s public
PRE +: Dual of Proxy Reencryption and Its Application
"... Abstract. In Eurocrypt’98, Blaze et al. introduced the concept of proxy reencryption (PRE). It allows a semitrusted proxy to convert a ciphertext originally intended for Alice into one which can be decrypted by Bob, without the proxy knowing the corresponding plaintext. PRE has found many applicat ..."
Abstract
 Add to MetaCart
Abstract. In Eurocrypt’98, Blaze et al. introduced the concept of proxy reencryption (PRE). It allows a semitrusted proxy to convert a ciphertext originally intended for Alice into one which can be decrypted by Bob, without the proxy knowing the corresponding plaintext. PRE has found many
Direct Constructions of Bidirectional Proxy ReEncryption with Alleviated Trust in Proxy
"... In this work, we study (the direct constructions of) bidirectional proxy reencryption (PRE) with alleviated trust in the proxy, specifically the master secret security (MSS) and the nontransitivity (NT) security, in the standard model, and achieve the following: • A multihop MSSsecure bidirection ..."
Abstract
 Add to MetaCart
bidirectional PRE scheme with security against chosen plaintext attacks (CPA) in the standard model, where the ciphertext remains constant size regardless how many times it has been reencrypted. To the best of our knowledge, there exists previously no MSSsecure multihop bidirectional PRE scheme with constant
Certificateless Proxy ReEncryption Without Pairing: Revisited
, 2015
"... Proxy ReEncryption was introduced by Blaze, Bleumer and Strauss to efficiently solve the problem of delegation of decryption rights. In proxy reencryption, a semihonest proxy transforms a ciphertext intended for Alice to a ciphertext of the same message for Bob without learning anything about the ..."
Abstract
 Add to MetaCart
suffer from the key escrow problem. Certificateless Proxy Reencryption schemes enjoy the advantages provided by IDbased constructions without suffering from the key escrow problem. In this work, we construct the first unidirectional, singlehop CCAsecure certificateless proxy reencryption scheme
ChosenCiphertext Secure Proxy ReEncryption
 In Proc. of ACMCCS’007
, 2007
"... In a proxy reencryption (PRE) scheme, a proxy is given special information that allows it to translate a ciphertext under one key into a ciphertext of the same message under a different key. The proxy cannot, however, learn anything about the messages encrypted under either key. PRE schemes have ma ..."
Abstract

Cited by 63 (1 self)
 Add to MetaCart
In a proxy reencryption (PRE) scheme, a proxy is given special information that allows it to translate a ciphertext under one key into a ciphertext of the same message under a different key. The proxy cannot, however, learn anything about the messages encrypted under either key. PRE schemes have
Keyprivate proxy reencryption
 In CTRSA ’09: Proceedings of the The Cryptographers’ Track at the RSA Conference 2009 on Topics in Cryptology
, 2009
"... Proxy reencryption (PRE) allows a proxy to convert a ciphertext encrypted under one key into an encryption of the same message under another key. The main idea is to place as little trust and reveal as little information to the proxy as necessary to allow it to perform its translations. At the very ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
in practice. For example, in a secure distributed file system, content owners may want to use the proxy to help reencrypt sensitive information without revealing to the proxy the identity of the recipients. In this work, we propose keyprivate (or anonymous) reencryption keys as an additional useful
Signcryption with Proxy Reencryption
"... Con dentiality and authenticity are two of the most fundamental problems in cryptography. Many applications require both condentiality and authenticity, and hence an e cient way to get both together was very desirable. In 1997, Zheng proposed the notion of signcryption, a single primitive which prov ..."
Abstract
 Add to MetaCart
, by using some special information given by the delegator, called the rekey. In this work, we propose the notion of signcryption with proxy reencryption (SCPRE), and motivate the same. We de ne security models for SCPRE, and also propose a concrete unidirectional, noninteractive identitybased SCPRE
Results 1  10
of
3,125