{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:36:42Z","timestamp":1766281002718},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540306849"},{"type":"electronic","value":"9783540322672"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11593447_10","type":"book-chapter","created":{"date-parts":[[2005,11,15]],"date-time":"2005-11-15T06:37:16Z","timestamp":1132036636000},"page":"174-198","source":"Crossref","is-referenced-by-count":42,"title":["Updatable Zero-Knowledge Databases"],"prefix":"10.1007","author":[{"given":"Moses","family":"Liskov","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"10_CR1","first-page":"1084","volume":"20","author":"M. Blum","year":"1991","unstructured":"Blum, M., De Santis, A., Micali, S., Persiano, G.: Noninteractive zero-knowledge. SIAM. Journal on Computing\u00a020(6), 1084\u20131118 (1991)","journal-title":"Journal on Computing"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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.\u00a03494, pp. 422\u2013439. Springer, Heidelberg (2005)"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-540-30580-4_28","volume-title":"Public Key Cryptography - PKC 2005","author":"Y. Dodis","year":"2005","unstructured":"Dodis, Y., Yampolskiy, A.: A verifiable random function with short proofs and keys. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol.\u00a03386, pp. 416\u2013431. Springer, Heidelberg (2005)"},{"issue":"1","key":"10_CR4","first-page":"691","volume":"38","author":"O. Goldreich","year":"1991","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. Journal of the ACM\u00a038(1), 691\u2013729 (1991)","journal-title":"Journal of the ACM"},{"unstructured":"Kilian, J.: Efficiently committing to databases. TR 97-040, NEC Research Institute (1997)","key":"10_CR5"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/3-540-45708-9_38","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"A. Lysyanskaya","year":"2002","unstructured":"Lysyanskaya, A.: Unique signatures and verifiable random functions from the DH-DDH separation. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, p. 597. Springer, Heidelberg (2002)"},{"key":"10_CR7","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 \u201989","author":"R.C. Merkle","year":"1990","unstructured":"Merkle, R.C.: A certified digital signature. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 218\u2013238. Springer, Heidelberg (1990)"},{"key":"10_CR8","first-page":"1","volume-title":"Proceedings of Compression and Complexity of Sequences","author":"S. Micali","year":"1997","unstructured":"Micali, S., Rabin, M.: Hashing on strings, cryptography, and protection of privacy. In: Proceedings of Compression and Complexity of Sequences, June 11 \u2013 13, p. 1. IEEE Computer Society, Los Alamitos (1997)"},{"key":"10_CR9","volume-title":"44th Annual Symposium on Foundations of Computer Science","author":"S. Micali","year":"2003","unstructured":"Micali, S., Rabin, M., Kilian, J.: Zero-knowledge sets. In: 44th Annual Symposium on Foundations of Computer Science, October 2003, IEEE, Cambridge (2003)"},{"key":"10_CR10","first-page":"120","volume-title":"40th Annual Symposium on Foundations of Computer Science","author":"S. Micali","year":"1999","unstructured":"Micali, S., Rabin, M., Vadhan, S.: Verifiable random functions. In: 40th Annual Symposium on Foundations of Computer Science, October 1999, pp. 120\u2013130. IEEE, New York (1999)"},{"doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Rackoff, C., Smith, A.: Efficient proofs of consistency for generalized queries on a committed database. In: Proceedings of ICALP 2004 (2004)","key":"10_CR11","DOI":"10.1007\/978-3-540-27836-8_87"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1007\/3-540-46416-6_47","volume-title":"Advances in Cryptology - EUROCRYPT \u201991","author":"T.P. Pedersen","year":"1991","unstructured":"Pedersen, T.P.: A threshold cryptosystem without a trusted party (extended abstract). In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol.\u00a0547, pp. 522\u2013526. Springer, Heidelberg (1991)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - ASIACRYPT 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11593447_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:51:43Z","timestamp":1619506303000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11593447_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540306849","9783540322672"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11593447_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}