{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:43:34Z","timestamp":1742953414115,"version":"3.40.3"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319446172"},{"type":"electronic","value":"9783319446189"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-44618-9_12","type":"book-chapter","created":{"date-parts":[[2016,8,9]],"date-time":"2016-08-09T21:10:01Z","timestamp":1470777001000},"page":"216-236","source":"Crossref","is-referenced-by-count":6,"title":["Verifiable Zero-Knowledge Order Queries and Updates for Fully Dynamic Lists and Trees"],"prefix":"10.1007","author":[{"given":"Esha","family":"Ghosh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael T.","family":"Goodrich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olga","family":"Ohrimenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Tamassia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,11]]},"reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Theory of Cryptography","author":"JH Ahn","year":"2012","unstructured":"Ahn, J.H., Boneh, D., Camenisch, J., Hohenberger, S., Waters, B.: Computing on authenticated data. In: Cramer, R. (ed.) TCC 2012. LNCS, vol. 7194, pp. 1\u201320. Springer, Heidelberg (2012)"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/978-3-642-34961-4_23","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"N Attrapadung","year":"2012","unstructured":"Attrapadung, N., Libert, B., Peters, T.: Computing on authenticated data: new privacy definitions and constructions. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 367\u2013385. Springer, Heidelberg (2012)"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1007\/3-540-45749-6_17","volume-title":"Algorithms - ESA 2002","author":"MA Bender","year":"2002","unstructured":"Bender, M.A., Cole, R., Demaine, E.D., Farach-Colton, M., Zito, J.: Two simplified algorithms for maintaining order in a list. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 152\u2013164. Springer, Heidelberg (2002)"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/978-3-540-24676-3_14","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X.: Efficient selective-ID secure identity-based encryption without random oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 223\u2013238. Springer, Heidelberg (2004)"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1007\/3-540-39200-9_26","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"D Boneh","year":"2003","unstructured":"Boneh, D., Gentry, C., Lynn, B., Shacham, H.: Aggregate and verifiably encrypted signatures from bilinear maps. In: Biham, Eli (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 416\u2013432. Springer, Heidelberg (2003)"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/978-3-642-13708-2_6","volume-title":"Applied Cryptography and Network Security","author":"C Brzuska","year":"2010","unstructured":"Brzuska, C., et al.: Redactable signatures for tree-structured data: definitions and constructions. In: Zhou, J., Yung, M. (eds.) ACNS 2010. LNCS, vol. 6123, pp. 87\u2013104. Springer, Heidelberg (2010)"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Catalano, D., Fiore, D.: Vector commitments and their applications. In: PKC (2013)","DOI":"10.1007\/978-3-642-36362-7_5"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/978-3-540-78967-3_25","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"D Catalano","year":"2008","unstructured":"Catalano, D., Fiore, D., Messina, M.: Zero-knowledge sets with short proofs. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 433\u2013450. Springer, Heidelberg (2008)"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/978-3-642-00862-7_9","volume-title":"Topics in Cryptology \u2013 CT-RSA 2009","author":"E-C Chang","year":"2009","unstructured":"Chang, E.-C., Lim, C.L., Xu, J.: Short redactable signatures using random trees. In: Fischlin, M. (ed.) CT-RSA 2009. LNCS, vol. 5473, pp. 133\u2013147. Springer, Heidelberg (2009)"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1007\/11426639_25","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"M Chase","year":"2005","unstructured":"Chase, M., Healy, A., Lysyanskaya, A., Malkin, T., Reyzin, L.: Mercurial commitments with applications to zero-knowledge sets. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 422\u2013439. Springer, Heidelberg (2005)"},{"key":"12_CR11","unstructured":"Devanbu, P.T., Gertz, M., Martel, C.U., Stubblebine, S.G.: Authentic third-party data publication. In: DBSec (2000)"},{"key":"12_CR12","unstructured":"Ghosh, E., Goodrich, M.T., Ohrimenko, O., Tamassia, R.: Fully-dynamic verifiable zero-knowledge order queries for network data. ePrint 2015\/283 (2015)"},{"key":"12_CR13","unstructured":"Ghosh, E., Ohrimenko, O., Papadopoulos, D., Tamassia, R., Triandopoulos, N.: Zero-knowledge accumulators and set operations. ePrint 2015\/404 (2015)"},{"key":"12_CR14","unstructured":"Ghosh, E., Ohrimenko, O., Tamassia, R.: Verifiable member and order queries on a list in zero-knowledge. In: ACNS (2015)"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Ghosh, E., Ohrimenko, O., Tamassia, R.: Efficient verifiable range and closest point queries in zero-knowledge. PoPETs 2016(4) (2016)","DOI":"10.1515\/popets-2016-0045"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Goldberg, S., Naor, M., Papadopoulos, D., Reyzin, L., Vasant, S., Ziv, A.: NSEC5: provably preventing DNSSEC zone enumeration. In: NDSS (2015)","DOI":"10.14722\/ndss.2015.23211"},{"key":"12_CR17","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511721656","volume-title":"The Foundations of Cryptography - Basic Applications","author":"O Goldreich","year":"2004","unstructured":"Goldreich, O.: The Foundations of Cryptography - Basic Applications, vol. 2. Cambridge University Press, Cambridge (2004)"},{"issue":"10","key":"12_CR18","first-page":"920","volume":"5","author":"MT Goodrich","year":"2012","unstructured":"Goodrich, M.T., Nguyen, D., Ohrimenko, O., Papamanthou, C., Tamassia, R., Triandopoulos, N., Lopes, C.V.: Efficient verification of web-content searching through authenticated web crawlers. PVLDB 5(10), 920\u2013931 (2012)","journal-title":"PVLDB"},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/3-540-10843-2_34","volume-title":"Automata, Languages and Programming","author":"A Itai","year":"1981","unstructured":"Itai, A., Konheim, A.G., Rodeh, M.: A sparse table implementation of priority queues. In: Even, S., Kariv, O. (eds.) Automata, Languages and Programming. LNCS, vol. 115, pp. 417\u2013431. Springer, Heidelberg (1981)"},{"key":"12_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1007\/3-540-45760-7_17","volume-title":"Topics in Cryptology - CT-RSA 2002","author":"R Johnson","year":"2002","unstructured":"Johnson, R., Molnar, D., Song, D., Wagner, D.: Homomorphic signature schemes. In: Preneel, B. (ed.) CT-RSA 2002. LNCS, vol. 2271, pp. 244\u2013262. Springer, Heidelberg (2002)"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Kundu, A., Atallah, M.J., Bertino, E.: Leakage-free redactable signatures. In: CODASPY (2012)","DOI":"10.1145\/2133601.2133639"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Kundu, A., Bertino, E.: Structural signatures for tree data structures. In: PVLDB (2008)","DOI":"10.14778\/1453856.1453876"},{"key":"12_CR23","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/s10207-013-0198-5","volume":"12","author":"A Kundu","year":"2013","unstructured":"Kundu, A., Bertino, E.: Privacy-preserving authentication of trees and graphs. Int. J. Inf. Secur. 12, 467\u2013494 (2013)","journal-title":"Int. J. Inf. Secur."},{"key":"12_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1007\/978-3-642-11799-2_30","volume-title":"Theory of Cryptography","author":"B Libert","year":"2010","unstructured":"Libert, B., Yung, M.: Concise mercurial vector commitments and independent zero-knowledge sets with short proofs. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 499\u2013517. Springer, Heidelberg (2010)"},{"key":"12_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/11593447_10","volume-title":"Advances in Cryptology - ASIACRYPT 2005","author":"M Liskov","year":"2005","unstructured":"Liskov, M.: Updatable zero-knowledge databases. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 174\u2013198. Springer, Heidelberg (2005)"},{"key":"12_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1007\/0-387-34805-0_21","volume-title":"Advances in Cryptology - CRYPTO 1989","author":"RC Merkle","year":"1990","unstructured":"Merkle, R.C.: A certified digital signature. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 218\u2013238. Springer, Heidelberg (1990)"},{"key":"12_CR27","doi-asserted-by":"crossref","unstructured":"Micali, S., Rabin, M.O., Kilian, J.: Zero-knowledge sets. In: FOCS (2003)","DOI":"10.1109\/SFCS.2003.1238183"},{"key":"12_CR28","doi-asserted-by":"crossref","unstructured":"Naor, M., Teague, V.: Anti-presistence: history independent data structures. In: Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 6\u20138 July 2001 (2001)","DOI":"10.1145\/380752.380844"},{"key":"12_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/978-3-662-46497-7_8","volume-title":"Theory of Cryptography","author":"M Naor","year":"2015","unstructured":"Naor, M., Ziv, A.: Primary-secondary-resolver membership proof systems. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015, Part II. LNCS, vol. 9015, pp. 199\u2013228. Springer, Heidelberg (2015)"},{"key":"12_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 3142, pp. 1041\u20131053. Springer, Heidelberg (2004)"},{"issue":"7","key":"12_CR31","first-page":"750","volume":"8","author":"D Papadopoulos","year":"2015","unstructured":"Papadopoulos, D., Papamanthou, C., Tamassia, R., Triandopoulos, N.: Practical authenticated pattern matching with optimal proof size. PVLDB 8(7), 750\u2013761 (2015)","journal-title":"PVLDB"},{"key":"12_CR32","unstructured":"Poehls, H.C., Samelin, K., Posegga, J., De Meer, H.: Length-hiding redactable signatures from one-way accumulators in $$O(n)$$ . Technical report MIP-1201, FIM. University of Passau (2012)"},{"key":"12_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/978-3-319-07536-5_27","volume-title":"Applied Cryptography and Network Security","author":"HC P\u00f6hls","year":"2014","unstructured":"P\u00f6hls, H.C., Samelin, K.: On updatable redactable signatures. In: Boureanu, I., Owesarski, P., Vaudenay, S. (eds.) ACNS 2014. LNCS, vol. 8479, pp. 457\u2013475. Springer, Heidelberg (2014)"},{"key":"12_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1007\/978-3-642-00862-7_7","volume-title":"Topics in Cryptology \u2013 CT-RSA 2009","author":"M Prabhakaran","year":"2009","unstructured":"Prabhakaran, M., Xue, R.: Statistically hiding sets. In: Fischlin, M. (ed.) CT-RSA 2009. LNCS, vol. 5473, pp. 100\u2013116. Springer, Heidelberg (2009)"},{"key":"12_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/978-3-642-29101-2_2","volume-title":"Information Security Practice and Experience","author":"K Samelin","year":"2012","unstructured":"Samelin, K., P\u00f6hls, H.C., Bilzhause, A., Posegga, J., de Meer, H.: Redactable signatures for independent removal of structure and content. In: Ryan, M.D., Smyth, B., Wang, G. (eds.) ISPEC 2012. LNCS, vol. 7232, pp. 17\u201333. Springer, Heidelberg (2012)"},{"key":"12_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/3-540-45861-1_22","volume-title":"Information Security and Cryptology - ICISC 2001","author":"R Steinfeld","year":"2002","unstructured":"Steinfeld, R., Bull, L., Zheng, Y.: Content extraction signatures. In: Kim, K. (ed.) ICISC 2001. LNCS, vol. 2288, pp. 285\u2013304. Springer, Heidelberg (2002)"},{"key":"12_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 2832, pp. 2\u20135. Springer, Heidelberg (2003)"},{"key":"12_CR38","series-title":"Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/978-3-642-36883-7_2","volume-title":"Security and Privacy in Communication Networks","author":"Z Wang","year":"2013","unstructured":"Wang, Z.: Improvement on Ahn et al.\u2019s RSA P-homomorphic signature scheme. In: Keromytis, A.D., Di Pietro, R. (eds.) SecureComm 2012. LNICST, vol. 106, pp. 19\u201328. Springer, Heidelberg (2013)"},{"key":"12_CR39","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/0890-5401(92)90034-D","volume":"97","author":"DE Willard","year":"1992","unstructured":"Willard, D.E.: A density control algorithm for doing insertions and deletions in a sequentially ordered file in good worst-case time. Inf. Comput. 97, 150\u2013204 (1992)","journal-title":"Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","Security and Cryptography for Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44618-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,12]],"date-time":"2019-09-12T06:26:39Z","timestamp":1568269599000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44618-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319446172","9783319446189"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44618-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}