• Publications
  • Influence
A Practical Voter-Verifiable Election Scheme
TLDR
We present an election scheme designed to allow voters to verify that their vote is accurately included in the count. Expand
  • 378
  • 42
  • PDF
A Brief History of Timed CSP
TLDR
A comprehensive introduction to the language of Timed CSP, proposed by Reed and Roscoe (1986). Expand
  • 200
  • 29
  • PDF
PrÊt À Voter: a Voter-Verifiable Voting System
TLDR
This paper presents the key elements of the approach and describes the evolution of the design and their suitability in various contexts. Expand
  • 172
  • 19
Verifying Authentication Protocols in CSP
  • S. Schneider
  • Computer Science
  • IEEE Trans. Software Eng.
  • 1 September 1998
TLDR
This paper presents a general approach for analysis and verification of authentication properties using the theory of Communicating Sequential Processes, built on top of the general CSP semantic framework. Expand
  • 251
  • 18
  • PDF
CSP and Anonymity
TLDR
This paper proposes a formal definition of anonymity within the CSP notation, discusses the approach taken by CSP to anonymity with respect to different viewpoints, and illustrates this approach on some toy examples, and applies it to a machine-assisted analysis of the dining cryptographers example and some variants. Expand
  • 231
  • 16
  • PDF
Formal analysis of a non-repudiation protocol
  • S. Schneider
  • Computer Science
  • Proceedings. 11th IEEE Computer Security…
  • 9 June 1998
TLDR
The paper applies the theory of communicating sequential processes (CSP) to the modelling and analysis of a non-repudiation protocol proposed by Zhou and Gollmann (1996). Expand
  • 127
  • 16
  • PDF
An Operational Semantics for Timed CSP
TLDR
An operational semantics is defined for the language of timed CSP, in terms of two relations: an evolution relation, which describes when a process becomes another simply by allowing time to pass; and a timed transition relation,which describes when the process may become another by performing an action at a particular time. Expand
  • 178
  • 15
  • PDF
Security properties and CSP
  • S. Schneider
  • Computer Science
  • Proceedings IEEE Symposium on Security and…
  • 6 May 1996
TLDR
This paper explores ways in which security properties such as confidentiality and authenticity may be described as CSP specifications, how security mechanisms may be captured, and how particular protocols designed to provide these properties may be analysed within the CSP framework. Expand
  • 276
  • 13
  • PDF
How to prevent type flaw attacks on security protocols
TLDR
A type flaw attack on a security protocol is an attack where a field that was originally intended to have one type is subsequently interpreted as having another type. Expand
  • 200
  • 13
  • PDF
Prêt à Voter with Re-encryption Mixes
TLDR
We present a number of enhancements to the voter verifiable election scheme Pret a Voter [CRS05]. Expand
  • 153
  • 13
  • PDF