On the use of financial data as a random beacon

EVT/WOTE 2010 - 2010 Electronic Voting Technology Workshop/Workshop on Trustworthy Elections

Volumn , Issue , 2010, Pages

  Clark, Jeremy ^a   Hengartner, Urs ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMMERCE; CRYPTOGRAPHY; ENTROPY; FINANCIAL MARKETS; RANDOM PROCESSES; VOTING MACHINES;

COMPUTATIONAL FINANCE; DOW JONES INDUSTRIAL AVERAGES; ELECTION INTEGRITIES; ELECTION VERIFICATIONS; FINANCIAL DATA; MARKET FLUCTUATIONS; PSEUDORANDOM GENERATORS; RANDOM AUDITS;

ELECTRONIC VOTING;

EID: 84865824936     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (40)

1. B. Adida. Helios: web-based open-audit voting. USENIX Security Symposium 2008.
2. B. Adida, O. de Marneffe, O. Pereira, and J.J. Quisquater. Election a university president using open-audit voting. EVT 2009.
3. R.K. Aggarwal and G. Wu. Stock market manipulation-theory and evidence. Journal of Business, 79(4) 2003.
4. R.J. Anderson and E. Biham. Two Practical and Provably Secure Block Ciphers: BEARS and LION. FSE 1996.
5. L. Babai. Trading group theory for randomness. STOC 1985.
6. B. Barak and S. Halevi. A model and architecture for pseudorandom generation and applications to /dev/random. CCS 2005.
7. F. Black and M. Scholes. The pricing of options and corporate liabilities. Journal of Political Economy, 81(3), 1973.
8. M. Blum, P. Feldman, and S. Micali. Non-interactive zero-knowledge and its applications. STOC 1988.
9. D. Boneh and M. Franklin. Identity-based encryption from the Weil pairing. CRYPTO 2005.
10. R. Canetti, R. Pass and a. shelat. Cryptography from Sunspots: How to Use an Imperfect Reference String. FOCS 2007.
11. D. Chaum, R. Carback, J. Clark, A. Essex, S. Popoveniuc, R. L. Rivest, P. Y. A. Ryan, E. Shen, and A. T. Sherman. Scantegrity II: end-to-end verifiability for optical scan election systems using invisible ink confirmation codes. EVT 2008.
12. J. Clark, A. Essex, and C. Adams. Secure and observable auditing of electronic voting systems using stock indices. IEEE CCECE 2007.
13. J. Calandrino, J.A. Halderman, and E.W. Felten. In defense of pseudorandom sample selection. EVT 2008.
14. J. Camenisch, S. Hohenberger, M. Kohlweiss, A. Lysyanskaya, and M. Meyerovich. How to win the clone wars: efficient periodic n-times anonymous authentication. CCS 2006.
15. M. Chesney, M. Jeanblanc-Picque, and M. Yor. Brownian excursions and Parisian barrier options. Advances in Applied Probability, 29, 1997.
16. A. Cordero, D. Wagner, and D. Dill. The role of dice in election audits. WOTE 2006.
17. Y. Dodis, R. Gennaro, J. Hastad, H. Krawczyk, and T. Rabin. Randomness extraction and key derivation using the CBC, Cascade and HMAC modes. CRYPTO 2004.
18. Y. Dodis and A. Yampolskiy. A verifiable random function with short proofs and keys. PKC 2005.
19. D. Eastlake. Publicly Verifiable Nomcom Random Selection. RFC 2777, IETF, 2000. http://www.ietf.org/rfc/rfc2777.txt
20. D. Eastlake. Publicly Verifiable Nominations Committee (Nom-Com) Random Selection. RFC 3797, IETF, 2004. http://www.ietf.org/rfc/rfc3797.txt
21. A. Essex, J. Clark, R. T. Carback, and S. Popoveniuc. Punchscan in practice: an E2E election case study. WOTE 2007.
22. S. Even, O. Goldreich, and A. Lempel. A randomized protocol for signing contracts. CACM, 28(6), 1985.
23. R.R. Farashahi, R. Pellikaan, and A. Sidorenko. Extractors for binary elliptic curves. Designs, Codes, and Cryptography, 49, 2008.
24. A. Fiat, and A. Shamir. How to prove yourself: practical solutions to identification and signature problems. CRYPTO 1986.
25. S. Goldwasser and Y. Kalai. On the (in)security of the Fiat-Shamir paradigm. FOCS 2003.
26. S. Goldwasser and M. Sipser. Private coins versus public coins in interactive proof systems. STOC 1986.
27. J. Groth and A. Sahai. Efficient non-interactive proof systems for bilinear groups. EUROCRYPT 2008.
28. A. Halderman and B. Waters. Harvesting verifiable challenges from oblivious online sources. CCS 2007.
29. J.L. Hall. On improving the uniformity of randomness with Alameda County's random selection process. 2008.
30. D. Jefferson, E. Ginnold, K. Midstokke, K. Alexander, P. Stark, and A. Lehmkuhl (State of California's Post-Election Audit Standards Working Group). Evaluation of Audit Sampling Models and Options for Strengthening Californias Manual Count. Report, 2007.
31. A. Juels, M Jakobsson, E. Shriver, and B. Hillyer. How to Turn Loaded Dice into Fair Coins. IEEE Transactions on Information Theory, 46(3), 2000.
32. R. Merton. Theory of rational option pricing. Journal of Economics and Management Sciences, 4(1), 1973.
33. G. Miller. Note on the bias of information estimates. “Information Theory in Psychology II-B.” Free Press, 1955.
34. L. Paninski. Estimation of entropy and mutual information. Neural Computation, 15, 2003.
35. M. Rabin. Transaction protection by beacons. Journal of Computer and System Sciences, 27(2), 1983.
36. E. Rescorla. On the security of election audits with low entropy randomness. EVT 2009.
37. M. Schroder. Brownian excursions and Parisian barrier options: a note. Advances in Applied Probability, 40(4), 2003.
38. R.U. Seydel. “Tools for computational finance.” Springer, 4th ed, 2009.
39. B. Waters, A. Juels, J. A. Halderman, and E. W. Felten. New client puzzle outsourcing techniques for DOS resistance. CCS 2004.
40. S. Wolfram. “A New Kind of Science.” Wolfram Media, 1st ed, 2001.