{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T04:27:30Z","timestamp":1778128050718,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540649519","type":"print"},{"value":"9783540539186","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055485","type":"book-chapter","created":{"date-parts":[[2006,7,27]],"date-time":"2006-07-27T09:10:06Z","timestamp":1153991406000},"page":"214-226","source":"Crossref","is-referenced-by-count":47,"title":["Publicly verifiable lotteries: Applications of delaying functions"],"prefix":"10.1007","author":[{"given":"David M.","family":"Goldschlag","sequence":"first","affiliation":[]},{"given":"Stuart G.","family":"Stubblebine","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,28]]},"reference":[{"key":"17_CR1","volume-title":"Design of practical and provably good random number generators","author":"W. Aiello","year":"1995","unstructured":"W. Aiello, S. Venkatesan, and R. Venkatesan. Design of practical and provably good random number generators. Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, NY, Jan. 1995."},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"M. Bellare, J. Garay, and T. Rabin. Distributed Pseudo-Random Bit Generators \u2014 A New Way to Speed-Up Shared Coin Tossing, PODC'96, ACM, 1996.","DOI":"10.1145\/248052.248090"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"T. Beth and Y. Desmedt. Identification tokens-or: solving the chess grandmaster problem. Advances in Cryptology \u2014 CRYPTO '90 Proceedings, pp. 169\u2013176.","DOI":"10.1007\/3-540-38424-3_12"},{"key":"17_CR4","unstructured":"M. Blum. Coin flipping by telephone-a protocol for solving impossible problems. Spring COMPCON 82, IEEE, 1982, pp. 133\u2013137."},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"A. Broder. A provably secure polynomial approximation scheme for the distributed lottery problem. Proceedings of the 4th Annual ACM Symposium on Principles of Distributed Computing, 1985, pp. 136\u2013148.","DOI":"10.1145\/323596.323608"},{"key":"17_CR6","volume-title":"technical report 97-10","author":"J. Y. Cai","year":"1997","unstructured":"J. Y. Cai, A. Nerurkar, M. Y. Wu. The Design of Uncheatable Benchmarks Using Complexity Theory, technical report 97-10, Department of Computer Science, SUNY Buffalo, 1997."},{"issue":"10","key":"17_CR7","doi-asserted-by":"crossref","first-page":"1030","DOI":"10.1145\/4372.4373","volume":"28","author":"D. Chaum","year":"1985","unstructured":"D. Chaum, \u201cSecurity without Identification: Transaction Systems to Make Big Brother Obsolete\u201d, CACM (28,10), October 1985, pp. 1030\u20131044.","journal-title":"CACM"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"C. Dwork, and M. Naor. Pricing via processing or combating junk mail. Weizmann Technical Report CS95-20, 1995 (Also preliminary version in CRYPTO '92, pp. 139\u2013147).","DOI":"10.1007\/3-540-48071-4_10"},{"key":"17_CR9","unstructured":"M. K. Franklin and D. Malkhi. Auditable Metering with Lightweight Security, Financial Cryptography 1997, LNCS Vol. 1318, Springer-Verlag, 1997."},{"key":"17_CR10","first-page":"68","volume-title":"The influence of variables on Boolean functions","author":"J. Kahn","year":"1988","unstructured":"J. Kahn, G. Kalai, and N. Linial. The influence of variables on Boolean functions. 29th Annual Symposium on Foundations of Computer Science, IEEE Washington, DC, USA, 1988, pp. 68\u201380."},{"issue":"No.1","key":"17_CR11","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1137\/S0895480194262795","volume":"8","author":"E. Kushilevitz","year":"1995","unstructured":"E. Kushilevitz, Y. Mansour, and M. Rabin, On Lotteries with Unique Winners, SIAM Journal on Discrete Mathematics, vol. 8, No. 1, pp. 93\u201398, February, 1995.","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"no.4","key":"17_CR12","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1145\/359460.359473","volume":"21","author":"R. Merkle","year":"1978","unstructured":"R. Merkle. Secure Communications Over Insecure Channels. Communications of the ACM, vol. 21, no. 4, April, 1978, pp. 284\u2013299.","journal-title":"Communications of the ACM"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"A. Menezes, P. van Oorschot, and S. Vanstone. Handbook of Applied Cryptography, CRC Press, 1997.","DOI":"10.1201\/9781439821916"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"R. Rivest. Electronic Lottery Tickets as Micropayments, Financial Cryptography 1997.","DOI":"10.1007\/3-540-63594-7_87"},{"key":"17_CR15","unstructured":"R. Rivest, A. Shamir, and D. Wagner. Time-lock puzzles and timed-release Crypto. Unpublished manuscript, February, 1996. See http:\/\/theory.lcs.mit.edu\/ ~rivest\/RivestShamirWagner-timelock.ps."},{"key":"17_CR16","unstructured":"S. Roman. Coding and Information Theory. Graduate texts in Mathematics number 134, Springer-Verlag, 1992."},{"key":"17_CR17","unstructured":"P. Syverson, S. Stubblebine, and D. Goldschlag. Unlinkable Serial Transactions, Financial Cryptography 1997, LNCS Vol. 1318, Springer-Verlag, 1997."},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"P. Syverson, D. Goldschlag, and M. Reed. Anonymous Connections and Onion Routing, Proceedings of the Symposium on Security and Privacy, Oakland, CA, May 1997.","DOI":"10.1109\/SECPRI.1997.601314"},{"key":"17_CR19","first-page":"523","volume":"218","author":"A. Webster","year":"1986.","unstructured":"A. Webster and S. Tavares. One the design of S-boxes, Advances in Cryptology \u2014 Crypto 85 (LNCS 218), pp. 523\u201334, 1986.","journal-title":"LNCS"},{"key":"17_CR20","unstructured":"P. R. Zimmerman. PGPfone Owner's Manual, Version 1.0 beta 7, July 8, 1996, p. 33."}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055485","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T08:34:54Z","timestamp":1555749294000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055485"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540649519","9783540539186"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/bfb0055485","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998]]}}}