{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T08:36:10Z","timestamp":1765960570382,"version":"3.34.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,3,1]],"date-time":"2008-03-01T00:00:00Z","timestamp":1204329600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2008,3]]},"DOI":"10.1007\/s11390-008-9119-x","type":"journal-article","created":{"date-parts":[[2008,4,10]],"date-time":"2008-04-10T20:01:21Z","timestamp":1207857681000},"page":"166-175","source":"Crossref","is-referenced-by-count":7,"title":["Algebraic Construction for Zero-Knowledge Sets"],"prefix":"10.1007","volume":"23","author":[{"given":"Rui","family":"Xue","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ning-Hui","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiang-Tao","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,4,5]]},"reference":[{"key":"9119_CR1","doi-asserted-by":"crossref","unstructured":"Micali S, Rabin M, Kilian J. Zero-knowledge sets. In Proc. the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS), Cambridge, MA, USA, 2003, p. 80.","DOI":"10.1109\/SFCS.2003.1238183"},{"key":"9119_CR2","doi-asserted-by":"crossref","unstructured":"Merkle R C. A certified digital signature. In Proc. Advances in Cryptology\u2014CRYPTO\u201989, Brassard G (ed.), Santa Barbara, California, United States, Lecture Notes in Computer Science, Vol. 435, Springer-Verlag, 1990, 20\u201324 Aug., 1989, pp.218\u2013238.","DOI":"10.1007\/0-387-34805-0_21"},{"key":"9119_CR3","doi-asserted-by":"crossref","unstructured":"Pedersen T P. Non-interactive and information-theoretic secure verifiable secret sharing. In Proc. Advances in Cryptology \u2014 CRYPTO\u201991, Santa Barbara, California, USA, 1992, pp.129\u2013140.","DOI":"10.1007\/3-540-46766-1_9"},{"key":"9119_CR4","first-page":"422","volume-title":"Proc. Advances in Cryptology - EUROCRYPT\u201905","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 Proc. Advances in Cryptology - EUROCRYPT\u201905, Aarhus, Denmark, 2005, pp.422\u2013439."},{"key":"9119_CR5","first-page":"174","volume-title":"Proc. Advances in Cryptology \u2014 ASIACRYPT\u201905","author":"M Liskov","year":"2005","unstructured":"Liskov M. Updatable zero-knowledge databases. In Proc. Advances in Cryptology \u2014 ASIACRYPT\u201905, Chennai, India, 2005, pp.174\u2013198."},{"key":"9119_CR6","first-page":"1041","volume-title":"Proc ICALP","author":"R Ostrovsky","year":"2004","unstructured":"Ostrovsky R, Rackoff C, Smith A. Efficient consistency proofs for generalized queries on a committed database. In Proc ICALP, Turku, Finland, 2004, pp.1041\u20131053."},{"key":"9119_CR7","doi-asserted-by":"crossref","unstructured":"Catalano D, Dodis Y, Visconti I. Mercurial commitments: Minimal assumptions and efficient constructions. In Proc. Theory of Cryptography \u2014 TCC\u201906, Lecture Notes in Computer Science, Vol. 3876, New York, Springer-Verlag, 2006, pp.120\u2013144.","DOI":"10.1007\/11681878_7"},{"key":"9119_CR8","doi-asserted-by":"crossref","unstructured":"Gennaro R, Micali S. Independent zero-knowledge sets. In Proc. ICALP (2), Venice, Italy, 2006, pp.34\u201345.","DOI":"10.1007\/11787006_4"},{"key":"9119_CR9","doi-asserted-by":"crossref","unstructured":"Benaloh J C, de Mare M. One-way accumulators: A decentralized alternative to digital signatures. In Proc. Advances in Cryptology \u2014 EUROCRYPT\u201993, Lofthus, Norway, 1994, pp.274\u2013285.","DOI":"10.1007\/3-540-48285-7_24"},{"key":"9119_CR10","doi-asserted-by":"crossref","unstructured":"Bari\u0107 N, Pfitzmann B. Collision-free accumulators and failstop signature schemes without trees. In Proc. Advances in Cryptology \u2014 EUROCRYPT\u201997, Konstanz, Germany, 1997, pp.480\u2013494.","DOI":"10.1007\/3-540-69053-0_33"},{"key":"9119_CR11","doi-asserted-by":"crossref","unstructured":"Camenisch J, Lysyanskaya A. Dynamic accumulators and application to efficient revocation of anonymous credentials. In Advances in Cryptology \u2014 CRYPTO\u201902, Santa Barbara, California, USA, 2002, pp.61\u201376.","DOI":"10.1007\/3-540-45708-9_5"},{"key":"9119_CR12","doi-asserted-by":"crossref","unstructured":"Goodrich M T, Tamassia R, Hasic J. An efficient dynamic and distributed cryptographic accumulator. In Proc. the 5th International Conference on Information Security, London, UK, 2002, pp.372\u2013388.","DOI":"10.1007\/3-540-45811-5_29"},{"key":"9119_CR13","unstructured":"Li J T, Li N H, Xue R. Universal accumulators with efficient nonmembership proofs. In Proc. Cryptography and Network Security (ACNS07), Lecture Notes in Computer Science, Vol. 4521, Zhuhai, China, Springer-Verlag, 2007, pp.253\u2013269."},{"key":"9119_CR14","doi-asserted-by":"crossref","unstructured":"Prabhakaran M, Xue R. Statistically Hiding Sets. Submitted to ICALP 2008, 2007.","DOI":"10.1007\/978-3-642-00862-7_7"},{"key":"9119_CR15","doi-asserted-by":"crossref","unstructured":"Camenisch J, Stadler M. Efficient group signature schemes for large groups. In Proc. Advances in Cryptology \u2014 CRYPTO\u201997, Santa Barbara, California, USA, 1997, pp.410\u2013424.","DOI":"10.1007\/BFb0052252"},{"key":"9119_CR16","doi-asserted-by":"crossref","unstructured":"Gennaro R, Halevi S, Rabin T. Secure hash-and-sign signatures without the random oracle. In Proc. Advances in Cryptology \u2014 EUROCRYPT\u201999, Prague, Czech Republic, 1999, pp.123\u2013139.","DOI":"10.1007\/3-540-48910-X_9"},{"key":"9119_CR17","doi-asserted-by":"crossref","unstructured":"Fujisaki E, Okamoto T. Statistical zero knowledge protocols to prove modular polynomial relations. In Proc. Advances in Cryptology \u2014 CRYPTO\u201997, Santa Barbara, California, Aug. 1997, pp.16\u201330.","DOI":"10.1007\/BFb0052225"},{"key":"9119_CR18","doi-asserted-by":"crossref","unstructured":"Cramer R, Shoup V. Signature schemes based on the strong RSA assumption. In Proc. the 6th ACM Conference on Computer and Communications Security (CCS), Singapore, Nov. 1999, pp.46\u201351.","DOI":"10.1145\/319709.319716"},{"issue":"1","key":"9119_CR19","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/357353.357357","volume":"1","author":"A Shamir","year":"1983","unstructured":"Shamir A. On the generation of cryptographically strong pseudorandom sequences. ACM Transactions on Computer Systems, 1983 1(1): 38.","journal-title":"ACM Transactions on Computer Systems"},{"key":"9119_CR20","doi-asserted-by":"crossref","unstructured":"Bellare M, Rogaway P. Random oracles are practical: A paradigm for designing efficient protocols. In Proc. ACM Conference on Computer and Communications Security, Alexandria, VA, USA, 1993, pp.62\u201373.","DOI":"10.1145\/168588.168596"},{"key":"9119_CR21","doi-asserted-by":"crossref","unstructured":"Fiat A, Shamir A. How to prove yourself: Practical solutions to identification and signature problems. In Proc. Advances in Cryptology \u2014 CRYPTO\u201986, Santa Barbara, California, USA, 1987, pp.186\u2013194.","DOI":"10.1007\/3-540-47721-7_12"},{"key":"9119_CR22","doi-asserted-by":"crossref","unstructured":"Santis A D, Micali S, Persiano G. Non-interactive zero-knowledge proof systems. In Proc. RYPTO\u201987, Pomerance C (ed.), Santa Barbara, California, United States, Lecture Notes in Computer Science, Springer-Verlag, 1988, Vol. 293, pp.52\u201372.","DOI":"10.1007\/3-540-48184-2_5"},{"key":"9119_CR23","doi-asserted-by":"crossref","unstructured":"Algesheimer J, Camenisch J, Shoup V. Efficient computation modulo a shared secret with application to the generation of shared safe-prime products. In Proc. Advances in Cryptology \u2014 CRYPTO\u201902, Santa Barbara, California, USA, 2002, pp.417\u2013432.","DOI":"10.1007\/3-540-45708-9_27"},{"key":"9119_CR24","doi-asserted-by":"crossref","unstructured":"Sander T. Efficient accumulators without trapdoor extended abstracts. In Proc. ICICS, Sydney, Australia, Varadharajan V, Mu Y (eds.), Lecture Notes in Computer Science, Vol. 1726, Springer, 1999, pp.252\u2013262.","DOI":"10.1007\/978-3-540-47942-0_21"},{"key":"9119_CR25","doi-asserted-by":"crossref","unstructured":"Chaum C, Evertse J H, van de Graaf J, Peralta R. Demonstrating possession of a discrete logarithm without revealing it. In Proc. Advances in Cryptology \u2014 CRYPTO\u201986, Santa Barbara, California, USA, 1987, pp.200\u2013212.","DOI":"10.1007\/3-540-47721-7_14"},{"key":"9119_CR26","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C P Schnorr","year":"1991","unstructured":"Schnorr C P. Efficient signature generation by smart cards, Journal of Cryptology, 1991, 4: 161\u2013174.","journal-title":"Journal of Cryptology"},{"issue":"2","key":"9119_CR27","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF02351717","volume":"1","author":"U Feige","year":"1988","unstructured":"Feige U, Fiat A, Shamir A. Zero knowledge proofs of identity. Journal of Cryptology, 1988, 1(2): 77\u201394.","journal-title":"Journal of Cryptology"},{"key":"9119_CR28","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1080\/03461238.1995.10413946","volume":"1","author":"A Granville","year":"1995","unstructured":"Granville A. Harold Cram\u00e9r and the distribution of prime numbers. Scandanavian Actuarial Journal, 1995, 1: 12\u201328.","journal-title":"Scandanavian Actuarial Journal"},{"key":"9119_CR29","doi-asserted-by":"crossref","unstructured":"Shoup V. Practical threshold signatures. In Proc. Advances in Cryptology \u2014 EUROCRYPT\u201900, Bruges, Belgium, 2000, pp.207\u2013220.","DOI":"10.1007\/3-540-45539-6_15"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-008-9119-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-008-9119-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-008-9119-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,29]],"date-time":"2025-01-29T16:31:58Z","timestamp":1738168318000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-008-9119-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,3]]}},"alternative-id":["9119"],"URL":"https:\/\/doi.org\/10.1007\/s11390-008-9119-x","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"type":"print","value":"1000-9000"},{"type":"electronic","value":"1860-4749"}],"subject":[],"published":{"date-parts":[[2008,3]]}}}