A public key cryptosystem and a signature scheme based on discrete logarithms
Proceedings of CRYPTO 84 on Advances in cryptology
The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Anonymizing Censorship Resistant Systems
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
The pynchon gate: a secure method of pseudonymous mail retrieval
Proceedings of the 2005 ACM workshop on Privacy in the electronic society
New Constructions and Practical Applications for Private Stream Searching (Extended Abstract)
SP '06 Proceedings of the 2006 IEEE Symposium on Security and Privacy
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Private searching on streaming data
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Improving secure long-term archival of digitally signed documents
Proceedings of the 4th ACM international workshop on Storage security and survivability
PrETP: privacy-preserving electronic toll pricing
USENIX Security'10 Proceedings of the 19th USENIX conference on Security
Information-flow types for homomorphic encryptions
Proceedings of the 18th ACM conference on Computer and communications security
Cooperative private searching in clouds
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
Private keyword search is a technique that allows for searching and retrieving documents matching certain keywords without revealing the search criteria. We improve the space efficiency of the Ostrovsky et al. Private Search [9] scheme, by describing methods that require considerably shorter buffers for returning the results of the search. Our basic decoding scheme recursive extraction, requires buffers of length less than twice the number of returned results and is still simple and highly efficient. Our extended decoding schemes rely on solving systems of simultaneous equations, and in special cases can uncover documents in buffers that are close to 95% full. Finally we note the similarity between our decoding techniques and the ones used to decode rateless codes, and show how such codes can be extracted from encrypted documents.