In　order　to　solve　the　problem　that　the　existing　semantically　searchable　encryption　schemes　could　not　realize　ranking　verification,　a　novel　method　was　proposed　in　this　paper　which　could　not　only　support　the　semantic　search,　but　also　verify　the　ranking　of　the　search　results.　Firstly,　the　relevant　score　and　the　weighted　zone　score　were　introduced　to　construct　a　more　accurate　inverted　index　structure.　Using　the　non-linear　order　preserving　encryption　mechanism,　the　search　results　were　sorted　efficiently　by　the　cloud　server,　which　reduced　the　computation　and　communication　overheads.　Then,　the　query　keywords　were　semantically　extended　based　on　the　WordNet.　Based　on　the　semantically　extended　tree,　the　most　relevant　semantically　extended　words　were　selected.　Combining　the　semantic　similarity　and　relevance　score,　a　two-factor　ranking　algorithm　was　designed　to　accurately　sort　the　search　results.　Moreover,　a　set　of　keywords　were　inserted　to　the　bloom　filter.　The　message　authentication　codes　of　the　bloom　filter,　security　index　and　encrypted　files　were　calculated　to　build　the　verifiable　information.　In　the　search　phase,　the　bloom　filter　was　used　to　verify　the　existence　of　the　query　keywords　in　the　index.　And　the　integrity　and　correctness　of　the　index　and　files　could　be　verified　by　the　message　authentication　codes.　The　index　tree　was　constructed　to　improve　the　search　efficiency.　Finally,　the　proposed　scheme　was　compared　with　the　related　schemes　in　terms　of　functions,　storage　overheads　and　search　overheads.　And　simulation　experiments　were　carried　out　on　the　cost　of　building　index　and　verifiable　information,　semantic　extensions,　encrypting　queries,　querying　and　verifying.　The　comparative　analysis　showed　that　the　advantage　of　the　proposed　scheme　in　terms　of　semantic　search,　ranking　and　verifying.　The　experimental　results　demonstrated　that　the　proposed　scheme　not　only　realizes　the　semantic　search　and　the　search　results　ranking,　but　also　supports　the　ranking　result　verification.　©　2017,　Editorial　Department　of　Advanced　Engineering　Sciences.　All　right　reserved.