Steve Schneider
Researcher
Steve Schneider 's AcademicInfluence.com Rankings
Computer Science
#647
Historical Rank
Artificial Intelligence
#288
Historical Rank
Machine Learning
#533
Historical Rank
Database
#1548
Historical Rank
Why Is Steve Schneider Influential?
(Suggest an Edit or Addition)According to Wikipedia, Steve Schneider FBCS, CITP is an English computer scientist and Professor of Security. He is Director of the Surrey Centre for Cyber Security and Associate Dean at the University of Surrey. Biography Steve Schneider studied at Oxford University, joining the Oxford University Computing Laboratory to study for a Doctorate on CSP, which was awarded in 1989, supervised by Mike Reed. He joined Royal Holloway, University of London as a lecturer in 1994, becoming a senior lecturer in 1999 and a professor in 2002. He moved to the University of Surrey in 2004, and was head of the Department of Computer Science from 2004 until 2010.
Steve Schneider 's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Papers
- Concurrent and Real-time Systems: The CSP Approach (1999) (504)
- A Practical Voter-Verifiable Election Scheme (2005) (399)
- Verifying authentication protocols with CSP (1997) (331)
- The modelling and analysis of security protocols: the csp approach (2000) (313)
- Security properties and CSP (1996) (272)
- How to prevent type flaw attacks on security protocols (2000) (243)
- Process algebra and non-interference (1999) (239)
- CSP and Anonymity (1996) (233)
- A Brief History of Timed CSP (1995) (207)
- PrÊt À Voter: a Voter-Verifiable Voting System (2009) (197)
- An Operational Semantics for Timed CSP (1995) (183)
- Prêt à Voter with Re-encryption Mixes (2006) (161)
- Formal analysis of a non-repudiation protocol (1998) (130)
- An Attack on a Recursive Authentication Protocol. A Cautionary Tale (1998) (118)
- Timed CSP: Theory and Practice (1991) (100)
- Using a Process Algebra to Control B Operations (1999) (99)
- CSP theorems for communicating B machines (2005) (97)
- Analysing Time Dependent Security Properties in CSP Using PVS (2000) (87)
- Using a PVS Embedding of CSP to Verify Authentication Protocols (1997) (86)
- Communicating B Machines (2002) (85)
- ZB 2005: Formal Specification and Development in Z and B, 4th International Conference of B and Z Users, Guildford, UK, April 13-15, 2005, Proceedings (2005) (74)
- A Peered Bulletin Board for Robust Use in Verifiable Voting Systems (2014) (66)
- vVote: A Verifiable Voting System (2014) (62)
- Integrating and Extending JCSP (58)
- Towards automatic verification of authentication protocols on an unbounded network (2000) (49)
- Using Prêt à Voter in Victoria State Elections (2012) (46)
- How to Drive a B Machine (2000) (46)
- Modelling and analysis of security protocols (2001) (45)
- Techniques for modelling and verifying railway interlockings (2014) (42)
- Analysis, Improvement, and Simplification of Prêt à Voter with Paillier Encryption (2008) (40)
- Verifying Security Protocols: An Application of CSP (2004) (37)
- PyCSP-Communicating Sequential Processes for Python (2007) (37)
- Defining and Model Checking Abstractions of Complex Railway Models Using CSP||B (2012) (37)
- Fixed Points Without Completeness (1995) (34)
- A CSP Approach to Control in Event-B (2010) (33)
- The Prêt à Voter Verifiable Election System (2009) (32)
- Privacy-enhanced capabilities for VANETs using direct anonymous attestation (2017) (31)
- A decision procedure for the existence of a rank function (2005) (30)
- End-to-End Verifiability in Voting Systems, from Theory to Practice (2015) (29)
- Using CSP for protocol analysis: the Needham-Schroeder Public-Key Protocol (1996) (28)
- Timed CSP: A Retrospective (2006) (28)
- A Supervised Verifiable Voting Protocol for the Victorian Electoral Commission (2012) (27)
- The behavioural semantics of Event-B refinement (2014) (26)
- Timewise Refinement for Communicating Processes (1993) (26)
- A Comparison of Additivity Axioms in Timed Transition Systems. (1993) (25)
- Pret a Voter: All-in-one (2007) (25)
- Formal Analysis of V2X Revocation Protocols (2017) (25)
- Versatile Prêt à Voter: Handling Multiple Election Methods with a Unified Interface (2010) (24)
- Verification of Scheme Plans Using CSP $$||$$ | | B (2013) (23)
- Focus group views on Prêt à Voter 1.0 (2011) (23)
- Test Case Preparation Using a Prototype (1998) (23)
- Formal Verification of Tokeneer Behaviours Modelled in fUML Using CSP (2010) (23)
- On modelling and verifying railway interlockings: Tracking train lengths (2014) (22)
- A layered behavioural model of platelets (2006) (22)
- Real-time CSP (1994) (22)
- Verifying Controlled Components (2004) (22)
- CSP, PVS and a Recursive Authentication Protocol (1997) (22)
- Factorizing Proofs in Timed CSP (1990) (22)
- Composing Specifications Using Communication (2003) (21)
- Verifying security protocols with PVS: widening the rank function approach (2005) (20)
- Temporal rank functions for forward secrecy (2005) (20)
- Formal Aspects of Security (2003) (19)
- Chunks: Component Verification in CSP||B (2005) (19)
- Verifying anonymity in voting systems using CSP (2012) (19)
- Equal To The Task? (2002) (18)
- Automatic Generation of CSP || B Skeletons from xUML Models (2008) (18)
- Specification and Verification in Timed CSP (1996) (17)
- OnTrack: An Open Tooling Environment for Railway Verification (2013) (16)
- vVote: Verifiable Electronic Voting in Practice (2016) (16)
- Combining event-based and state-based modelling for railway verification (2012) (16)
- Verifying Authentication Protocol Implementations (2002) (15)
- An integrated framework for checking the behaviour of fUML models using CSP (2013) (15)
- Secure and Verifiable Electronic Voting in Practice: the use of vVote in the Victorian State Election (2015) (15)
- A Process-Oriented Architecture for Complex System Modelling (15)
- Abstraction and Testing (1999) (15)
- A CSP Account of Event-B Refinement (2011) (14)
- Modelling security properties with CSP (1996) (14)
- Design and Verification of Distributed Recovery Blocks with CSP (2003) (14)
- The use of B to specify, design and verify hardware (2001) (13)
- A Symbolic Analysis of ECC-Based Direct Anonymous Attestation (2019) (13)
- Foundations for using linear temporal logic in Event-B refinement (2016) (13)
- CSP and timewise refinement (1991) (13)
- Using CSP to Verify a Timed Protocol over a Fair Medium (1992) (12)
- Railway modelling in CSP||B: the double junction case study (2012) (12)
- vVote: a Verifiable Voting System (DRAFT) (2014) (12)
- A Formal Framework for Modelling Coercion Resistance and Receipt Freeness (2012) (11)
- Towards a Practical Approach to Check UML/fUML Models Consistency Using CSP (2011) (11)
- A New Receipt-Free E-Voting Scheme Based on Blind Signature (Abstract) (2006) (10)
- Policy templates for relationship-based access control (2013) (10)
- Augmenting B with Control Annotations (2007) (10)
- Towards a denotational semantics for ET-LOTOS (1995) (10)
- Introducing mobility into CSPkB (2007) (10)
- Combining Mobility with State (2007) (9)
- A formal model of Diffie-Hellman using CSP and rank functions (2003) (9)
- Modelling and analysis of the AMBA bus using CSP and B (2010) (9)
- Managing LTL Properties in Event-B Refinement (2014) (9)
- Bounded Retransmission in Event-B∥CSP: a Case Study (2011) (9)
- Broadcast Communication for Real-time Processes (1992) (9)
- Cryptographic protocols with everyday objects (2013) (9)
- An Optimization Approach for Effective Formalized fUML Model Checking (2012) (9)
- Formally defining NFC M-coupon requirements, with a case study (2013) (8)
- Changing System Interfaces Consistently: A New Refinement Strategy for CSP||B (2009) (8)
- Capturing timing requirements formally in AMN (1999) (8)
- Specifying Authentication Using Signal Events in CSP (2005) (8)
- Feasibility Analysis of Prêt à Voter for German Federal Elections (2011) (7)
- Guest editorial overview (2003) (7)
- Testing Voters' Understanding of a Security Mechanism Used in Verifiable Voting (2013) (7)
- Recursion induction for real-time processes (1993) (7)
- May Testing, Non-interference, and Compositionality (2001) (7)
- Robust Synthesis of Adversarial Visual Examples Using a Deep Image Prior (2019) (7)
- Mobile CSP||B (2009) (6)
- Embedding CSP in PVS: An Application to Authentication Protocols (2013) (6)
- Timewise Reenement for Communicating Processes (1997) (6)
- A Formal Approach for Reasoning About a Class of Diffie-Hellman Protocols (2005) (6)
- Tear and Destroy: Chain voting and destruction problems shared by Pret a Voter and Punchscan and a solution using Visual Encryption (2007) (6)
- Distributed Creation of the Ballot Form in Prêt à Voter using an element of Visual Encryption (2006) (6)
- Prêt á Voter with Write-Ins (2011) (6)
- Towards the Rank Function Verification of protocols that use Temporary Secrets (2004) (6)
- Real-time LOTOS and Timed Observations (1995) (6)
- Verifiable Voting Systems (2013) (6)
- Privacy-Preserving Electronic Ticket Scheme with Attribute-Based Credentials (2017) (6)
- A formal framework for security analysis of NFC mobile coupon protocols (2015) (5)
- B modelling for railway verification : the double junction case study (2012) (5)
- Vax-a-Net: Training-time Defence Against Adversarial Patch Attacks (2020) (5)
- Automated anonymity verification of the ThreeBallot and VAV voting systems (2016) (5)
- A step towards refining and translating B control annotations to Handel‐C (2007) (5)
- An algebraic approach to the verification of a class of Diffie-Hellman protocols (2007) (5)
- VMV: Augmenting an Internet Voting System with Selene Verifiability (2019) (4)
- Anonymous Single-Sign-On for n designated services with traceability (2018) (4)
- A verified development of hardware using CSP/spl par/B (2006) (4)
- Stepwise Refinement in Event-B CSP. Part 1: Safety (2011) (4)
- Software Design for VEC vVote System (2013) (4)
- Anonymous Single Sign-On With Proxy Re-Verification (2018) (4)
- E-Voting and Identify (2013) (4)
- Tyne A Practical , Voter-verifiable Election Scheme (2004) (4)
- Formal Security Analysis and Improvement of a Hash-Based NFC M-Coupon Protocol (2013) (3)
- Abstraction and Testing in CSP (2000) (3)
- Composing Speciications Using Communication (2003) (3)
- Countering Ballot Stuffing and Incorporating Eligibility Verifiability in Helios (2014) (3)
- Process Algebra and Security (2001) (3)
- A Step towards Merging xUML and CSP || {\| \ }B (2009) (3)
- Robustness Modelling and Verification of a Mix Net Protocol (2014) (3)
- Faster Print on Demand for Prêt à Voter (2013) (3)
- Tank monitoring: a pAMN case study (2005) (3)
- Authentication Codes (2011) (2)
- To infinity and beyond or, avoiding the infinite in security protocol analysis (2006) (2)
- Recursive Authentication Protocol (2009) (2)
- Formal aspects in security and trust : Third International Workshop, FAST 2005 : Newcastle upon Tyne, UK, July 18-19, 2005 : revised selected papers (2006) (2)
- Experiments in Translating CSP || B to Handel-C (2008) (2)
- Special issue on Automated Verification of Critical Systems (AVoCS 2013) (2015) (2)
- Real-time CSP and ET-LOTOS (1994) (2)
- A verified development of hardware using CSP∥B (2006) (1)
- Special Section on Vote-ID 2013 (2014) (1)
- Computer Security – ESORICS 2020: 25th European Symposium on Research in Computer Security, ESORICS 2020, Guildford, UK, September 14–18, 2020, Proceedings, Part I (2020) (1)
- Timewise Re nement for Communicating Processes (2009) (1)
- Computer Security – ESORICS 2019: 24th European Symposium on Research in Computer Security, Luxembourg, September 23–27, 2019, Proceedings, Part II (2019) (1)
- Formal aspects of security : first International Conference, FASec 2002 : London, UK, December 16-18, 2002 : revised papers (2003) (1)
- A step towards refining and translating B control annotations to Handel-C (2010) (1)
- Preface: Volume 32 (2000) (1)
- Chapter e90 – Verifiable Voting Systems (2013) (1)
- Automated Anonymity Verification of the ThreeBallot Voting System (2013) (1)
- The 30th Communicating Process Architectures Conference, CPA 2007, organised under the auspices of WoTUG and the University of Surrey, Guildford, Surrey, UK, 8-11 July 2007 (2007) (1)
- Augmenting an Internet Voting System with Selene Verifiability using Permissioned Distributed Ledger (2020) (1)
- The behavioural semantics of Event-B refinement (2012) (1)
- Using CSP | | B and ProB for railway modelling (2012) (1)
- PPETS-FGP: Privacy-Preserving Electronic Ticket Scheme with Fine-Grained Pricing (2017) (1)
- Rigorous Specification of Real-Time Systems (1993) (1)
- Prêt à Voter — The Evolution of the Species (1)
- Threat Analysis of a Practical Voting Scheme with Receipts (2007) (1)
- Csp Theorems for Communicating B Machines Provisional (2003) (0)
- Electronic Communications of the EASST Volume 23 ( 2009 ) Proceedings of the Ninth International Workshop on Automated Verification of Critical Systems ( AVOCS 2009 ) Mobile CSP ‖ B (2009) (0)
- Software Requirements Specification for VEC vVote System (2013) (0)
- Experiments in Translating CSPkB to Handel-C (2008) (0)
- Components with Symbolic Transition Systems: a Java Implementation of Rendezvous (2007) (0)
- Towards the verification of security protocols that use temporary secrets (2004) (0)
- Proceedings of the 3rd international conference on Formal specification and development in Z and B (2003) (0)
- Foundations for using linear temporal logic in Event-B refinement (2016) (0)
- Solving the Discrete Logarithm Problem for Packing Candidate Preferences (2013) (0)
- Proceedings of the 4th international conference on E-Voting and Identity (2013) (0)
- Concurrent / Reactive System Design with Honeysuckle (2007) (0)
- Towards end-to-end verifiable online voting: adding verifiability to established voting systems (2019) (0)
- An integrated framework for checking the behaviour of fUML models using CSP (2012) (0)
- Object Modelling in the SystemB Industrial Project (2008) (0)
- Composing Speci � cations using Communication (2006) (0)
- Feasibility Analysis of Pretoter for German Federal Elections (2012) (0)
- Event-B and Linear Temporal Logic (2016) (0)
- Anonymity and CSP for Voting Systems (2011) (0)
- Guest Editors’ Preface (2007) (0)
- Computer Security – ESORICS 2019: 24th European Symposium on Research in Computer Security, Luxembourg, September 23–27, 2019, Proceedings, Part I (2019) (0)
- Verifying anonymity in voting systems using CSP (2012) (0)
- Security Analysis using Rank Functions in CSP (2011) (0)
- Classifying and Capturing Timing Requirements (1999) (0)
- Preface Computer Security - ESORICS 2020 - 25th European Symposium on Research in Computer Security (2020) (0)
- Detecting Feature Interactions in the Terrestrial Trunked Radio (TETRA) Network Using Promela and Xspin (1999) (0)
- The future of the UK’s Cyber Security Research Position in the World (2020) (0)
- On Key-Sizes for Electronic Voting (2013) (0)
- Proceedings of the Third international conference on Formal Aspects in Security and Trust (2005) (0)
- A Failures Semantics for ET-LOTOS (1994) (0)
- Towards the Verification of Bidirectional Railway Models in CSP||B (2014) (0)
- Concurrent Systems Engineering Series: Preface (2007) (0)
- Trustworthy Voting Systems Technical Report: System Design (2010) (0)
- Computer Security – ESORICS 2020: 25th European Symposium on Research in Computer Security, ESORICS 2020, Guildford, UK, September 14–18, 2020, Proceedings, Part II (2020) (0)
This paper list is powered by the following services:
Other Resources About Steve Schneider
What Schools Are Affiliated With Steve Schneider ?
Steve Schneider is affiliated with the following schools:
