Generating hard instances of lattice problems (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A public-key cryptosystem with worst-case/average-case equivalence
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Identity-Based Encryption from the Weil Pairing
SIAM Journal on Computing
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
An Identity Based Encryption Scheme Based on Quadratic Residues
Proceedings of the 8th IMA International Conference on Cryptography and Coding
Practical Techniques for Searches on Encrypted Data
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
New lattice-based cryptographic constructions
Journal of the ACM (JACM)
On lattices, learning with errors, random linear codes, and cryptography
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Lossy trapdoor functions and their applications
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Trapdoors for hard lattices and new cryptographic constructions
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
A Framework for Efficient and Composable Oblivious Transfer
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Fully homomorphic encryption using ideal lattices
Proceedings of the forty-first annual ACM symposium on Theory of computing
Hidden attribute-based signatures without anonymity revocation
Information Sciences: an International Journal
Multi-bit cryptosystems based on lattice problems
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Conjunctive, subset, and range queries on encrypted data
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Public key encryption that allows PIR queries
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
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
Generic combination of public key encryption with keyword search and public key encryption
CANS'07 Proceedings of the 6th international conference on Cryptology and network security
Decryptable searchable encryption
ProvSec'07 Proceedings of the 1st international conference on Provable security
CCA2 secure IBE: standard model efficiency through authenticated symmetric encryption
CT-RSA'08 Proceedings of the 2008 The Cryptopgraphers' Track at the RSA conference on Topics in cryptology
Fuzzy keyword search over encrypted data in cloud computing
INFOCOM'10 Proceedings of the 29th conference on Information communications
Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Toward basing fully homomorphic encryption on worst-case hardness
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Better security for deterministic public-key encryption: the auxiliary-input setting
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
On the integration of public key data encryption and public key encryption with keyword search
ISC'06 Proceedings of the 9th international conference on Information Security
Lattice mixing and vanishing trapdoors: a framework for fully secure short signatures and more
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
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 lattice (H)IBE in the standard model
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Probabilistic public key encryption with equality test
CT-RSA'10 Proceedings of the 2010 international conference on Topics in Cryptology
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Dual projective hashing and its applications -- lossy trapdoor functions and more
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Lattice signatures without trapdoors
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
| Hi-index | 0.00 |
Searchable encryption, which allows one to search over encrypted data, has recently become an important research direction in cryptography. According to the key generation algorithm, searchable encryption can be divided into two categories, which are referred to as secret-key setting and public-key setting. Among them, searchable public-key encryption is of particular interest since it has found numerous practical applications, such as cloud storage and outsourced computing. In this work, we propose two searchable public-key encryption schemes from lattice. One is probabilistic, while the other is deterministic. Both of them are proven secure in the random oracle model.