Private searching on streaming data based on keyword frequency

IEEE Transactions on Dependable and Secure Computing

Volumn 11, Issue 2, 2014, Pages 155-167

  Yi, Xun ^a   Bertino, Elisa ^b   Vaidya, Jaideep ^c   Xing, Chaoping ^d  

^a VICTORIA UNIVERSITY   (Australia)

^b Purdue University   (United States)

^c RUTGERS UNIVERSITY   (United States)

^d NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

binary linear code; fully homomorphic encryption; Private searching on streaming data

Indexed keywords

GROUP THEORY; QUERY PROCESSING;

BINARY LINEAR CODES; FULLY HOMOMORPHIC ENCRYPTION; FULLY HOMOMORPHIC ENCRYPTION SCHEMES; GENERIC CONSTRUCTION; HO-MOMORPHIC ENCRYPTIONS; RELEVANT DOCUMENTS; STREAMING DATA; THRESHOLD QUERIES;

CRYPTOGRAPHY;

EID: 84898688007     PISSN: 15455971     EISSN: None     Source Type: Journal    
DOI: 10.1109/TDSC.2013.36     Document Type: Article

References (25)

1. J. Bethencourt, D. Song, and B. Water, "New Construction andPractical Applications for Private Streaming Searching," Proc.IEEE Symp. Security and Privacy, 2006.
2. J. Bethencourt, D. Song, and B. Water, "New Techniques forPrivate Stream Searching," ACM Trans. Information and SystemSecurity, vol. 12, no. 3, pp. 1-32, 2009.
3. D. Boneh, E. Goh, and K. Nissim, "Evaluating 2-DNF Formulas onCiphertext," Proc. Second Int'l Conf. Theory of Cryptography, pp. 325-341, 2005.
4. Z. Brakerski, C. Gentry, and V. Vaikuntanathan, "Fully HomomorphicEncryption without Bootstrapping," http://eprint.iacr.org/2011/ 277, 2011.
5. Z. Brakerski and V. Vaikuntanathan, "Efficient Fully HomomorphicEncryption from (Standard) LWE," http://eprint.iacr.org/2011/ 344, 2011.
6. I. Damgard and M. Jurik, "A Generalisation, a Simplification andSome Applications of Paillier's Probabilistic Public-Key System,"Proc. Fourth Int'l Workshop Practice and Theory in Public KeyCryptography (PKC '01), pp. 119-136, 2001. (Pubitemid 33232937)
7. M. Dijk, C. Gentry, S. Halevi, and V. Vaikuntanathan, "FullyHomomorphic Encryption over the Integers," Proc. Advances inCryptology (EUROCRYPT '10), pp. 24-43, 2010.
8. T. ElGamal, "A Public-Key Cryptosystem and a Signature SchemeBased on Discrete Logarithms," IEEE Trans. Information Theory,vol. 31, no. 4, pp. 469-472, July 1985.
9. C. Gentry, "Fully Homomorphic Encryption Scheme," PhD thesis,Stanford Univ., http://crypto.stanford.edu/craig, 2009.
10. C. Gentry, "Fully Homomorphic Encryption Using Ideal Lattices,"Proc. 41st Ann. ACM Symp. Theory of Computing (STOC '09),pp. 169-178, 2009.
11. C. Gentry, "Computing Arbitrary Functions of Encrypted Data,"Comm. ACM, vol. 53, no. 3, pp. 97-105, 2010.
12. C. Gentry, "Toward Basing Fully Homomorphic Encryption onWorst-Case Hardness," Proc. Advances in Cryptology (CRYPTO '10),pp. 116-137, 2010.
13. C. Gentry and S. Halevi, "Implementing Gentry's Fully-Homomorphic Encryption Scheme," Proc. 30th Ann. Int'lConf. Theory and Applications of Cryptographic Techniques(EUROCRYPT '11), pp. 129-148, 2011.
14. D. Harris, D.M. Harris, and S.L. Harris, Digital Design andComputer Architecture. Morgan Kaufmann, 2007.
15. D.J. Lilja and S.S. Sapatnekar, Designing Digital Computer Systemswith Verilog. Cambridge Univ. Press, 2005.
16. S. Ling and C.P. Xing, Coding Theory: A First Course. CambridgePress, 2004.
17. R. Ostrovsky and W. Skeith, "Private Searching on StreamingData," Proc. Advances in Cryptology (CRYPTO '05), pp. 223-240,2005. (Pubitemid 43902116)
18. R. Ostrovsky and W. Skeith, "Private Searching on StreamingData," J. Cryptology, vol. 20, no. 4, pp. 397-430, 2007.
19. R. Ostrovsky and W. Skeith, "Algebraic Lower Bounds forComputing on Encrypted Data," Proc. Electronic Colloquium onComputational Complexity (ECCC '07), 2007.
20. P. Paillier, "Public Key Cryptosystems Based on CompositeDegree Residue Classes," Proc. 17th Int'l Conf. Theory andApplication of Cryptographic Techniques (EUROCRYPT '99),pp. 223-238, 1999.
21. B. Parhami, Computer Arithmetic: Algorithms and Hardware Designs,second ed. Oxford Univ. Press, 2010.
22. N. Smart and F. Vercauteren, "Fully Homomorphic Encryptionwith Relatively Small Key and Ciphertext Sizes," Proc. 13th Int'lConf. Practice and Theory in Public Key Cryptography (PKC '10),pp. 420-443, 2010.
23. D. Stehle and R. Steinfeld, "Faster Fully Homomorphic Encryption,"Proc. Advances in Cryptology (ASIACRYPT '10), pp. 377-394,2010.
24. J.F. Wakerly, Digital Design Principles and Practices, third ed.Prentice Hall, 2000.
25. X. Yi and C.P. Xing, "Private (t, n) Threshold Searching onStreaming Data," Proc. Int'l Conf. Social Computing Privacy,Security, Risk and Trust (PASSAT '12), pp. 676-683, 2012.