Identity-based cryptosystems and signature schemes
Proceedings of CRYPTO 84 on Advances in cryptology
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
A course in computational algebraic number theory
A course in computational algebraic number theory
The mobile people architecture
ACM SIGMOBILE Mobile Computing and Communications Review - Special issue dedicated to Mark Weiser
Identity-Based Encryption from the Weil Pairing
SIAM Journal on Computing
Public key encryption with conjunctive field keyword search
WISA'04 Proceedings of the 5th international conference on Information Security Applications
Searchable encryption revisited: consistency properties, relation to anonymous IBE, and extensions
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Anonymous hierarchical identity-based encryption (without random oracles)
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Information Security Applications
Universally Anonymous IBE Based on the Quadratic Residuosity Assumption
CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
Proxy re-encryption with keyword search
Information Sciences: an International Journal
An efficient public key encryption with conjunctive-subset keywords search
Journal of Network and Computer Applications
Public-key encryption with registered keyword search
EuroPKI'09 Proceedings of the 6th European conference on Public key infrastructures, services and applications
Lightweight delegated subset test with privacy protection
ISPEC'11 Proceedings of the 7th international conference on Information security practice and experience
Bonsai trees, or how to delegate a lattice basis
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Efficient keyword search over encrypted data with fine-grained access control in hybrid cloud
NSS'12 Proceedings of the 6th international conference on Network and System Security
Stronger security model for public-key encryption with equality test
Pairing'12 Proceedings of the 5th international conference on Pairing-Based Cryptography
Expressive search on encrypted data
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
Boolean symmetric searchable encryption
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
Efficient identity-based encryption without pairings and key escrow for mobile devices
WASA'13 Proceedings of the 8th international conference on Wireless Algorithms, Systems, and Applications
Privacy-preserving data utilization in hybrid clouds
Future Generation Computer Systems
Public-key searchable encryption from lattices
International Journal of High Performance Systems Architecture
| Hi-index | 0.00 |
Public-key encryption schemes with searchable keywords are useful to delegate searching capabilities on encrypted data to a third party, who does not hold the entire secret key, but only an appropriate token which allows searching operations but preserves data privacy. Such notion was previously proved to imply identity-based public-key encryption [5] and to be equivalent to anonymous (or key-private) identity-based encryption which are useful for fully-private communication. So far all presented public-key encryption with keyword search (PEKS) schemes were based on bilinear forms and finding a PEKS that is not based on bilinear forms has been an open problem since the notion of PEKS was first introduced in [5]. We construct a public-key encryption scheme with keyword search based on a variant of the quadratic residuosity problem. We obtain our scheme using a non-trivial transformation of Cocks' identity-based encryption scheme [9]. Thus we show that the primitive of PEKS can be based on additional intractability assumptions which is a conventional desiderata about all cryptographic primitives.