{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T23:06:26Z","timestamp":1744153586683},"reference-count":27,"publisher":"Association for Computing Machinery (ACM)","issue":"10","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2012,6]]},"abstract":"<jats:p>\n            We consider the problem of verifying the correctness and completeness of the result of a keyword search. We introduce the concept of an\n            <jats:italic>authenticated web crawler<\/jats:italic>\n            and present its design and prototype implementation. An authenticated web crawler is a trusted program that computes a specially-crafted signature over the web contents it visits. This signature enables (i) the verification of common Internet queries on web pages, such as conjunctive keyword searches---this guarantees that the output of a conjunctive keyword search is\n            <jats:italic>correct<\/jats:italic>\n            and\n            <jats:italic>complete<\/jats:italic>\n            ; (ii) the verification of the content returned by such Internet queries---this guarantees that web data is\n            <jats:italic>authentic<\/jats:italic>\n            and has not been maliciously altered since the computation of the signature by the crawler. In our solution, the search engine returns a cryptographic proof of the query result. Both the proof size and the verification time are proportional only to the sizes of the query description and the query result, but do not depend on the number or sizes of the web pages over which the search is performed. As we experimentally demonstrate, the prototype implementation of our system provides a low communication overhead between the search engine and the user, and fast verification of the returned results by the user.\n          <\/jats:p>","DOI":"10.14778\/2336664.2336666","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"920-931","source":"Crossref","is-referenced-by-count":16,"title":["Efficient verification of web-content searching through authenticated web crawlers"],"prefix":"10.14778","volume":"5","author":[{"given":"Michael T.","family":"Goodrich","sequence":"first","affiliation":[{"name":"UC Irvine"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charalampos","family":"Papamanthou","sequence":"additional","affiliation":[{"name":"UC Berkeley"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Duy","family":"Nguyen","sequence":"additional","affiliation":[{"name":"Brown University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Tamassia","sequence":"additional","affiliation":[{"name":"Brown University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cristina Videira","family":"Lopes","sequence":"additional","affiliation":[{"name":"UC Irvine"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olga","family":"Ohrimenko","sequence":"additional","affiliation":[{"name":"Brown University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikos","family":"Triandopoulos","sequence":"additional","affiliation":[{"name":"RSA Laboratories &amp; Boston University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,6]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497478"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.63"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/352600.352604"},{"key":"e_1_2_1_4_1","volume-title":"Dynamic accumulators and application to efficient revocation of anonymous credentials. CRYPTO, 61--76","author":"Camenisch J.","year":"2002","unstructured":"J. Camenisch and A. Lysyanskaya . Dynamic accumulators and application to efficient revocation of anonymous credentials. CRYPTO, 61--76 , 2002 . J. Camenisch and A. Lysyanskaya. Dynamic accumulators and application to efficient revocation of anonymous credentials. CRYPTO, 61--76, 2002."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/501983.502003"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/876661.876663"},{"key":"e_1_2_1_7_1","volume-title":"An efficient dynamic and distributed cryptographic accumulator. ISC, 372--388","author":"Goodrich M. T.","year":"2002","unstructured":"M. T. Goodrich , R. Tamassia , and J. Hasic . An efficient dynamic and distributed cryptographic accumulator. ISC, 372--388 , 2002 . M. T. Goodrich, R. Tamassia, and J. Hasic. An efficient dynamic and distributed cryptographic accumulator. ISC, 372--388, 2002."},{"key":"e_1_2_1_8_1","volume-title":"Implementation of an authenticated dictionary with skip lists and commutative hashing. DISCEX II, 68--82","author":"Goodrich M. T.","year":"2001","unstructured":"M. T. Goodrich , R. Tamassia , and A. Schwerin . Implementation of an authenticated dictionary with skip lists and commutative hashing. DISCEX II, 68--82 , 2001 . M. T. Goodrich, R. Tamassia, and A. Schwerin. Implementation of an authenticated dictionary with skip lists and commutative hashing. DISCEX II, 68--82, 2001."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-009-9355-7"},{"key":"e_1_2_1_10_1","volume-title":"Super-efficient verification of dynamic outsourced databases. CT--RSA, 407--424","author":"Goodrich M. T.","year":"2008","unstructured":"M. T. Goodrich , R. Tamassia , and N. Triandopoulos . Super-efficient verification of dynamic outsourced databases. CT--RSA, 407--424 , 2008 . M. T. Goodrich, R. Tamassia, and N. Triandopoulos. Super-efficient verification of dynamic outsourced databases. CT--RSA, 407--424, 2008."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142488"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-003-1076-8"},{"key":"e_1_2_1_13_1","volume-title":"A certified digital signature. CRYPTO, 218--238","author":"Merkle R. C.","year":"1989","unstructured":"R. C. Merkle . A certified digital signature. CRYPTO, 218--238 , 1989 . R. C. Merkle. A certified digital signature. CRYPTO, 218--238, 1989."},{"key":"e_1_2_1_14_1","volume-title":"New software speed records for cryptographic pairings. LATINCRYPT, 109--123","author":"Naehrig M.","year":"2010","unstructured":"M. Naehrig , R. Niederhagen , and P. Schwabe . New software speed records for cryptographic pairings. LATINCRYPT, 109--123 , 2010 . M. Naehrig, R. Niederhagen, and P. Schwabe. New software speed records for cryptographic pairings. LATINCRYPT, 109--123, 2010."},{"key":"e_1_2_1_15_1","volume-title":"Certificate revocation and certificate update. USENIX Security, 217--228","author":"Naor M.","year":"1998","unstructured":"M. Naor and K. Nissim . Certificate revocation and certificate update. USENIX Security, 217--228 , 1998 . M. Naor and K. Nissim. Certificate revocation and certificate update. USENIX Security, 217--228, 1998."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11733836_30"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30574-3_19"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/11535706_7"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066204"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453875"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1455770.1455826"},{"key":"e_1_2_1_22_1","volume-title":"Optimal verification of operations on dynamic sets. CRYPTO, 91--110","author":"Papamanthou C.","year":"2011","unstructured":"C. Papamanthou , R. Tamassia , and N. Triandopoulos . Optimal verification of operations on dynamic sets. CRYPTO, 91--110 , 2011 . C. Papamanthou, R. Tamassia, and N. Triandopoulos. Optimal verification of operations on dynamic sets. CRYPTO, 91--110, 2011."},{"key":"e_1_2_1_23_1","volume-title":"AMW","author":"Tamassia R.","year":"2010","unstructured":"R. Tamassia and N. Triandopoulos . Certification and authentication of data structures . In AMW , 2010 . R. Tamassia and N. Triandopoulos. Certification and authentication of data structures. In AMW, 2010."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_13"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559849"},{"key":"e_1_2_1_26_1","volume-title":"Efficient verification of shortest path search via authenticated hints. ICDE, 237--248","author":"Yiu M. L.","year":"2010","unstructured":"M. L. Yiu , Y. Lin and K. Mouratidis . Efficient verification of shortest path search via authenticated hints. ICDE, 237--248 , 2010 . M. L. Yiu, Y. Lin and K. Mouratidis. Efficient verification of shortest path search via authenticated hints. ICDE, 237--248, 2010."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132956.1132959"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2336664.2336666","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:45:16Z","timestamp":1672224316000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2336664.2336666"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6]]},"references-count":27,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["10.14778\/2336664.2336666"],"URL":"https:\/\/doi.org\/10.14778\/2336664.2336666","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2012,6]]}}}