Stochastic Simulation Methods Applied to a Secure Electronic Voting Model

Electronic Notes in Theoretical Computer Science

Volumn 151, Issue 3, 2006, Pages 5-25

  Bradley, Jeremy T ^a   Gilmore, Stephen T ^b  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

course of values times series; PEPA; secure electronic voting; Stochastic process algebra

Indexed keywords

ALGEBRA; COMPUTER SIMULATION; MATHEMATICAL MODELS; STATE SPACE METHODS; VOTING MACHINES;

COURSE-OF-VALUES TIMES SERIES; PEPA; SECURE ELECTRONIC VOTING; STOCHASTIC PROCESS ALGEBRA;

RANDOM PROCESSES;

EID: 33744998873     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2006.03.009     Document Type: Article

References (32)

1. Zetter K. How e-voting threatens democracy. Wired Magazine article (Mar. 2004). http://www.wired.com/news/evote/0,2645,62790,00.html
2. Machine politics. Wired Magazine feature on electronic voting (Apr. 2005). http://www.wired.com/news/evote/
3. Paulson L.C. The inductive approach to verifying cryptographic protocols. J. Computer Security 6 (1998) 85-128
4. Lowe G. Breaking and fixing the Needham-Schroeder public-key protocol using FDR. Software-Concepts and Tools 17 3 (1996) 93-102
5. C. Bodei, M. Buchholtz, P. Degano, F. Nielson, and H.R. Nielson, "Control flow analysis can find new flaws too," in Proceedings of Workshop on Issues in the Theory of Security (WITS 04), (Barcelona, Spain), Apr. 2004
6. N. Thomas, "Performability of a secure electronic voting algorithm," in Proceedings of the first workshop on Practical Applications of Stochastic Modelling (PASM 2004) (J. Bradley and W. Knottenbelt, eds.), (London, England), pp. 81-93, Sept. 2004. To appear in ENTCS
7. Hillston J. A Compositional Approach to Performance Modelling (1996), Cambridge University Press
8. Gilmore S., Hillston J., and Ribaudo M. An efficient algorithm for aggregating PEPA models. IEEE Transactions on Software Engineering 27 (May 2001) 449-464
9. Kwiatkowska M., Norman G., and Parker D. PRISM: Probabilistic symbolic model checker. In: Field T., Harrison P., Bradley J., and Harder U. (Eds). Proceedings of the 12th International Conference on Modelling Techniques and Tools for Computer Performance Evaluation. LNCS vol. 2324 (2002), Springer, London 200-204
10. Gillespie D. A general method for numerically simulating the stochastic time evolution of coupled chemical species. J. Comp. Phys. 22 (1976) 403-434
11. Gibson M., and Bruck J. Efficient exact stochastic simulation of chemical systems with many species and many channels. J. Comp. Phys. 104 (2000) 1876-1889
12. Priami C., Regev A., Silverman W., and Shapiro E. Application of a stochastic name passing calculus to representation and simulation of molecular processes. Information Processing Letters 80 (2001) 25-31
13. A. Phillips and L. Cardelli, "A correct abstract machine for the stochastic pi-calculus," in Proceedings of BioConcur 2004, 2004. To appear in Transactions on Computational Systems Biology
14. Clark G., Gilmore S., Hillston J., and Thomas N. Experiences with the PEPA performance modelling tools. IEE Proceedings-Software 146 (Feb. 1999) 11-19 Special issue of papers from the Fourteenth UK Performance Engineering Workshop
15. F. Stathopoulos, "Enhancing the PEPA Workbench with simulation and experimentation facilities," Master's thesis, School of Computer Science, The University of Edinburgh, Sept. 2001
16. G. Clark and W. Sanders, "Implementing a stochastic process algebra within the Möbius modeling framework," in de Alfaro and Gilmore [32], pp. 200-215
17. K. Powell, "Rapid prototyping of high-performance concurrent Java applications," Master's thesis, School of Computer Science, The University of Edinburgh, Sept. 2002
18. R. McNab and F. Howell, "Using Java for Discrete Event Simulation," in Proceedings of the Twelfth UK Computer and Telecommunications Performance Engineering Workshop (UKPEW) (R. Pooley and J. Hillston, eds.), (The University of Edinburgh), pp. 219-228, 1996
19. G. Clark, Techniques for the Construction and Analysis of Algebraic Performance Models. PhD thesis, The University of Edinburgh, 2000
20. Benoit A., Cole M., Gilmore S., and Hillston J. Enhancing the effective utilisation of Grid clusters by exploiting on-line performability analysis. In: Jarvis S., and Thomas N. (Eds). Proceedings of the First International Workshop on Grid Performability (May 2005), IEEE Computer Society Press
21. Gilmore S., and Hillston J. The PEPA Workbench: A Tool to Support a Process Algebra-based Approach to Performance Modelling. Proceedings of the Seventh International Conference on Modelling Techniques and Tools for Computer Performance Evaluation. Lecture Notes in Computer Science no. 794 (May 1994), Springer-Verlag, Vienna 353-368
22. Bradley J., Dingle N., Gilmore S., and Knottenbelt W. Derivation of passage-time densities in PEPA models using IPC: The Imperial PEPA Compiler. In: Kotsis G. (Ed). Proceedings of the 11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems (Oct. 2003), IEEE Computer Society Press, University of Central Florida 344-351
23. Bradley J.T., Gilmore S.T., and Thomas N. How synchronisation strategy approximation in PEPA implementations affects passage time performance results. In: Núñez M., et al. (Ed). Applying Formal Methods: Testing, Performance, and M/E-Commerce. (EPEW 2004). LNCS vol. 3236 (Oct. 2004), Springer-Verlag 128-142
24. Ramsey S., Orrell D., and Bolouri H. Dizzy: stochastic simulation of large-scale genetic regulatory networks. J. Bioinf. Comp. Biol. 3 2 (2005) 415-436
25. N. Thomas and J. Bradley, "Terminating processes in PEPA," in Proceedings of the Seventeenth UK Performance Engineering Workshop (K. Djemame and M. Kara, eds.), (University of Leeds), pp. 143-154, July 2001
26. Fujioka A., Okamoto T., and Ohta K. A practical secret voting scheme for large scale elections. ASIACRYPT '92: Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques (1993), Springer-Verlag, London, UK 244-251
27. Gilmore S., Hillston J., Ribaudo M., and Kloul L. PEPA nets: A structured performance modelling formalism. Performance Evaluation 54 (Oct. 2003) 79-104
28. Argent-Katwala A., Bradley J., and Dingle N. Expressing performance requirements using regular expressions to specify stochastic probes over process algebra models. Proceedings of the Fourth International Workshop on Software and Performance. (Redwood Shores, California, USA) (Jan. 2004), ACM Press 49-58
29. J. Hillston and L. Kloul, "An efficient Kronecker representation for PEPA models," in de Alfaro and Gilmore [32], pp. 120-135
30. Hucka M., Finney A., Sauro H.M., Bolouri H., Doyle J.C., Kitano H., et al. The systems biology markup language (SBML): a medium for representation and exchange of biochemical network models. Bioinformatics 19 4 (2003)
31. Canevet C., Gilmore S., Hillston J., Prowse M., and Stevens P. Performance modelling with UML and stochastic process algebras. IEE Proceedings: Computers and Digital Techniques 150 (Mar. 2003) 107-120
32. In: de Alfaro L., and Gilmore S. (Eds). Proceedings of the first joint PAPM-PROBMIV Workshop. Lecture Notes in Computer Science vol. 2165 (Sept. 2001), Springer-Verlag, Aachen, Germany