Abstract
In this paper we present a method for hiding a list of data by mixing it with a large amount of superfluous items. The technique uses a device known as a negative database which stores the complement of a set rather that the set itself to include an arbitrary number of garbage entries efficiently. The resulting structure effectively hides the data, without encrypting it, and obfuscates the number of data items hidden; it prevents arbitrary data lookups, while supporting simple membership queries; and can be manipulated to reflect relational algebra operations on the original data.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agarwal, R., Srikant, R.: Privacy-preserving data minig. In: Proc. of the ACM SIGMOD Conference on Management of Data, pp. 439–450. ACM Press, New York (2000)
Bender, W., Gruhl, D., Morimoto, N., Lu, A.: Techniques for data hiding. IBM Systems Journal (September-December 1996)
Bloom, B.H.: Space/time trade-offs in hash coding with allowable errors. Communications of the ACM 13(7), 422–426 (1970)
Brinkman, R., Maubach, S., Jonker, W.: A lucky dip as a secure data store. In: Proceedings of Workshop on Information and System Security (2006)
Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers C-35, 677–691 (1986)
Danezis, G., Diaz, G., Faust, S., Käsper, E., Troncoso, C., Preneel, B.: Efficient negative databases from cryptographic hash functions. In: Garay, J.A., Lenstra, A.K., Mambo, M., Peralta, R. (eds.) ISC 2007. LNCS, vol. 4779, pp. 423–436. Springer, Heidelberg (2007)
de Mare, M., Wright Secure, R.: Set membership using 3sat. In: Ning, P., Qing, S., Li, N. (eds.) ICICS 2006. LNCS, vol. 4307. Springer, Heidelberg (2006)
Esponda, F.: Negative Representations of Information. PhD thesis, University of New Mexico (2005)
Esponda, F., Ackley, E.S., Forrest, S., Helman, P.: On-line negative databases. In: Nicosia, G., Cutello, V., Bentley, P.J., Timmis, J. (eds.) ICARIS 2004. LNCS, vol. 3239, pp. 175–188. Springer, Heidelberg (2004)
Esponda, F., Forrest, S., Helman, P.: Protecting data privacy through hard-to-reverse negative databases. International Journal of Information Security 6(6), 403–415 (2007)
Esponda, F., Forrest, S., Helman, P.: Enhancing privacy through negative representations of data. Technical report, University of New Mexico (2004)
Esponda, F., Trias, E., Ackley, E.S., Forrest, S.: A relational algebra for negative databases. Technical Report TR-CS-2007-18, University of New Mexico (2007)
Hofmeyr, S., Forrest, S.: Architecture for an artificial immune system. Evolutionary Computation Journal 8(4), 443–473 (2000)
Katzenbeisser, S., Petitcolas, F.A.P. (eds.): Information hiding techniques for steganography and digital watermarking. Artech House computer security series. Artech House Inc., Norwood (2000)
McHugh, J.: Chaffing at the bit: Thoughts on a note by ronald rivest. In: Pfitzmann, A. (ed.) IH 1999. LNCS, vol. 1768, pp. 395–404. Springer, Heidelberg (2000)
Micali, S., Rabin, M., Kilian, J.: Zero-knowledge sets. In: Proc. FOCS 2003, p. 80 (2003)
Narayanan, A., Shmatikov, V.: Obfuscated databases and group privacy. In: CCS 2005: Proceedings of the 12th ACM conference on Computer and communications security, pp. 102–111. ACM, New York (2005)
Petitcolas, F.A.P., Anderson, R.J., Kuhn, M.G.: Information hiding-a survey. Proceedings of the IEEE special issue on protection of multimedia content 87(7), 1062–1078 (1999)
Princeton. zChaff (2004), http://ee.princeton.edu/~chaff/zchaff.php
Rivest, R.L.: Chaffing and winnowing: Confidentiality without encryption. MIT Lab for Computer Science (March 1998), http://theory.lcs.mit.edu/~rivest/chaffing.txt
Rivest, R.L.: The md5 message-digest algorithm (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Esponda, F. (2008). Hiding a Needle in a Haystack Using Negative Databases. In: Solanki, K., Sullivan, K., Madhow, U. (eds) Information Hiding. IH 2008. Lecture Notes in Computer Science, vol 5284. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88961-8_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-88961-8_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88960-1
Online ISBN: 978-3-540-88961-8
eBook Packages: Computer ScienceComputer Science (R0)