{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T17:06:42Z","timestamp":1773767202367,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540576006","type":"print"},{"value":"9783540482857","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-48285-7_24","type":"book-chapter","created":{"date-parts":[[2007,7,31]],"date-time":"2007-07-31T22:16:46Z","timestamp":1185920206000},"page":"274-285","source":"Crossref","is-referenced-by-count":290,"title":["One-Way Accumulators: A Decentralized Alternative to Digital Signatures"],"prefix":"10.1007","author":[{"given":"Josh","family":"Benaloh","sequence":"first","affiliation":[]},{"given":"Michael","family":"de Mare","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,13]]},"reference":[{"key":"24_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/3-540-46766-1_34","volume-title":"Advances in Cryptology \u2014 Crypto\u2019 91","author":"D. Beaver","year":"1992","unstructured":"Beaver, D. \u201cEfficient Multiparty Protocols Using Circuit Randomization.\u201d Advances in Cryptology \u2014 Crypto\u2019 91, ed. by J. Feigenbaum in Lecture Notes in Computer Science, vol. 576, ed. by G. Goos and J. Hartmanis. Springer-Verlag, New York (1992), 420\u2013432."},{"key":"24_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1007\/0-387-34805-0_49","volume-title":"Advances in Cryptology \u2014 Crypto\u2019 89","author":"D. Beaver","year":"1990","unstructured":"Beaver, D. \u201cMultiparty Protocols Tolerating Half Faulty Processors.\u201d Advances in Cryptology \u2014 Crypto\u2019 89, ed. by G. Brassard in Lecture Notes in Computer Science, vol. 435, ed. by G. Goos and J. Hartmanis. Springer-Verlag, New York (1990), 560\u2013572."},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Beaver, D. and Goldwasser, S. \u201cMultiparty Computation with Faulty Majority.\u201d Proc. 30thIEEE Symp. on Foundations of Computer Science, Research Triangle Park, NC (Oct.\u2013Nov. 1989), 468\u2013473.","DOI":"10.1109\/SFCS.1989.63520"},{"key":"24_CR4","unstructured":"Benaloh, J. and de Mare, M. \u201cEfficient Broadcast Time-Stamping.\u201d Clarkson University Department of Mathematics and Computer Science TR 91-1. (Aug. 1991)."},{"key":"24_CR5","unstructured":"Ben-Or, M. \u201cAnother Advantage of Free Choice: Completely Asynchronous Agreement Protocols.\u201d Proc. 2ndACM Symp. on Principles of Distributed Computing, Montreal, PQ (Aug. 1983), 27\u201330."},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., and Wigderson, A. \u201cCompleteness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation.\u201d Proc. 20stACM Symp. on Theory of Computation, Chicago, IL (May 1988), 1\u201310.","DOI":"10.1145\/62212.62213"},{"key":"24_CR7","first-page":"25","volume":"15","author":"N. Bruijn de","year":"1951","unstructured":"de Bruijn, N. \u201cThe Asymptotic Behaviour of a Function Occurring in the Theory of Primes.\u201d Journal of the Indian Mathematical Society 15. (1951), 25\u201332.","journal-title":"Journal of the Indian Mathematical Society"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., and Damg\u00e5rd, I. \u201cMultiparty Unconditionally Secure Protocols.\u201d Proc. 20stACM Symp. on Theory of Computation, Chicago, IL (May 1988), 11\u201319.","DOI":"10.1145\/62212.62214"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldwasser, S., Micali, S., and Awerbuch, B. \u201cVerifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults.\u201d Proc. 26thIEEE Symp. on Foundations of Computer Science, Portland, OR (Oct. 1985), 383\u2013395.","DOI":"10.1109\/SFCS.1985.64"},{"key":"24_CR10","volume-title":"Cryptography and Data Security","author":"D. Denning","year":"1982","unstructured":"Denning, D. Cryptography and Data Security, Addison-Wesley, Reading, Massachusetts (1982)."},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Fischer, M. \u201cThe Consensus Problem in Unreliable Distributed Systems\u201d, Proc. 1983 International FCT-Conference, Borgholm, Sweeden (Aug. 1983), 127\u2013140. Published as Foundations of Computation Theory, ed. by M. Karpinski in Lecture Notes in Computer Science, vol. 158, ed. by G. Goos and J. Hartmanis. Springer-Verlag, New York (1983).","DOI":"10.1007\/3-540-12689-9_99"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., and Wigderson, A \u201cProofs that Yield Nothing but Their Validity and a Methodology of Cryptographic Protocol Design.\u201d Proc. 27thIEEE Symp. on Foundations of Computer Science, Toronto, ON (Oct. 1986), 174\u2013187.","DOI":"10.1109\/SFCS.1986.47"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., and Wigderson, A \u201cHow to Play Any Mental Game or A Completeness Theorem for Protocols with Honest Majority.\u201d Proc. 19stACM Symp. on Theory of Computation, New York, NY (May 1987), 218\u2013229.","DOI":"10.1145\/28395.28420"},{"key":"24_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/3-540-38424-3_6","volume-title":"Advances in Cryptology \u2014 Crypto\u2019 90","author":"S. Goldwasser","year":"1991","unstructured":"Goldwasser, S. and Levin, L. \u201cFair Computation of General Functions in Presence of Immoral Majority.\u201d Advances in Cryptology \u2014 Crypto\u2019 90, ed. by A. Menezes and S. Vanstone in Lecture Notes in Computer Science, vol. 537, ed. by G. Goos and J. Hartmanis. Springer-Verlag, New York (1991), 77\u201393."},{"key":"24_CR15","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/BF00196791","volume":"3","author":"S. Haber","year":"1991","unstructured":"Haber, S. and Stornetta, W. \u201cHow to Time-Stamp a Digital Document.\u201d Journal of Cryptology 3. (1991), 99\u2013112.","journal-title":"Journal of Cryptology"},{"key":"24_CR16","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0304-3975(76)90050-5","volume":"3","author":"D. Knuth","year":"1976","unstructured":"Knuth, D. and Trabb Pardo, L. \u201cAnalysis of a Simple Factorization Algorithm.\u201d Theoretical Computer Science 3. (1976), 321\u2013348.","journal-title":"Theoretical Computer Science"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Levin, L., and Luby, M. \u201cPseudorandom Generation from One-Way Functions.\u201d Proc. 21stACM Symp. on Theory of Computation, Seattle, WA (May 1989), 12\u201324.","DOI":"10.1145\/73007.73009"},{"key":"24_CR18","doi-asserted-by":"publisher","first-page":"417","DOI":"10.2307\/2004437","volume":"23","author":"J. Lune van de","year":"1969","unstructured":"van de Lune, J. and Wattel, E. \u201cOn the Numerical Solution of a Differential-Difference Equation Arising in Analytic Number Theory.\u201d Mathematics of Computation 23. (1969), 417\u2013421.","journal-title":"Mathematics of Computation"},{"key":"24_CR19","unstructured":"Merkle, R. \u201cProtocols for Public Key Cryptosystems.\u201d Proc. 1980 Symp. on Security and Privacy, IEEE Computer Society (April 1980), 122\u2013133."},{"key":"24_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/3-540-38424-3_18","volume-title":"Advances in Cryptology \u2014 Crypto\u2019 90","author":"T. Micali","year":"1991","unstructured":"Micali, T. and Rabin, T. \u201cCollective Coin Tossing Without Assumptions nor Broadcasting.\u201d Advances in Cryptology \u2014 Crypto\u2019 90, ed. by A. Menezes and S. Vanstone in Lecture Notes in Computer Science, vol. 537, ed. by G. Goos and J. Hartmanis. Springer-Verlag, New York (1991), 253\u2013266."},{"key":"24_CR21","doi-asserted-by":"publisher","first-page":"411","DOI":"10.2307\/2004669","volume":"22","author":"W. Mitchell","year":"1968","unstructured":"Mitchell, W. \u201cAn Evaluation of Golomb\u2019s Constant.\u201d Mathematics of Computation 22. (1968), 411\u2013415.","journal-title":"Mathematics of Computation"},{"key":"24_CR22","doi-asserted-by":"crossref","unstructured":"Naor, M. and Yung, M. \u201cUniversal One-Way Hash Functions and their Cryptographic Applications.\u201d Proc. 21stACM Symp. on Theory of Computation, Seattle, WA (May 1989), 33\u201343.","DOI":"10.1145\/73007.73011"},{"key":"24_CR23","doi-asserted-by":"crossref","unstructured":"Rabin, T. and Ben-Or, M. \u201cVerifiable Secret Sharing and Multiparty Protocols with Honest Majority.\u201d Proc. 21stACM Symp. on Theory of Computation, Seattle, WA (May 1989), 73\u201385.","DOI":"10.1145\/73007.73014"},{"key":"24_CR24","doi-asserted-by":"crossref","unstructured":"Rabin, M. \u201cRandomized Byzantine Generals.\u201d Proc. 24thIEEE Symp. on Foundations of Computer Science, Tucson, AZ (Nov. 1983), 403\u2013409.","DOI":"10.1109\/SFCS.1983.48"},{"key":"24_CR25","doi-asserted-by":"crossref","unstructured":"Rompel, J. \u201cOne-Way Functions are Necessary and Sufficient for Secure Signatures.\u201d Proc. 22ndACM Symp. on Theory of Computation, Baltimore, MD (May 1990).","DOI":"10.1145\/100216.100269"},{"issue":"2","key":"24_CR26","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"Rivest, R., Shamir, A., and Adleman, L. \u201cA Method for Obtaining Digital Signatures and Public-key Cryptosystems.\u201d Comm. ACM 21,2 (Feb. 1978), 120\u2013126.","journal-title":"Comm. ACM"},{"key":"24_CR27","doi-asserted-by":"crossref","unstructured":"Shamir, A. \u201cOn the Generation of Cryptographically Strong Pseudo-Random Sequences.\u201d Proc. ICALP, (1981).","DOI":"10.1007\/3-540-10843-2_43"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT \u201993"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48285-7_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T12:31:04Z","timestamp":1556713864000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48285-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540576006","9783540482857"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-48285-7_24","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1994]]}}}