How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
ID-Based Blind Signature and Ring Signature from Pairings
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Practical Techniques for Searches on Encrypted Data
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
Identity-based threshold decryption revisited
ISPEC'07 Proceedings of the 3rd international conference on Information security practice and experience
Conjunctive, subset, and range queries on encrypted data
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Common secure index for conjunctive keyword-based retrieval over encrypted data
SDM'07 Proceedings of the 4th VLDB conference on Secure data management
Efficient conjunctive keyword search on encrypted data storage system
EuroPKI 2006 Proceedings of the Third European conference on Public Key Infrastructure: theory and Practice
Secure index search for groups
TrustBus'05 Proceedings of the Second international conference on Trust, Privacy, and Security in Digital Business
Keyword Field-Free Conjunctive Keyword Searches on Encrypted Data and Extension for Dynamic Groups
CANS '08 Proceedings of the 7th International Conference on Cryptology and Network Security
Information Security Applications
A new approach for private searches on public-key encrypted data
CMS'12 Proceedings of the 13th IFIP TC 6/TC 11 international conference on Communications and Multimedia Security
| Hi-index | 0.00 |
We consider the following problem: users of an organization wish to outsource the storage of sensitive data to a large database server. It is assumed that the server storing the data is untrusted so the data stored have to be encrypted.We further suppose that the manager of the organization has the right to access all data, but a member of the organization can not access any data alone. The member must collaborate with other members to search for the desired data. In this paper, we investigate the notion of threshold privacy preserving keyword search (TPPKS) and define its security requirements. We construct a TPPKS scheme and show the proof of security under the assumptions of intractability of discrete logarithm, decisional Diffie-Hellman and computational Diffie-Hellman problems.