Private information storage (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Protecting data privacy in private information retrieval schemes
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Approximate nearest neighbors: towards removing the curse of dimensionality
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Efficient search for approximate nearest neighbor in high dimensional spaces
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
High Confidence Visual Recognition of Persons by a Test of Statistical Independence
IEEE Transactions on Pattern Analysis and Machine Intelligence
Practical Techniques for Searches on Encrypted Data
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
Communications of the ACM - 50th anniversary issue: 1958 - 2008
Proceedings of the 12th Australasian conference on Information security and privacy
ACISP'07 Proceedings of the 12th Australasian conference on Information security and privacy
Proceedings of the 12th Australasian conference on Information security and privacy
ACISP'07 Proceedings of the 12th Australasian conference on Information security and privacy
An application of the Goldwasser-Micali cryptosystem to biometric authentication
ACISP'07 Proceedings of the 12th Australasian conference on Information security and privacy
Efficient chosen-ciphertext secure identity-based encryption with wildcards
ACISP'07 Proceedings of the 12th Australasian conference on Information security and privacy
Public key encryption that allows PIR queries
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Extended private information retrieval and its application in biometrics authentications
CANS'07 Proceedings of the 6th international conference on Cryptology and network security
Single-database private information retrieval with constant communication rate
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Searchable encryption revisited: consistency properties, relation to anonymous IBE, and extensions
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
An oblivious transfer protocol with log-squared communication
ISC'05 Proceedings of the 8th international conference on Information Security
Public key encryption with keyword search based on k-resilient IBE
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Efficient binary conversion for paillier encrypted values
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
A Fast Search Algorithm for a Large Fuzzy Database
IEEE Transactions on Information Forensics and Security
Generalized key delegation for hierarchical identity-based encryption
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
Biometric Identification over Encrypted Data Made Feasible
ICISS '09 Proceedings of the 5th International Conference on Information Systems Security
Privacy-preserving noisy keyword search in cloud computing
ICICS'12 Proceedings of the 14th international conference on Information and Communications Security
Expressive search on encrypted data
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
Fuzzy keyword search over encrypted data in the public key setting
WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management
| Hi-index | 0.00 |
In this paper, we describe a new primitive for Error-Tolerant Searchable Encryption and a security model for it. This generic scheme permits to make searches on encrypted data with only an approximation of some keyword. It enables to efficiently query secure databases in order to get the exact data with a close estimation of it. An application to biometric identification arises from this construction. This is the first construction both for Error-Tolerant Searchable Encryption and for a biometric identification protocol over encrypted personal data.