Publicly verifiable lotteries: Applications of delaying functions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1465, Issue , 1998, Pages 214-226

  Goldschlag, David M ^a   Stubblebine, Stuart G ^b  

^a Divx   (United States)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CALCULATION TIME; DELAYING FUNCTIONS; ONE-PASS; PRICING FUNCTION; PUBLICLY VERIFIABLE; TIME-LOCK PUZZLES;

CRYPTOGRAPHY;

EID: 84958038323     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0055485     Document Type: Conference Paper

References (20)

1. 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.
2. M. Bellare, J. Garay, and T. Rabin. Distributed Pseudo-Random Bit Generators - A New Way to Speed-Up Shared Coin Tossing, PODC’96, ACM, 1996.
3. T. Beth and Y. Desmedt. Identification tokens-or: solving the chess grandmaster problem. Advances in Cryptology – CRYPTO ’90 Proceedings, pp. 169-176.
4. M. Blum. Coin flipping by telephone-a protocol for solving impossible problems. Spring COMPCON 82, IEEE, 1982, pp. 133-137.
5. 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-148.
6. 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.
7. D. Chaum, “Security without Identification: Transaction Systems to Make Big Brother Obsolete”, CACM (28,10), October 1985, pp. 1030-1044.
8. 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-147).
9. M. K. Franklin and D. Malkhi. Auditable Metering with Lightweight Security, Financial Cryptography 1997, LNCS Vol. 1318, Springer-Verlag, 1997.
10. 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-80.
11. E. Kushilevitz, Y. Mansour, and M. Rabin, On Lotteries with Unique Winners, SIAM Journal on Discrete Mathematics, vol. 8, No. 1, pp. 93-98, February, 1995.
12. R. Merkle. Secure Communications Over Insecure Channels. Communications of the ACM, vol. 21, no. 4, April, 1978, pp. 284-299.
13. A. Menezes, P. van Oorschot, and S. Vanstone. Handbook of Applied Cryptography, CRC Press, 1997.
14. R. Rivest. Electronic Lottery Tickets as Micropayments, Financial Cryptography 1997.
15. 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.
16. S. Roman. Coding and Information Theory. Graduate texts in Mathematics number 134, Springer-Verlag, 1992.
17. P. Syverson, S. Stubblebine, and D. Goldschlag. Unlinkable Serial Transactions, Financial Cryptography 1997, LNCS Vol. 1318, Springer-Verlag, 1997.
18. P. Syverson, D. Goldschlag, and M. Reed. Anonymous Connections and Onion Routing, Proceedings of the Symposium on Security and Privacy, Oakland, CA, May 1997.
19. A. Webster and S. Tavares. One the design of S-boxes, Advances in Cryptology - Crypto 85 (LNCS 218), pp. 523-534, 1986.
20. P. R. Zimmerman. PGPfone Owner’s Manual, Version 1.0 beta 7, July 8, 1996, p. 33.