Cryptographic implementation of a tree hierarchy for access control
Information Processing Letters
Matrix computations (3rd ed.)
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Executing SQL over encrypted data in the database-service-provider model
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Using Aspects to Design a Secure System
ICECCS '02 Proceedings of the Eighth International Conference on Engineering of Complex Computer Systems
Practical Techniques for Searches on Encrypted Data
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
Key management for multi-user encrypted databases
Proceedings of the 2005 ACM workshop on Storage security and survivability
Over-encryption: management of access control evolution on outsourced data
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Efficient key management for cryptographically enforced access control
Computer Standards & Interfaces
Distributed Key Management in Dynamic Outsourced Databases: A Trie-Based Approach
DBKDA '09 Proceedings of the 2009 First International Conference on Advances in Databases, Knowledge, and Data Applications
Hi-index | 0.00 |
Database outsourcing is becoming popular in which the data owners ship their data to external service provider. Such a model provides organizations advantages such as cost savings and service benefits. However, the delegation of database management to service provider, which is not fully trusted, introduces many significant security and privacy issues. They can be referred to as authentication, data confidentiality and integrity, data privacy, secure auditing. Among them, authentication takes an important role and is the first defence to prevent an unauthorized user from accessing to the outsourced data. In this paper, we first propose a novel public key encryption scheme with keyword search based on pseudo inverse matrix, named PEKS-PM. We prove that PEKS-PM is secure and more efficient than the public key encryption scheme with keyword search based on the Decisional Diffie-Hellman (DDH) which is the best searchable encryption scheme known to date. Based on PEKSPM, we propose a mutual authentication mechanism which can be used to authenticate the user and the server mutually to establish an intended connection but the server learns nothing about the user's login information. Our proposed authentication mechanism can prevent man-in-the-middle, session high-jacking and replay attacks.