{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T12:37:56Z","timestamp":1791290276935,"version":"4.3.0"},"publisher-location":"Berlin, Heidelberg","reference-count":71,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540262237","type":"print"},{"value":"9783540315421","type":"electronic"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11496137_15","type":"book-chapter","created":{"date-parts":[[2010,9,25]],"date-time":"2010-09-25T19:14:24Z","timestamp":1285442064000},"page":"206-221","source":"Crossref","is-referenced-by-count":54,"title":["Indexing Information for Data Forensics"],"prefix":"10.1007","author":[{"given":"Michael T.","family":"Goodrich","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mikhail J.","family":"Atallah","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Roberto","family":"Tamassia","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"15_CR1","first-page":"155","volume-title":"Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data","author":"R. Agrawal","year":"2002","unstructured":"Agrawal, R., Kiernan, J.: Watermarking relational databases. In: Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, Hong Kong, pp. 155\u2013166. ACM Press, New York (2002)"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1002\/rsa.3240030308","volume":"3","author":"N. Alon","year":"1992","unstructured":"Alon, N., Goldreich, O., H\u00b0astad, J., Peralta, R.: Simple construction of almost k-wise independent random variables. Random Structures and Algorithms\u00a03, 289\u2013304 (1992)","journal-title":"Random Structures and Algorithms"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/3-540-45439-X_26","volume-title":"Information Security","author":"A. Anagnostopoulos","year":"2001","unstructured":"Anagnostopoulos, A., Goodrich, M.T., Tamassia, R.: Persistent authenticated dictionaries and their applications. In: Davida, G.I., Frankel, Y. (eds.) ISC 2001. LNCS, vol.\u00a02200, pp. 379\u2013393. Springer, Heidelberg (2001)"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Ar, S., Blum, M., Codenotti, B., Gemmell, P.: Checking approximate computations over the reals. In: Proc. ACM Symp. on the Theory of Computing, pp. 786\u2013795 (1993)","DOI":"10.1145\/167088.167288"},{"key":"15_CR5","unstructured":"Arbaugh, W., Farber, D., Smith, J.: A secure and reliable bootstrap architecture (1997)"},{"issue":"2","key":"15_CR6","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/PL00009813","volume":"18","author":"Y. Azar","year":"1998","unstructured":"Azar, Y., Motwani, R., Naor, J.: Approximating probability distributions using small sample spaces. Combinatorica\u00a018(2), 151\u2013171 (1998)","journal-title":"Combinatorica"},{"issue":"1","key":"15_CR7","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1145\/200836.200880","volume":"42","author":"M. Blum","year":"1995","unstructured":"Blum, M., Kannan, S.: Designing programs that check their work. J. ACM\u00a042(1), 269\u2013291 (1995)","journal-title":"J. ACM"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1109\/FTCS.1994.315646","volume-title":"Digest of the 24th Symposium on Fault-Tolerant Computing","author":"J.D. Bright","year":"1994","unstructured":"Bright, J.D., Sullivan, G.: Checking mergeable priority queues. In: Digest of the 24th Symposium on Fault-Tolerant Computing, pp. 144\u2013153. IEEE Computer Society Press, Los Alamitos (1994)"},{"key":"15_CR9","first-page":"392","volume-title":"Digest of the 25th Symposium on Fault-Tolerant Computing","author":"J.D. Bright","year":"1995","unstructured":"Bright, J.D., Sullivan, G.: On-line error monitoring for several data structures. In: Digest of the 25th Symposium on Fault-Tolerant Computing, pp. 392\u2013401. IEEE Computer Society Press, Los Alamitos (1995)"},{"key":"15_CR10","first-page":"402","volume-title":"Digest of the 25th Symposium on Fault-Tolerant Computing","author":"J.D. Bright","year":"1995","unstructured":"Bright, J.D., Sullivan, G., Masson, G.M.: Checking the integrity of trees. In: Digest of the 25th Symposium on Fault-Tolerant Computing, pp. 402\u2013411. IEEE Computer Society Press, Los Alamitos (1995)"},{"issue":"3","key":"15_CR11","doi-asserted-by":"crossref","first-page":"273","DOI":"10.3233\/JCS-2002-10304","volume":"10","author":"A. Buldas","year":"2002","unstructured":"Buldas, A., Laud, P., Lipmaa, H.: Eliminating counterevidence with applications to accountable certificate management. Journal of Computer Security\u00a010(3), 273\u2013296 (2002)","journal-title":"Journal of Computer Security"},{"key":"15_CR12","unstructured":"Busschbach, P.: Constructive methods to solve the problems of: s-sujectivity conflict resoltuion, coding in defective memories. In: [26] (1984) (unpublished manuscript)"},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/3-540-45708-9_5","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"J. Camenisch","year":"2002","unstructured":"Camenisch, J., Lysyanskaya, A.: Dynamic accumulators and application to efficient revocation of anonymous credentials. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 61\u201376. Springer, Heidelberg (2002)"},{"key":"15_CR14","unstructured":"Cannella, S., Shin, M., Straub, C., Tamassia, R., Polivy, D.J.: Secure visualization of authentication information: A case study. In: Proc. IEEE Symp. on Visual Languages and Human-Centric Computing (2004)"},{"key":"15_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/3-540-47870-1_10","volume-title":"Security and Privacy in Digital Rights Management","author":"H. Chang","year":"2002","unstructured":"Chang, H., Atallah, M.: Protecting software code by guards. In: Sander, T. (ed.) DRM 2001. LNCS, vol.\u00a02320, pp. 160\u2013175. Springer, Heidelberg (2002)"},{"key":"15_CR16","series-title":"London Mathematical Society Lecture Note Series","first-page":"37","volume-title":"Surveys in Combinatorics","author":"C.J. Colbourn","year":"1993","unstructured":"Colbourn, C.J., Dinitz, J.H., Stinson, D.R.: Applications of combinatorial designs to communications, cryptography, and networking. In: Walker (ed.) Surveys in Combinatorics. London Mathematical Society Lecture Note Series, vol.\u00a0187, pp. 37\u2013100. Cambridge University Press, Cambridge (1993)"},{"key":"15_CR17","unstructured":"Collberg, C., Thomborson, C.: On the limits of software watermarking. Technical Report 164, Department of Computer Science, The University of Auckland, Private Bag 92019, Auckland, New Zealand (August 1998)"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Collberg, C., Thomborson, C.: Software watermarking: Models and dynamic embeddings. In: ACM Symp. on Principles of Programming Languages (POPL), pp. 311\u2013324 (1999)","DOI":"10.1145\/292540.292569"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Collberg, C., Thomborson, C.: Software watermarking: models and dynamic embeddings. In: ACM SIGPLAN\u2013SIGACT POPL 1999, San Antonio, Texas, USA (January 1999)","DOI":"10.1145\/292540.292569"},{"issue":"4","key":"15_CR20","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1145\/604264.604272","volume":"30","author":"O. Vel de","year":"2001","unstructured":"de Vel, O., Anderson, A., Corney, M., Mohay, G.: Mining e-mail content for author identification forensics. SIGMOD Record\u00a030(4), 55\u201364 (2001)","journal-title":"SIGMOD Record"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Devanbu, P., Gertz, M., Kwong, A., Martel, C., Nuckolls, G., Stubblebine, S.G.: Flexible authentication of XML documents. In: Proc. ACM Conf. on Computer and Communications Security, pp. 136\u2013145 (2001)","DOI":"10.1145\/501983.502003"},{"issue":"3","key":"15_CR22","doi-asserted-by":"crossref","first-page":"291","DOI":"10.3233\/JCS-2003-11302","volume":"11","author":"P. Devanbu","year":"2003","unstructured":"Devanbu, P., Gertz, M., Martel, C., Stubblebine, S.G.: Authentic data publication over the internet. Journal of Computer Security\u00a011(3), 291\u2013314 (2003)","journal-title":"Journal of Computer Security"},{"key":"15_CR23","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/S0925-7721(98)00039-X","volume":"11","author":"O. Devillers","year":"1998","unstructured":"Devillers, O., Liotta, G., Preparata, F.P., Tamassia, R.: Checking the convexity of polytopes and the planarity of subdivisions. Comput. Geom. Theory Appl.\u00a011, 187\u2013208 (1998)","journal-title":"Comput. Geom. Theory Appl."},{"key":"15_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/3-540-37623-2_6","volume-title":"Graph Drawing","author":"G. Battista Di","year":"1999","unstructured":"Di Battista, G., Liotta, G.: Upward planarity checking: \u201cFaces are more than polygons\u201d. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol.\u00a01547, pp. 72\u201386. Springer, Heidelberg (1999)"},{"key":"15_CR25","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1214\/aoms\/1177731363","volume":"14","author":"R. Dorfman","year":"1943","unstructured":"Dorfman, R.: The detection of defective members of large populations. Ann. Math. Statist.\u00a014, 436\u2013440 (1943)","journal-title":"Ann. Math. Statist."},{"key":"15_CR26","volume-title":"Combinatorial Group Testing and Its Applications","author":"D.-Z. Du","year":"2000","unstructured":"Du, D.-Z., Hwang, F.K.: Combinatorial Group Testing and Its Applications, 2nd edn. World Scientific, Singapore (2000)","edition":"2"},{"key":"15_CR27","unstructured":"Finkler, U., Mehlhorn, K.: Checking priority queues. In: Proc. 10th ACM-SIAM Symp. on Discrete Algorithms, pp. S901\u2013S902 (1999)"},{"key":"15_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-540-46588-1_23","volume-title":"Public Key Cryptography","author":"I. Gassko","year":"2000","unstructured":"Gassko, I., Gemmell, P.S., MacKenzie, P.D.: Efficient and fresh certification. In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol.\u00a01751, pp. 342\u2013353. Springer, Heidelberg (2000)"},{"key":"15_CR29","doi-asserted-by":"crossref","unstructured":"Goodrich, M.T.: Efficient packet marking for large-scale IP traceback. In: 9th ACM Conf. on Computer and Communications Security (CCS), pp. 117\u2013126 (2002)","DOI":"10.1145\/586110.586128"},{"key":"15_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/3-540-44875-6_24","volume-title":"Trust Management","author":"M.T. Goodrich","year":"2003","unstructured":"Goodrich, M.T., Shin, M., Tamassia, R., Winsborough, W.H.: Authenticated dictionaries for fresh attribute credentials. In: Nixon, P., Terzis, S. (eds.) iTrust 2003. LNCS, vol.\u00a02692, pp. 332\u2013347. Springer, Heidelberg (2003)"},{"key":"15_CR31","unstructured":"Goodrich, M.T., Tamassia, R.: Efficient authenticated dictionaries with skip lists and commutative hashing. Technical report, Johns Hopkins Information Security Institute (2000), Available from http:\/\/www.cs.brown.edu\/cgc\/stms\/papers\/hashskip.pdf"},{"key":"15_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/3-540-45811-5_29","volume-title":"Information Security","author":"M.T. Goodrich","year":"2002","unstructured":"Goodrich, M.T., Tamassia, R., Hasic, J.: An efficient dynamic and distributed cryptographic accumulator. In: Chan, A.H., Gligor, V.D. (eds.) ISC 2002. LNCS, vol.\u00a02433, pp. 372\u2013388. Springer, Heidelberg (2002)"},{"key":"15_CR33","doi-asserted-by":"crossref","unstructured":"Goodrich, M.T., Tamassia, R., Schwerin, A.: Implementation of an authenticated dictionary with skip lists and commutative hashing. In: Proc. 2001 DARPA Information Survivability Conference and Exposition, vol.\u00a02, pp. 68\u201382 (2001)","DOI":"10.1109\/DISCEX.2001.932160"},{"key":"15_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/3-540-36563-X_20","volume-title":"Topics in Cryptology - CT-RSA 2003","author":"M.T. Goodrich","year":"2003","unstructured":"Goodrich, M.T., Tamassia, R., Triandopoulos, N., Cohen, R.: Authenticated data structures for graph and geometric searching. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol.\u00a02612, pp. 295\u2013313. Springer, Heidelberg (2003)"},{"key":"15_CR35","doi-asserted-by":"crossref","unstructured":"Gross-Amblard, D.: Query-preserving watermarking of relational databases and XML documents. In: ACM Symp. on Principles of Database Systems (PODS), pp. 191\u2013201 (2003)","DOI":"10.1145\/773153.773172"},{"key":"15_CR36","unstructured":"Guruswami, V.: ListDecoding of Error-correcting Codes. PhD thesis,Massachusetts Institute of Technology, Boston, MA (2001)"},{"key":"15_CR37","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1109\/18.782097","volume":"45","author":"V. Guruswami","year":"1999","unstructured":"Guruswami, V., Sudan, M.: Improved decoding of Reed-Solomon and algebraic-geometric codes. IEEE Transactions on Information Theory\u00a045, 1757\u20131767 (1999)","journal-title":"IEEE Transactions on Information Theory"},{"key":"15_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/3-540-47870-1_9","volume-title":"Security and Privacy in Digital Rights Management","author":"B. Horne","year":"2002","unstructured":"Horne, B., Matheson, L., Sheehan, C., Tarjan, R.: Dynamic self-checking techniques for improved tamper resistance. In: Sander, T. (ed.) DRM 2001. LNCS, vol.\u00a02320, pp. 141\u2013159. Springer, Heidelberg (2002)"},{"key":"15_CR39","unstructured":"Khanna, S., Zane, F.: Watermarking maps: Hiding information in structured data. In: ACM\/SIAM Symp. on Discrete Algorithms, pp. 596\u2013605 (2000)"},{"key":"15_CR40","doi-asserted-by":"crossref","unstructured":"King, V.: A simpler minimum spanning tree verification algorithm. In: Workshop on Algorithms and Data Structures, pp. 440\u2013448 (1995)","DOI":"10.1007\/3-540-60220-8_83"},{"key":"15_CR41","unstructured":"Kocher, P.: A quick introduction to certificate revocation trees, CRTs (1998), http:\/\/www.valicert.com\/resources\/whitepaper\/bodyIntroRevocation.html"},{"key":"15_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/BFb0055481","volume-title":"Financial Cryptography","author":"P.C. Kocher","year":"1998","unstructured":"Kocher, P.C.: On certificate revocation and validation. In: Hirschfeld, R. (ed.) FC 1998. LNCS, vol.\u00a01465, pp. 172\u2013177. Springer, Heidelberg (1998)"},{"issue":"3","key":"15_CR43","first-page":"248","volume":"16","author":"I. Krsul","year":"1997","unstructured":"Krsul, I., Spafford, E.H.: Authorship analysis: Identifying the author of a program. Computers and Society\u00a016(3), 248\u2013259 (1997)","journal-title":"Computers and Society"},{"key":"15_CR44","unstructured":"Kuhn, M.: The trustno1 cryptoprocessor concept. Technical Report CERIAS-1997-04-30, Purdue University (1997)"},{"key":"15_CR45","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/s00145-001-0010-y","volume":"14","author":"K. Kurosawa","year":"2001","unstructured":"Kurosawa, K., Johansson, T., Stinson, D.R.: Almost k-wise independent sample spaces and their cryptologic applications. Journal of Cryptology\u00a014, 231\u2013253 (2001)","journal-title":"Journal of Cryptology"},{"key":"15_CR46","doi-asserted-by":"crossref","unstructured":"Lysyanskaya, A., Tamassia, R., Triandopoulos, N.: Multicast authentication in fully adversarial networks. In: Proceedings of IEEE Symposium on Security and Privacy, pp. 241\u2013255 (May 2004)","DOI":"10.1109\/SECPRI.2004.1301327"},{"issue":"1","key":"15_CR47","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s00453-003-1076-8","volume":"39","author":"C. Martel","year":"2004","unstructured":"Martel, C., Nuckolls, G., Devanbu, P., Gertz, M., Kwong, A., Stubblebine, S.G.: A general model for authenticated data structures. Algorithmica\u00a039(1), 21\u201341 (2004)","journal-title":"Algorithmica"},{"key":"15_CR48","volume-title":"LEDA: A Platform for Combinatorial and Geometric Computing","author":"K. Mehlhorn","year":"2000","unstructured":"Mehlhorn, K., N\u00e4her, S.: LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press, Cambridge (2000)"},{"issue":"1-2","key":"15_CR49","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/S0925-7721(98)00036-4","volume":"12","author":"K. Mehlhorn","year":"1999","unstructured":"Mehlhorn, K., N\u00e4her, S., Seel, M., Seidel, R., Schilz, T., Schirra, S., Uhrig, C.: Checking geometric programs or verification of geometric structures. Comput. Geom. Theory Appl.\u00a012(1-2), 85\u2013103 (1999)","journal-title":"Comput. Geom. Theory Appl."},{"key":"15_CR50","volume-title":"Handbook of Applied Cryptography","author":"J. Menezes","year":"1997","unstructured":"Menezes, J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1997)"},{"key":"15_CR51","doi-asserted-by":"crossref","unstructured":"Naor, J., Naor, M.: Small-bias probability spaces: Efficient constructions and applications. In: ACM Symposium on Theory of Computing, pp. 213\u2013223 (1990)","DOI":"10.1145\/100216.100244"},{"key":"15_CR52","unstructured":"Naor, M., Nissim, K.: Certificate revocation and certificate update. In: Proc. 7th USENIX Security Symposium, Berkeley, pp. 217\u2013228 (1998)"},{"key":"15_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1041","DOI":"10.1007\/978-3-540-27836-8_87","volume-title":"Automata, Languages and Programming","author":"R. Ostrovsky","year":"2004","unstructured":"Ostrovsky, R., Rackoff, C., Smith, A.: Efficient consistency proofs for generalized queries on a committed database. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 1041\u20131053. Springer, Heidelberg (2004)"},{"key":"15_CR54","doi-asserted-by":"crossref","unstructured":"Polivy, D.J., Tamassia, R.: Authenticating distributed data using Web services and XML signatures. In: Proc. ACM Workshop on XML Security (2002)","DOI":"10.1145\/764804.764805"},{"key":"15_CR55","doi-asserted-by":"crossref","unstructured":"Qu, G., Potkonjak, M.: Analysis of watermarking techniques for graph coloring problem. In: IEEE\/ACM Int. Conf. on Computer-Aided Design, pp. 190\u2013193 (1998)","DOI":"10.1145\/288548.288607"},{"key":"15_CR56","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/978-1-4615-0013-1_15","volume-title":"Handbook of Randomized Computing","author":"D. Ron","year":"2001","unstructured":"Ron, D.: Property testing. In: Pardalos, P.M., Rajasekaran, S., Reif, J., Rolim, J.D.P. (eds.) Handbook of Randomized Computing, pp. 597\u2013649. Kluwer Academic Publishers, Dordrecht (2001)"},{"key":"15_CR57","doi-asserted-by":"crossref","unstructured":"Savage, S., Wetherall, D., Karlin, A.R., Anderson, T.: Practical network support for IP traceback. In: SIGCOMM, pp. 295\u2013306 (2000)","DOI":"10.1145\/347057.347560"},{"key":"15_CR58","volume-title":"Applied Cryptography: Protocols, Algorithms, and Source Code in C","author":"B. Schneier","year":"1996","unstructured":"Schneier, B.: Applied Cryptography: Protocols, Algorithms, and Source Code in C, 2nd edn. John Wiley and Sons, Inc., New York (1996)","edition":"2"},{"issue":"2","key":"15_CR59","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1145\/317087.317089","volume":"2","author":"B. Schneier","year":"1999","unstructured":"Schneier, B., Kelsey, J.: Secure audit logs to support computer forensics. ACM Trans. on Information and System Security\u00a02(2), 159\u2013176 (1999)","journal-title":"ACM Trans. on Information and System Security"},{"key":"15_CR60","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-540-24624-4_11","volume-title":"Digital Watermarking","author":"R. Sion","year":"2003","unstructured":"Sion, R., Atallah, M.J., Prabhakar, S.K.: Resilient information hiding for abstract semistructures. In: Kalker, T., Cox, I., Ro, Y.M. (eds.) IWDW 2003. LNCS, vol.\u00a02939, pp. 141\u2013153. Springer, Heidelberg (2003)"},{"key":"15_CR61","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1145\/872757.872772","volume-title":"Proc. 2003 ACM International Conference on Management of Data (SIGMOD)","author":"R. Sion","year":"2003","unstructured":"Sion, R., Atallah, M.J., Prabhakar, S.K.: Rights protection for relational data. In: Proc. 2003 ACM International Conference on Management of Data (SIGMOD), San Diego, California, pp. 98\u2013109. ACM Press, New York (2003)"},{"key":"15_CR62","unstructured":"Spafford, E.H., Kim, G.: The design and implementation of tripwire: A file system integrity checker. In: 2d ACM Conf. on Computer and Communication Security, CCS (1994)"},{"issue":"6","key":"15_CR63","first-page":"585","volume":"12","author":"E.H. Spafford","year":"1993","unstructured":"Spafford, E.H., Weeber, S.A.: Software forensics: Tracking code to its authors. Computers and Society\u00a012(6), 585\u2013595 (1993)","journal-title":"Computers and Society"},{"key":"15_CR64","volume-title":"Cryptography: Theory and Practice, Second Edition","author":"D.R. Stinson","year":"2002","unstructured":"Stinson, D.R.: Cryptography: Theory and Practice, Second Edition. CRC Press Series, Boca Raton (2002)"},{"key":"15_CR65","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/S0378-3758(99)00131-7","volume":"86","author":"D.R. Stinson","year":"2000","unstructured":"Stinson, D.R., van Trung, T., Wei, R.: Secure frameproof codes, key distribution patterns, group testing algorithms and related structures. Journal of Statistical Planning and Inference\u00a086, 595\u2013617 (2000)","journal-title":"Journal of Statistical Planning and Inference"},{"key":"15_CR66","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1109\/FTCS.1991.146668","volume-title":"Digest of the 21st Symposium on Fault-Tolerant Computing","author":"G.F. Sullivan","year":"1991","unstructured":"Sullivan, G.F., Masson, G.M.: Certification trails for data structures. In: Digest of the 21st Symposium on Fault-Tolerant Computing, pp. 240\u2013247. IEEE Computer Society Press, Los Alamitos (1991)"},{"issue":"7","key":"15_CR67","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1109\/12.392843","volume":"44","author":"G.F. Sullivan","year":"1995","unstructured":"Sullivan, G.F., Wilson, D.S., Masson, G.M.: Certification of computational results. IEEE Trans. Comput.\u00a044(7), 833\u2013847 (1995)","journal-title":"IEEE Trans. Comput."},{"key":"15_CR68","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-540-39658-1_2","volume-title":"Algorithms - ESA 2003","author":"R. Tamassia","year":"2003","unstructured":"Tamassia, R.: Authenticated data structures. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 2\u20135. Springer, Heidelberg (2003)"},{"key":"15_CR69","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/11523468_13","volume-title":"Automata, Languages and Programming","author":"R. Tamassia","year":"2005","unstructured":"Tamassia, R., Triandopoulos, N.: Computational bounds on hierarchical data processing with applications to information security. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 153\u2013165. Springer, Heidelberg (2005)"},{"key":"15_CR70","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/3-540-45496-9_12","volume-title":"Information Hiding","author":"R. Venkatesan","year":"2001","unstructured":"Venkatesan, R., Vazirani, V., Sinha, S.: A graph theoretic approach to software watermarking. In: Moskowitz, I.S. (ed.) IH 2001. LNCS, vol.\u00a02137, pp. 157\u2013168. Springer, Heidelberg (2001)"},{"key":"15_CR71","unstructured":"Yasinsac, A., Manzano, Y.: Policies to enhance computer and network forensics. In: IEEE Workshop on Information Assurance and Security, pp. 289\u2013295 (2001)"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11496137_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T02:18:28Z","timestamp":1740536308000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11496137_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262237","9783540315421"],"references-count":71,"URL":"https:\/\/doi.org\/10.1007\/11496137_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}