Efficient request-based comparable encryption scheme based on sliding window method

2015 ◽  
Vol 20 (11) ◽  
pp. 4589-4596 ◽  
Author(s):  
Peng Chen ◽  
Jun Ye ◽  
Xiaofeng Chen
2017 ◽  
Vol 2017 ◽  
pp. 1-11
Author(s):  
Qian Meng ◽  
Jianfeng Ma ◽  
Kefei Chen ◽  
Yinbin Miao ◽  
Tengfei Yang

User authentication has been widely deployed to prevent unauthorized access in the new era of Internet of Everything (IOE). When user passes the legal authentication, he/she can do series of operations in database. We mainly concern issues of data security and comparable queries over ciphertexts in IOE. In traditional database, a Short Comparable Encryption (SCE) scheme has been widely used by authorized users to conduct comparable queries over ciphertexts, but existing SCE schemes still incur high storage and computational overhead as well as economic burden. In this paper, we first propose a basic Short Comparable Encryption scheme based on sliding window method (SCESW), which can significantly reduce computational and storage burden as well as enhance work efficiency. Unfortunately, as the cloud service provider is a semitrusted third party, public auditing mechanism needs to be furnished to protect data integrity. To further protect data integrity and reduce management overhead, we present an enhanced SCESW scheme based on position-aware Merkle tree, namely, PT-SCESW. Security analysis proves that PT-SCESW and SCESW schemes can guarantee completeness and weak indistinguishability in standard model. Performance evaluation indicates that PT-SCESW scheme is efficient and feasible in practical applications, especially for smarter and smaller computing devices in IOE.


Author(s):  
Jyoti Malik ◽  
G. Sainarayanan ◽  
Ratna Dahiya

Authentication time is the main and important part of the authentication system. Normally the response time should be fast but as the number of persons in the database increases, there is probability of more response time taken for authentication. The need of fast authentication system arises so that authentication time (matching time) is very less. This paper proposes a sliding window approach to make fast authentication system. The highlight of sliding window method is constant matching time, fast and can match translated images also. Several palmprint matching methods like match by correlation etc. are dependent upon the number of corners detected and so is the matching time. In sliding window method, matching time is constant as the numbers of matching operations are limited and the matching time is independent of the number of corners detected. The palmprint corner features extracted using two approaches Phase Congruency Corner Detector and Harris Corner Detector are binarized so that only useful information (features) is matched. The two approaches of Phase Congruency Corner Detector and Harris Corner Detector, when matched with hamming distance using sliding window can achieve recognition rate of 97.7% and 97.5% respectively.


2017 ◽  
Vol 4 (1) ◽  
pp. 1304499 ◽  
Author(s):  
Adamu Muhammad Noma ◽  
Abdullah Muhammed ◽  
Zuriati Ahmad Zukarnain ◽  
Muhammad Afendee Mohamed ◽  
Duc Pham

Sign in / Sign up

Export Citation Format

Share Document