{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:59:38Z","timestamp":1743011978192,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540442707"},{"type":"electronic","value":"9783540458111"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45811-5_34","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T05:43:51Z","timestamp":1192772631000},"page":"437-445","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Oblivious Counter and Majority Protocol"],"prefix":"10.1007","author":[{"given":"Hiroaki","family":"Kikuchi","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,9,5]]},"reference":[{"key":"34_CR1","unstructured":"M. Abe, \u201cUniversally Verifiable Mix-Net with Verification Work Independent of the Number of Mix-Servers,\u201d IEICE Trans. Fundamentals, Vol. E83-A, No.7, July 2000."},{"key":"34_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1007\/3-540-44448-3_13","volume-title":"Mix and Match: Secure Function Evaluation via Ciphertexts","author":"M. Jakobsson","year":"2000","unstructured":"M. Jakobsson and A. Juels, \u201cMix and Match: Secure Function Evaluation via Ciphertexts,\u201d Proc. of ASIACRYPTO 2000, LNCS 1967, pp. 162\u2013177, 2000."},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"T. P. Pedersen, \u201cA threshold cryptosystem without a trusted party,\u201d EUROCRYPTO\u201991, pp. 522\u2013526, 1991.","DOI":"10.1007\/3-540-46416-6_47"},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"R. Cramer, I. Damgard, and B. Schoenmakers, \u201cProofs of partial knowledge and simplified design of witness hiding protocols,\u201d CRYPTO\u201994, pp. 174\u2013187, 1994.","DOI":"10.1007\/3-540-48658-5_19"},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"J. Camenisch and M. Michels, \u201cProving in Zero-Knowledge that a Number Is the Product of Two Safe Primes,\u201d EUROCRYPT\u201999, pp. 107\u2013122, 1999.","DOI":"10.1007\/3-540-48910-X_8"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"J. Katz, S. Myers and R. Ostrovsky, \u201cCryptographic Counters and Applications to Electronic Voting,\u201d EUROCRYPT 2001, 2001.","DOI":"10.1007\/3-540-44987-6_6"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"R. Cramer, R. Gennaro and B. Schoenmakers, \u201cA Secure and Optimally Efficient Multi-Authority Election Scheme,\u201d EUROCRYPT 1997.","DOI":"10.1007\/3-540-69053-0_9"},{"key":"34_CR8","unstructured":"S. Goldwasser and S. Micali and A. Wigderson, \u201cHow to Play Any Mental Game, or a Completeness Theorem for Protocols with an Honest Majority,\u201d STOCr'87, 1987."}],"container-title":["Lecture Notes in Computer Science","Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45811-5_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,27]],"date-time":"2020-01-27T18:02:52Z","timestamp":1580148172000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45811-5_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540442707","9783540458111"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-45811-5_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"5 September 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}