{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T04:03:02Z","timestamp":1746158582381,"version":"3.40.4"},"reference-count":30,"publisher":"Wiley","issue":"12","license":[{"start":{"date-parts":[[2013,12,10]],"date-time":"2013-12-10T00:00:00Z","timestamp":1386633600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61070164","61272415"],"award-info":[{"award-number":["61070164","61272415"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Natural Science Foundation of Guangdong Province, China","award":["S2012010008767"],"award-info":[{"award-number":["S2012010008767"]}]},{"name":"Science and Technology Planning Project of Guangdong City, China","award":["12C542071906"],"award-info":[{"award-number":["12C542071906"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Security Comm Networks"],"published-print":{"date-parts":[[2014,12]]},"abstract":"<jats:title>ABSTRACT<\/jats:title><jats:p>In order to verify the integrity of the query results in outsourced database model, we first present a new authenticated data structure by combining skip lists with polynomial functions and accumulators and then construct a data integrity verification scheme for range query. Our scheme can verify the integrity of the query results with constant time verification and constant size proof and support dynamic maintenance with constant computational cost. Compared with that of previous schemes, the communication cost in our scheme is independent of the size of the authenticated dataset and is lower. When dataset size gets larger enough, our scheme outperforms previous schemes in terms of the computational cost and verification cost. In addition, we introduce the designated verifier idea into our scheme, so our scheme achieves the result that none but subscribers can verify the integrity of the query results and then meets the practical demands such as the payment service. The proof of security and analysis of experiment performance show that our scheme is secure and efficient for larger outsourced databases. Copyright \u00a9 2013 John Wiley &amp; Sons, Ltd.<\/jats:p>","DOI":"10.1002\/sec.938","type":"journal-article","created":{"date-parts":[[2013,12,10]],"date-time":"2013-12-10T10:08:42Z","timestamp":1386670122000},"page":"2293-2301","source":"Crossref","is-referenced-by-count":3,"title":["Data integrity verification scheme with designated verifiers for dynamic outsourced databases"],"prefix":"10.1002","volume":"7","author":[{"given":"Xiaoming","family":"Wang","sequence":"first","affiliation":[{"name":"Department of Computer Science Jinan University Guangzhou 510632 China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanchun","family":"Lin","sequence":"additional","affiliation":[{"name":"Department of Computer Science Jinan University Guangzhou 510632 China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guoxiang","family":"Yao","sequence":"additional","affiliation":[{"name":"Department of Computer Science Jinan University Guangzhou 510632 China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2013,12,10]]},"reference":[{"key":"e_1_2_7_2_1","doi-asserted-by":"crossref","unstructured":"MerkleRC.A certified digital signature. In G. Brassard editor. In Proc.CRYPTO'89 9th Annual International Cryptology Conference August 1989;218\u2013238.","DOI":"10.1007\/0-387-34805-0_21"},{"key":"e_1_2_7_3_1","doi-asserted-by":"crossref","unstructured":"LiF HadjieleftheriouM KolliosG ReyzinL.Dynamic authenticated index structures for outsourced databases. In Proc. ACM SIGMOD international conference on Management of data 2006;121\u2013132.","DOI":"10.1145\/1142473.1142488"},{"key":"e_1_2_7_4_1","unstructured":"GoodrichMT TamassiaR.Efficient authenticated dictionaries with skip lists and commutative hashing. Tech. Rep. Johns Hopkins Information Security Institute 2001December 4 Baltimore USA."},{"key":"e_1_2_7_5_1","first-page":"246","volume-title":"Lecture Notes in Computer Science 6487","author":"Papamanthou C","year":"2010"},{"key":"e_1_2_7_6_1","doi-asserted-by":"crossref","unstructured":"CamenischJ LysyanskayaA.Dynamic accumulators and application to efficient revocation of anonymous credentials. In: Proc. 22ndAnnual International Cryptology Conference 2002;61\u201376.","DOI":"10.1007\/3-540-45708-9_5"},{"key":"e_1_2_7_7_1","doi-asserted-by":"crossref","unstructured":"NarasimhaM TsudikG.DSAC: integrity of outsourced databases with signature aggregation and chaining. In Proc. of Conference on Information and Knowledge Management (CIKM) 2005;235\u201323.","DOI":"10.1145\/1099554.1099604"},{"key":"e_1_2_7_8_1","doi-asserted-by":"crossref","unstructured":"PangH JainA RamamrithamK TanK L.Verifying completeness of relational query results in data publishing. In: Proceedings of the 2005 ACM SIGMOD international conference on Management of data USA 2005;407\u2013418.","DOI":"10.1145\/1066157.1066204"},{"key":"e_1_2_7_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-008-0108-z"},{"key":"e_1_2_7_10_1","doi-asserted-by":"crossref","unstructured":"PangH TanK L.Authenticating query results in edge computing. In Proc. of International Conference on Engineering(ICDE) 2004;560\u2013571.","DOI":"10.1109\/ICDE.2004.1320027"},{"key":"e_1_2_7_11_1","doi-asserted-by":"crossref","unstructured":"GoodrichM T TamassiaR TriandopoulosN.Super\u2010efficient verification of dynamic outsourced databases. In Proc. CT\u2010RSA 2008;407\u2013424.","DOI":"10.1007\/978-3-540-79263-5_26"},{"key":"e_1_2_7_12_1","doi-asserted-by":"crossref","unstructured":"YangY PapadopoulosS PapadiaDS KolliosG.Spatial outsourcing for location\u2010 based services. In: Proceedings of the 2008 IEEE 24th International Conference on Data Engineering 2008;1082\u20131091","DOI":"10.1109\/ICDE.2008.4497517"},{"key":"e_1_2_7_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-009-0169-7"},{"issue":"10","key":"e_1_2_7_14_1","first-page":"1263","article-title":"Selective and authentic third\u2010party distribution of XML documents","volume":"16","author":"Bertino E","year":"2004","journal-title":"IEEE TKDE"},{"key":"e_1_2_7_15_1","doi-asserted-by":"crossref","unstructured":"GoodricM T TamassiahR TriandopoulosN CohenR F.Authenticated data structures for graph and geometric searching. In: The Cryptographers' Track at the RSA Conference 2003 San Francisco CA USA 2003:295\u2013313.","DOI":"10.1007\/3-540-36563-X_20"},{"issue":"1","key":"e_1_2_7_16_1","first-page":"126","article-title":"Authenticating the query results of text search engines","volume":"1","author":"Pang H","year":"2008","journal-title":"PVLDB"},{"key":"e_1_2_7_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/78973.78977"},{"key":"e_1_2_7_18_1","doi-asserted-by":"crossref","unstructured":"WangJ DuX Y.Skip list based authenticated data structure in DAS paradigm. In 2009 Eighth International Conference on Grid and Cooperative Computing 2009:69\u201375.","DOI":"10.1109\/GCC.2009.33"},{"key":"e_1_2_7_19_1","doi-asserted-by":"crossref","unstructured":"Di BattistaG PalazziB.Authenticated relational tables and authenticated skip lists. In Proc. IFIP Working Conference on Data and Applications Security 2007:31\u201346.","DOI":"10.1007\/978-3-540-73538-0_3"},{"key":"e_1_2_7_20_1","doi-asserted-by":"crossref","unstructured":"HeitzmannA PalazziB PapamanthouC TamassiaR.Efficient integrity checking of untrusted network storage storageSS'08 2008:43\u201353.","DOI":"10.1145\/1456469.1456479"},{"key":"e_1_2_7_21_1","doi-asserted-by":"crossref","unstructured":"AtenieseG BurnsR CurtmolaR et al.Provable data possession at untrusted stores in CCS \u201907: Proceedings of the 14th ACM conference on Computer and communications security (New York NY USA) 2007;598\u2013609.","DOI":"10.1145\/1315245.1315318"},{"key":"e_1_2_7_22_1","doi-asserted-by":"crossref","unstructured":"AtenieseG Di PietroR ManciniL V TsudikG.Scalable and efficient provable data possession. In: Proc. of SecureComm 2008 2008;1\u20139.","DOI":"10.1145\/1460877.1460889"},{"key":"e_1_2_7_23_1","doi-asserted-by":"crossref","unstructured":"WangQ WangC LiJ RenK LouW.Enabling public verifiability and data dynamics for storage security in cloud computing. In 14th European Symposium on Research in Computer Security 2009;355\u2013370.","DOI":"10.1007\/978-3-642-04444-1_22"},{"key":"e_1_2_7_24_1","doi-asserted-by":"crossref","unstructured":"ErwayC KupcuA PapamanthouC TamassiaR.Dynamic provable data possession \u201d in CCS \u201909: Proceedings of the 16th ACM conference on Computer and communications security 2009:213\u2013222.","DOI":"10.1145\/1653662.1653688"},{"key":"e_1_2_7_25_1","doi-asserted-by":"crossref","unstructured":"BenalohJ C deMareM.One\u2010way accumulators: a decentralized alternative to digital signatures. In: Proc. Advances in Cryptology\u2013 UROCRYPT\u2019 3 May 1993:274\u2013285.","DOI":"10.1007\/3-540-48285-7_24"},{"key":"e_1_2_7_26_1","doi-asserted-by":"crossref","unstructured":"Bari\u00b4cN PfitzmannB.Collision\u2010free accumulators and fail\u2010stop signature schemes without trees. In: Proc. Advances in Cryptology\u2010EUROCRYPT'97 1997;480\u2013494.","DOI":"10.1007\/3-540-69053-0_33"},{"key":"e_1_2_7_27_1","doi-asserted-by":"crossref","unstructured":"CamenischJ LysyanskayaA.Dynamic accumulators and application to efficient revocation of anonymous credentials. In: Proc. 22ndAnnual International Cryptology Conference 2002;61\u201376.","DOI":"10.1007\/3-540-45708-9_5"},{"key":"e_1_2_7_28_1","first-page":"275","volume-title":"Lecture Notes in Computer Science","author":"Nguyen L","year":"2005"},{"key":"e_1_2_7_29_1","unstructured":"PapamanthouC TamassiaR TriandopoulosN.Cryptographic accumulator for authenticated hash tables. Cryptology ePrint Archive Report 2009\/ 625 2009."},{"key":"e_1_2_7_30_1","doi-asserted-by":"crossref","unstructured":"PapamanthouC TamassiaR TriandopoulosN.Authenticated hash tables. In: 15th ACM Conference on Computer and Communications Security (CCS) 2008;437\u2013448.","DOI":"10.1145\/1455770.1455826"},{"key":"e_1_2_7_31_1","unstructured":"PBC: The pairing\u2010based cryptography library.http:\/\/crypto.stanford.edu\/pbc\/."}],"container-title":["Security and Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fsec.938","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fsec.938","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/sec.938","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T03:55:36Z","timestamp":1746071736000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/sec.938"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,10]]},"references-count":30,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["10.1002\/sec.938"],"URL":"https:\/\/doi.org\/10.1002\/sec.938","archive":["Portico"],"relation":{},"ISSN":["1939-0114","1939-0122"],"issn-type":[{"type":"print","value":"1939-0114"},{"type":"electronic","value":"1939-0122"}],"subject":[],"published":{"date-parts":[[2013,12,10]]}}}