{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T17:57:00Z","timestamp":1773511020183,"version":"3.50.1"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2007,7,24]],"date-time":"2007-07-24T00:00:00Z","timestamp":1185235200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2007,10,9]]},"DOI":"10.1007\/s10207-007-0030-1","type":"journal-article","created":{"date-parts":[[2007,7,23]],"date-time":"2007-07-23T06:43:08Z","timestamp":1185172988000},"page":"403-415","source":"Crossref","is-referenced-by-count":47,"title":["Protecting data privacy through hard-to-reverse negative databases"],"prefix":"10.1007","volume":"6","author":[{"given":"Fernando","family":"Esponda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elena S.","family":"Ackley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Helman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haixia","family":"Jia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephanie","family":"Forrest","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,7,24]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Achlioptas, D., Beame, M.: A sharp threshold in proof complexity. In: STOC: ACM Symposium on Theory of Computing (STOC) (2001)","DOI":"10.1145\/380752.380820"},{"key":"30_CR2","unstructured":"Achlioptas, D., Gomes, C., Kautz, H., Selman, B.: Generating satisfiable problem instances. In: Proceedings of AAAI-00 and IAAI-00, pp. 256\u2013261. AAAI Press, Menlo Park (2000)"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Achlioptas, D., Peres, Y.: The threshold for random k-SAT is 2 k log 2\u2013O(k). JAMS: J. Am. Math. Soc. 17 (2004)","DOI":"10.1090\/S0894-0347-04-00464-3"},{"issue":"4","key":"30_CR4","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1145\/76894.76895","volume":"21","author":"N.R. Adam","year":"1989","unstructured":"Adam N.R. and Wortman J.C. (1989). Security-control methods for statistical databases. ACM Comput. Surv. 21(4): 515\u2013556","journal-title":"ACM Comput. Surv."},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"Agrawal, D., Aggarwal, C.C.: On the design and quantification of privacy preserving data mining algorithms. In: Symposium on Principles of Database Systems, pp. 247\u2013255 (2001)","DOI":"10.1145\/375551.375602"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Evfimievski, A., Srikant, R.: Information sharing aoss private databases. In: SIGMODIC: ACM SIGMOD Interantional Conference on Management of Data (2003)","DOI":"10.1145\/872757.872771"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Srikant, R.: Privacy-preserving data mining. In: Proceedings of the ACM SIGMOD Conference on Management of Data, pp. 439\u2013450. ACM Press, New York (2000)","DOI":"10.1145\/342009.335438"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Benaloh, J.C., de Mare, M.: One-way accumulators: a decentralized alternative to digital signatures. In: Advances in cryptology\u2014 EUROYPT \u201993, pp. 274\u2013285 (1994)","DOI":"10.1007\/3-540-48285-7_24"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Blakley, G.R., Meadows, C.: A database enyption scheme which allows the computation of statistics using enypted data. In: Proceedings of the IEEE Symposium on Research in Security and Privacy, pp. 116\u2013122. IEEE CS Press (1985)","DOI":"10.1109\/SP.1985.10024"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Blum, M., Goldwasser, S.: An efficient probabilistic public-key enyption scheme which hides all partial information. In: Blakely, G.R., Chaum, D. (eds.) Advances in cryptology: proceedings of CRYPTO 84, Lecture Notes in Computer Science, vol. 196, pp. 289\u2013302. Springer, Berlin, Germany\/Heidelberg, Germany\/London, UK\/etc. (1985)","DOI":"10.1007\/3-540-39568-7_23"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Lysyanskaya, A.: Dynamic accumulators and application to efficient revocation of anonymous edentials. In: Yung, M. (ed.) Advances in cryptology\u2014CRYPTO\u2019 2002, Lecture Notes in Computer Science, vol. 2442, pp. 61\u201376. International Association for cryptologic Research, Springer, Berlin (2002)","DOI":"10.1007\/3-540-45708-9_5"},{"issue":"3","key":"30_CR12","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1145\/5925.5928","volume":"33","author":"F. Chin","year":"1986","unstructured":"Chin F. (1986). Security problems on inference control for sum, max and min queries. J. ACM 33(3): 451\u2013464","journal-title":"J. ACM"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"Cook, S.A., Mitchell, D.G.: Finding hard instances of the satisfiability problem: a survey. In: Du, D., Gu, J., Pardalos, P.M. (eds.) Satisfiability Problem: Theory and Applications, Dimacs Series in Disete Mathematics and Theoretical Computer Science, vol. 35, pp. 1\u201317. American Mathematical Society (1997)","DOI":"10.1090\/dimacs\/035\/01"},{"key":"30_CR14","volume-title":"Cryptography and Data Security","author":"D. Denning","year":"1982","unstructured":"Denning D. (1982). Cryptography and Data Security. Addison-Wesley, Reading"},{"issue":"7","key":"30_CR15","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1109\/MC.1983.1654444","volume":"16","author":"D. Denning","year":"1983","unstructured":"Denning D. and Schlorer J. (1983). Inference controls for statistical databases. Computer 16(7): 69\u201382","journal-title":"Computer"},{"issue":"1","key":"30_CR16","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1145\/320064.320069","volume":"4","author":"D.E. Denning","year":"1979","unstructured":"Denning D.E., Denning P.J. and Schwartz M.D. (1979). The tracker: a threat to statistical database security. ACM Trans. Database Syst. 4(1): 76\u201396","journal-title":"ACM Trans. Database Syst."},{"issue":"1","key":"30_CR17","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1145\/320128.320138","volume":"5","author":"D.E. Denning","year":"1980","unstructured":"Denning D.E. and Schlorer J. (1980). A fast procedure for finding a tracker in a statistical database. ACM Trans. Database Syst. 5(1): 88\u2013102","journal-title":"ACM Trans. Database Syst."},{"issue":"1","key":"30_CR18","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1145\/320064.320068","volume":"4","author":"D. Dobkin","year":"1979","unstructured":"Dobkin D., Jones A. and Lipton R. (1979). Secure databases: Protection against user influence. ACM Trans. Database Syst. 4(1): 97\u2013106","journal-title":"ACM Trans. Database Syst."},{"key":"30_CR19","unstructured":"Esponda, F.: Negative representations of information. Ph.D. thesis, University of New Mexico (2005)"},{"key":"30_CR20","doi-asserted-by":"crossref","unstructured":"Esponda, F., Ackley, E.S., Forrest, S., Helman, P.: On-line negative databases. In: Proceedings of ICARIS (2004)","DOI":"10.1007\/978-3-540-30220-9_14"},{"issue":"3","key":"30_CR21","first-page":"201","volume":"1","author":"F. Esponda","year":"2005","unstructured":"Esponda F., Ackley E.S., Forrest S. and Helman P. (2005). On-line negative databases (with experimental results). Int. J. Unconv. Comput. 1(3): 201\u2013220","journal-title":"Int. J. Unconv. Comput."},{"key":"30_CR22","doi-asserted-by":"crossref","unstructured":"Esponda, F., Forrest, S., Helman, P.: Enhancing privacy through negative representations of data. University of New Mexico, Technical report (2004)","DOI":"10.21236\/ADA498766"},{"key":"30_CR23","unstructured":"Esponda, F., Forrest, S., Helman, P.: Negative representations of information. Int. J. Inform. Secur. (2004) (Submitted)"},{"key":"30_CR24","doi-asserted-by":"crossref","unstructured":"Even, S., Yacobi, Y.: Cryptography and np-completeness. In: Proceedings 7th Colloq. Automata, Languages, and Programming. Lecture Notes in Computer Science, vol. 85, pp. 195\u2013207. Springer-Verlag (1980)","DOI":"10.1007\/3-540-10003-2_71"},{"key":"30_CR25","unstructured":"Feigenbaum, J., Grosse, E., Reeds, J.A.: Cryptographic protection of membership lists 9(1), 16\u201320 (1992)"},{"key":"30_CR26","doi-asserted-by":"crossref","unstructured":"Feigenbaum, J., Liberman, M.Y., Wright, R.N.: Cryptographic protection of databases and software. In: Distributed Computing and cryptography, pp. 161\u2013172. American Mathematical Society (1991)","DOI":"10.1090\/dimacs\/002\/10"},{"issue":"2","key":"30_CR27","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/S0166-218X(02)00400-6","volume":"130","author":"C. Fiorini","year":"2003","unstructured":"Fiorini C., Martinelli E. and Massacci F. (2003). How to fake an RSA signature by encoding modular root finding as a SAT problem. Disete Appl. Math. 130(2): 101\u2013127","journal-title":"Disete Appl. Math."},{"key":"30_CR28","unstructured":"Gent, I.P., Walsh, T.: The SAT phase transition. In: Proceedings of the Eleventh European Conference on Artificial Intelligence (ECAI\u201994), pp. 105\u2013109 (1994)"},{"key":"30_CR29","volume-title":"Foundations of cryptography: Basic Tools","author":"O. Goldreich","year":"2000","unstructured":"Goldreich O. (2000). Foundations of cryptography: Basic Tools. Cambridge University Press, Cambridge"},{"issue":"2","key":"30_CR30","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser S. and Micali S. (1984). Probabilistic enyption. J. Comput. Syst. Sci. 28(2): 270\u2013299","journal-title":"J. Comput. Syst. Sci."},{"key":"30_CR31","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Levin, L.A., Luby, M.: Pseudo-random generation from one-way functions. In: Proceedings of the twenty-first annual ACM symposium on Theory of computing, pp. 12\u201324. ACM, New York (1989)","DOI":"10.1145\/73007.73009"},{"key":"30_CR32","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Naor, M.: Efficient cryptographic schemes provably as secure as subset sum. In: IEEE (ed.) 30th annual Symposium on Foundations of Computer Science, October 30\u2013November 1, 1989, Research Triangle Park, NC, pp. 236\u2013241. IEEE Computer Society Press, 1109 Spring Street, Suite 300, Silver Spring, MD 20910, USA (1989)","DOI":"10.1109\/SFCS.1989.63484"},{"key":"30_CR33","doi-asserted-by":"crossref","unstructured":"Jia, H., Moore, C., Strain, D.: Generating hard satisfiable formulas by hiding solutions deceptively. In: AAAI (2005)","DOI":"10.1007\/11527695_16"},{"key":"30_CR34","doi-asserted-by":"crossref","unstructured":"Kautz, H.A., Ruan, Y., Achlioptas, D., Gomes, C., Selman, B., Stickel, M.E.: Balance and filtering in structured satisfiable problems. In: IJCAI, pp. 351\u2013358 (2001)","DOI":"10.1016\/S1571-0653(04)00310-5"},{"key":"30_CR35","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/0-387-24006-3_3","volume-title":"Computer Security in the 21st Century.","author":"Y. Li","year":"2005","unstructured":"Li Y., Tygar J. and Hellerstein J. (2005). Private matching. In: Lee, D., Shieh, S., and Tygar, J. (eds) Computer Security in the 21st Century., pp 25\u201350. Springer, Berlin"},{"key":"30_CR36","doi-asserted-by":"crossref","unstructured":"Freedman, M., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: Advances in cryptology\u2014Euroypt \u20192004 Proceedings, LNCS 3027, pp. 1\u201319. Springer (2004)","DOI":"10.1007\/978-3-540-24676-3_1"},{"key":"30_CR37","unstructured":"Matloff, N.S.: Inference control via query restriction vs. data modification: a perspective. In: on Database Security: Status and Prospects, pp. 159\u2013166. North-Holland, Amsterdam (1988)"},{"key":"30_CR38","doi-asserted-by":"crossref","unstructured":"Merkle, R.C., Hellman, M.E.: Hiding information and signatures in trapdoor knapsacks. vol. IT-24, pp. 525\u2013530 (1978)","DOI":"10.1109\/TIT.1978.1055927"},{"key":"30_CR39","doi-asserted-by":"crossref","unstructured":"Micali, S., Rabin, M., Kilian, J.: Zero-knowledge sets. In: Proceedings FOCS 2003, p. 80 (2003)","DOI":"10.1109\/SFCS.2003.1238183"},{"key":"30_CR40","unstructured":"Mitchell, D., Selman, B., Levesque, H.: Problem solving: hardness and easiness\u2014hard and easy distributions of SAT problems. In: Proceeding of (AAAI-92), pp. 459\u2013465. AAAI Press, Menlo Park (1992)"},{"key":"30_CR41","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: Proceedings of the 38th Design Automation Conference (DAC\u201901) (2001)","DOI":"10.1145\/378239.379017"},{"key":"30_CR42","doi-asserted-by":"crossref","unstructured":"Naor, M., Yung, M.: Universal one-way hash functions and their cryptographic applications. In: Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing: Seattle, Washington, May 15\u201317, 1989, pp. 33\u201343. ACM, New York (1989)","DOI":"10.1145\/73007.73011"},{"key":"30_CR43","doi-asserted-by":"crossref","unstructured":"Odlyzko, A.M.: The rise and fall of knapsack cryptosystems. In: Pomerance, C., Goldwasser, S. (eds.) cryptology and Computational Number Theory, Proceedings of symposia in applied mathematics. AMS short course lecture notes, vol. 42, pp. 75\u201388. pub-AMS (1990)","DOI":"10.1090\/psapm\/042\/1095552"},{"key":"30_CR44","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Rackoff, C., Smith, A.: Efficient consistency proofs for generalized queries on a committed database. In: ICALP: Annual International Colloquium on Automata, Languages and Programming, pp. 1041\u20141053 (2004)","DOI":"10.1007\/978-3-540-27836-8_87"},{"key":"30_CR45","unstructured":"Princeton: zChaff. http:\/\/ee.princeton.edu\/\u02dcchaff\/zchaff.php (2004)"},{"key":"30_CR46","unstructured":"Selman, B., Kautz, H.A., Cohen, B.: Local search strategies for satisfiability testing. In: Trick, M., Johnson, D.S. (eds.) Proceedings of the Second DIMACS Challange on Cliques, Coloring, and Satisfiability. Providence (1993)"},{"key":"30_CR47","unstructured":"Shaw, P., Stergiou, K., Walsh, T.: Arc consistency and quasigroup completion. In: Proceedings of ECAI98 Workshop on Non-binary Constraints (1998)"},{"key":"30_CR48","doi-asserted-by":"crossref","unstructured":"Tendick, P., Matloff, N.: A modified random perturbation method for database security. ACM Trans. Database Syst. 19(1), 47\u201363 (1994). DOI http:\/\/doi.acm.org\/10.1145\/174638.174641","DOI":"10.1145\/174638.174641"},{"key":"30_CR49","unstructured":"Wayner, P.: Translucent databases. Flyzone Press (2002)"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-007-0030-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10207-007-0030-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-007-0030-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T14:11:02Z","timestamp":1683987062000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10207-007-0030-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7,24]]},"references-count":49,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2007,10,9]]}},"alternative-id":["30"],"URL":"https:\/\/doi.org\/10.1007\/s10207-007-0030-1","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"value":"1615-5262","type":"print"},{"value":"1615-5270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,7,24]]}}}