MapReduce: simplified data processing on large clusters
OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
Private Searching on Streaming Data
Journal of Cryptology
MapReduce: simplified data processing on large clusters
Communications of the ACM - 50th anniversary issue: 1958 - 2008
Compute and storage clouds using wide area high performance networks
Future Generation Computer Systems
IT Professional
MapReduce: a flexible data processing tool
Communications of the ACM - Amir Pnueli: Ahead of His Time
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Public key encryption that allows PIR queries
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Private searching on streaming data
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Optimal trust mining and computing on keyed mapreduce
ESSoS'12 Proceedings of the 4th international conference on Engineering Secure Software and Systems
Cooperative private searching in clouds
Journal of Parallel and Distributed Computing
Multimedia Applications and Security in MapReduce: Opportunities and Challenges
Concurrency and Computation: Practice & Experience
Hi-index | 0.00 |
In this paper, a private searching protocol on MapReduce is introduced and formalized within the Mapping-Filtering-Reducing framework. The idea behind of our construction is that a map function Map is activated to generate (key, value) pairs; an intermedial filtering protocol is invoked to filter (key, value) pairs according to a query criteria; a reduce function Reduce is then applied to aggregate the resulting (key, value) pairs generated by the filter. The map function Map and the reduce function Reduction are inherently derived from the MapReduce program while the intermedial filtering algorithm is constructed from the state-of-the-art filtering protocol which in turn can be constructed from a Bloom-Filter with Storage and an additively homomorphic public-key encryption scheme. We show that if the underlying additively homomorphic public-key encryption is semantically secure, then the proposed private searching protocol on MapReduce is semantically secure.