Private (t,n) Threshold Searching on Streaming Data
Authors:
- Xun YiXYXun Yi
- Chaoping XingCXChaoping Xing
- 1 September 2012
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 676-683
Abstract
Private searching on streaming data is a process to dispatch to a public server a program, which searches streaming sources of data without revealing searching criteria and then sends back a buffer containing the findings. From an Abelian group homomorphic encryption, the searching criteria can be constructed by only simple combinations of keywords, e.g., disjunction of keywords. The recent breakthrough in fully homomorphic encryption has allowed us to construct arbitrary searching criteria theoretically. In this paper, we consider a (t, n) threshold query, which searches for documents containing more than t out of n keywords. This form of query can help us find more relevant documents. We present a construction of the searching criteria for private threshold searching on streaming data on the basis of the state-of-the-art fully homomorphic encryption techniques. Our protocol is semantically secure as long as the underlying fully homomorphic encryption scheme is semantically secure.Keywords
This publication has 8 references indexed in Scilit:
- Efficient Fully Homomorphic Encryption from (Standard) LWE2011
- Computing arbitrary functions of encrypted dataCommunications of the ACM, 2010
- Fully homomorphic encryption using ideal lattices2009
- New Techniques for Private Stream SearchingACM Transactions on Information and System Security, 2009
- Private Searching on Streaming DataJournal of Cryptology, 2007
- Coding Theory2004
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes1999
- A public key cryptosystem and a signature scheme based on discrete logarithmsIEEE Transactions on Information Theory, 1985