Identity-Based Encryption from the Weil Pairing
SIAM Journal on Computing
Proxy re-signatures: new definitions, algorithms, and applications
Proceedings of the 12th ACM conference on Computer and communications security
Improved proxy re-encryption schemes with applications to secure distributed storage
ACM Transactions on Information and System Security (TISSEC)
Chosen-ciphertext secure proxy re-encryption
Proceedings of the 14th ACM conference on Computer and communications security
Conjunctive, subset, and range queries on encrypted data
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Deterministic and efficiently searchable encryption
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Public key encryption with searchable keywords based on Jacobi symbols
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
Predicate encryption supporting disjunctions, polynomial equations, and inner products
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Unidirectional chosen-ciphertext secure proxy re-encryption
PKC'08 Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography
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
Multi-use and unidirectional identity-based proxy re-encryption schemes
Information Sciences: an International Journal
Chosen-ciphertext secure bidirectional proxy re-encryption schemes without pairings
Information Sciences: an International Journal
Semantic relevance ranking for XML keyword search
Information Sciences: an International Journal
Generic construction of designated tester public-key encryption with keyword search
Information Sciences: an International Journal
Information Sciences: an International Journal
Chosen-ciphertext secure anonymous conditional proxy re-encryption with keyword search
Theoretical Computer Science
Efficient encryption with keyword search in mobile networks
Security and Communication Networks
Information Sciences: an International Journal
Certificate-based proxy decryption systems with revocability in the standard model
Information Sciences: an International Journal
Supporting complex queries and access policies for multi-user encrypted databases
Proceedings of the 2013 ACM workshop on Cloud computing security workshop
| Hi-index | 0.07 |
We introduce a new cryptographic primitive, called proxy re-encryption with keyword search, which is motivated by the following scenario in email systems: Charlie sends an encrypted email, which contains some keywords, such as ''urgent'', to Alice under Alice's public key, and Alice delegates her decryption rights to Bob via her mail server. The desired situations are: (1) Bob can decrypt mails delegated from Alice by using only his private key, (2) Bob's mail gateway, with a trapdoor from Bob, can test whether the email delegated from Alice contains some keywords, such as ''urgent'', (3) Alice and Bob do not wish to give the mail server or mail gateway the access to the content of emails. The function of proxy re-encryption with keyword search (PRES) is the combination of proxy re-encryption (PRE) and public key encryption with keyword search (PEKS). However, a PRES scheme cannot be obtained by directly combining those two schemes, since the resulting scheme is no longer proven secure in our security model. In this paper, a concrete construction is proposed, which is proven secure in the random oracle model, based on the modified Decisional Bilinear Diffie-Hellman assumption.