CCA Proxy Re-Encryption without Bilinear Maps in the Standard Model

Matsuda, Toshihide; Nishimaki, Ryo; Tanaka, Keisuke

doi:10.1007/978-3-642-13013-7_16

Cited by 37 publications

(43 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The authors constructed 10 games, Game-0 to Game-10, to prove the CCA security of the PRE scheme developed in [12] , where Game 0 is just the CCA definitional game of PRE (recalled in Section 3). Our above concrete attack shows that the CCA security proof in [12] must be flawed.…”

Section: Discussionmentioning

confidence: 99%

“…Thus in this section, we shall review the definitions of these two primitives (for more details, the reader is referred to [12] and [13]). We shall also review the definition and security notion for bidirectional multi-hop PRE.…”

Section: Preliminariesmentioning

confidence: 99%

“…Based on Peikert and Waters' LTDFs [13], Matsuda, Nishimaki and Tanaka [12] gave a realization of re-applicable LTDFs, which is specified as below (for more details, the reader is referred to [12]):…”

Section: Realization Of Re-applicable Ltdfsmentioning

confidence: 99%

“…Next, we review the definition of chosen-ciphertext security for bidirectional multi-hop PRE scheme as defined in [6,12]. Let λ be the security parameter, A be an oracle TM, representing the adversary, and Γ U and Γ C be two lists which are initially empty.…”

Section: Bidirectional Multi-hop Prementioning

confidence: 99%

“…The message space of the system is {0, 1} k ′′ . The Matsuda-Nishimaki-Tanaka PRE scheme [12] is specified by the following algorithms: Setup(1 λ ): This algrithm first generates an index of all-but-one trapdoor functions with lossy branch 0 v : (s abo , td abo ) ← G abo (1 λ , 0 v ). Then, it generates a public parameter of re-applicable LTDFs: par ← ParGen(1 λ ).…”

Section: Review Of Matsuda-nishimaki-tanaka Pre Schemementioning

confidence: 99%

See 4 more Smart Citations

On the Security of a Bidirectional Proxy Re-encryption Scheme from PKC 2010

Weng

Zhao

Hanaoka

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

In PKC 2010, Matsuda, Nishimaki and Tanaka proposed a bidirectional proxy reencryption (PRE) scheme without bilinear maps, and claimed that their scheme is chosenciphertext secure in the standard model. However, by giving a concrete attack, in this paper we indicate that their PRE scheme fails to achieve the chosen-ciphertext security. The purpose of this paper is to clarify the fact that, it is still an open problem to come up with a chosen-ciphertext secure PRE scheme without bilinear maps in the standard model.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Preliminariesmentioning

confidence: 99%

Section: Realization Of Re-applicable Ltdfsmentioning

confidence: 99%

Section: Bidirectional Multi-hop Prementioning

confidence: 99%

Section: Review Of Matsuda-nishimaki-tanaka Pre Schemementioning

confidence: 99%

See 3 more Smart Citations

On the Security of a Bidirectional Proxy Re-encryption Scheme from PKC 2010

Weng

Zhao

Hanaoka

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

Semantic keyword searchable proxy re‐encryption for postquantum secure cloud storage

Yang

Zheng

Chang

et al. 2017

Concurrency and Computation

View full text Add to dashboard Cite

Summary With the advent of cloud computing, more and more consumers prefer to use the cloud services with the pay‐as‐you‐consume mode. The cloud storage brings about great convenience to users, who store data in cloud and access to it using the smart devices anytime and anywhere. Consumers' information should be encrypted to guarantee the data privacy. Flexible searching on ciphertext is a critical challenge to be solved for effective data utilization. In this paper, we propose a novel semantic keyword searchable proxy re‐encryption scheme for secure cloud storage. A highlight of this work is that the scheme is quantum attack resistant, while most of the available searchable encryption schemes are not. It supports not only exact keyword search but also synonym keyword search. Moreover, the data owner is capable to delegate his search right to another user using the proxy re‐encryption mechanism. In the generation process of re‐encryption key, the delegator and delegatee do not need to be interactive with each other. The scheme is also collusion resistant. Under the learning with errors hardness problem, this scheme is proved secure in standard model.

show abstract

Lattice‐based multi‐use unidirectional proxy re‐encryption

Jiang

Wang

et al. 2015

Security Comm Networks

View full text Add to dashboard Cite

Proxy re-encryption (PRE) is a cryptographic primitive that allows a proxy to turn an Alice's ciphertext into a Bob's ciphertext on the same plaintext. At present, there are many different PRE schemes that have been proposed with different properties. However, all of them are based on the logarithm assumption and the large integer factorization assumption except for a bidirectional PRE scheme over lattices. In this paper, we construct the first multi-use unidirectional PRE scheme based on lattices. In addition, the generation of the PRE key does not interact with two users, and the scheme can resist collusion attacks. Moreover, it is proved chosen plaintext attack secure in the standard model based on the Learning With Errors assumption. Finally, an identity-based PRE is obtained from the basic construction.

show abstract

CCA Proxy Re-Encryption without Bilinear Maps in the Standard Model

Cited by 37 publications

References 21 publications

On the Security of a Bidirectional Proxy Re-encryption Scheme from PKC 2010

On the Security of a Bidirectional Proxy Re-encryption Scheme from PKC 2010

Semantic keyword searchable proxy re‐encryption for postquantum secure cloud storage

Lattice‐based multi‐use unidirectional proxy re‐encryption

Contact Info

Product

Resources

About