2011 First International Conference on Instrumentation, Measurement, Computer, Communication and Control 2011
DOI: 10.1109/imccc.2011.228
|View full text |Cite
|
Sign up to set email alerts
|

A SCF-PEKS Scheme without Random Oracle under Simple Assumption

Abstract: The model of public key encryption with keyword search (PEKS) proposed by Boneh et al. enables one to search encrypted keywords without revealing any information on the data. Baek et al. proposed an enhanced model called secure channel-free PEKS (SCF-PEKS) to removes the costly secure channel. However, most of the presented SCF-PEKS schemes were proved secure in the random oracle model. In 2009, Fang et al. presented a SCF-PEKS scheme without random oracles.But the scheme requires a strong and complicated assu… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
5
0
1

Year Published

2012
2012
2021
2021

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(6 citation statements)
references
References 8 publications
0
5
0
1
Order By: Relevance
“…[ 11 ] as well as the SCF‐PEKS construction without random oracle under simple assumption of Yang et al . [ 13 ] . However, only in the random oracle model, Boneh et al .‘s PEKS and Baek et al .‘s SCF‐PEKS constructions are provably secure.…”
Section: Discussionmentioning
confidence: 99%
See 3 more Smart Citations
“…[ 11 ] as well as the SCF‐PEKS construction without random oracle under simple assumption of Yang et al . [ 13 ] . However, only in the random oracle model, Boneh et al .‘s PEKS and Baek et al .‘s SCF‐PEKS constructions are provably secure.…”
Section: Discussionmentioning
confidence: 99%
“…In this section, some comparisons are made in Table 1 between our proposed SCF-PEKS construction and several representative results in the conventional PEKS construction of Boneh et al [1] the SCF-PEKS construction of Baek et al [7] , the SCF-PEKS construction without random oracle of Fang et al [11] as well as the SCF-PEKS construction without random oracle under simple assumption of Yang et al [13] . However, only in the random oracle model, Boneh et al's PEKS and Baek et al's SCF-PEKS constructions are provably secure.…”
Section: Discussionmentioning
confidence: 99%
See 2 more Smart Citations
“…But there are some issues in the PEKS scheme, a large number of studies are based on the PEKS, such as Public-Key Encryption with Registered Keyword Search [9] , A SCF-PEKS Scheme without Random Oracle under Simple Assumption [10] , A New Public Key Encryption With Temporary Keyword Search [11] , and so on. One of the important issues is that the PEKS scheme assumes a secure channel between the data consumer and the third party.…”
Section: Related Workmentioning
confidence: 99%