Eike Ritter

According to our database1, Eike Ritter authored at least 44 papers between 1993 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Categorical Proof-Theoretic Semantics.
CoRR, 2023

2018
A Protocol for Preventing Insider Attacks in Untrusted Infrastructure-as-a-Service Clouds.
IEEE Trans. Cloud Comput., 2018

2017
Stateful applied pi calculus: Observational equivalence and labelled bisimilarity.
J. Log. Algebraic Methods Program., 2017

Analysis of privacy in mobile telephony systems.
Int. J. Inf. Sec., 2017

A Malware-Tolerant, Self-Healing Industrial Control System Framework.
Proceedings of the ICT Systems Security and Privacy Protection, 2017

2015
Fibrational Modal Type Theory.
Proceedings of the Tenth Workshop on Logical and Semantic Frameworks, with Applications, 2015

2014
A proof-theoretic analysis of the classical propositional matrix method.
J. Log. Comput., 2014

StatVerif: Verification of stateful processes.
J. Comput. Secur., 2014

Provable security of a pairing-free one-pass authenticated key establishment protocol for wireless sensor networks.
Int. J. Inf. Sec., 2014

Verification of agent knowledge in dynamic access control policies.
CoRR, 2014

Stateful Applied Pi Calculus.
Proceedings of the Principles of Security and Trust - Third International Conference, 2014

Privacy through Pseudonymity in Mobile Telephony Systems.
Proceedings of the 21st Annual Network and Distributed System Security Symposium, 2014

2013
Model Checking Agent Knowledge in Dynamic Access Control Policies.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2013

2012
An Authentication Framework for Wireless Sensor Networks Using Identity-Based Signatures: Implementation and Evaluation.
IEICE Trans. Inf. Syst., 2012

Auditable Envelopes: Tracking Anonymity Revocation Using Trusted Computing.
Proceedings of the Trust and Trustworthy Computing - 5th International Conference, 2012

New privacy issues in mobile telephony: fix and verification.
Proceedings of the ACM Conference on Computer and Communications Security, 2012

2011
Formal Analysis of UMTS Privacy
CoRR, 2011

StatVerif: Verification of Stateful Processes.
Proceedings of the 24th IEEE Computer Security Foundations Symposium, 2011

True Trustworthy Elections: Remote Electronic Voting Using Trusted Computing.
Proceedings of the Autonomic and Trusted Computing - 8th International Conference, 2011

2010
Analysing Unlinkability and Anonymity Using the Applied Pi Calculus.
Proceedings of the 23rd IEEE Computer Security Foundations Symposium, 2010

An Authentication Framework for Wireless Sensor Networks using Identity-Based Signatures.
Proceedings of the 10th IEEE International Conference on Computer and Information Technology, 2010

2009
Towards the Verification of Pervasive Systems.
Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2009

Untraceability in the applied pi-calculus.
Proceedings of the 4th International Conference for Internet Technology and Secured Transactions, 2009

Remote Electronic Voting with Revocable Anonymity.
Proceedings of the Information Systems Security, 5th International Conference, 2009

2005
Relating Categorical Semantics for Intuitionistic Linear Logic.
Appl. Categorical Struct., 2005

A games semantics for reductive logic and proof-search.
Proceedings of the 1st Workshop on Games for Logic and Programming Languages, 2005

Analysis of a Multi-party Fair Exchange Protocol and Formal Proof of Correctness in the Strand Space Model.
Proceedings of the Financial Cryptography and Data Security, 2005

2004
Reductive logic and proof-search - proof theory, semantics, and control.
Oxford logic guides 45, Oxford University Press, ISBN: 978-0-19-852633-9, 2004

2001
Categorical and Kripke Semantics for Constructive S4 Modal Logic.
Proceedings of the Computer Science Logic, 15th International Workshop, 2001

2000
On the intuitionistic force of classical search.
Theor. Comput. Sci., 2000

Proof-terms for classical and intuitionistic resolution.
J. Log. Comput., 2000

Linear Explicit Substitutions.
Log. J. IGPL, 2000

Categorical Models for Intuitionistic and Linear Type Theory.
Proceedings of the Foundations of Software Science and Computation Structures, 2000

1999
Characterising Explicit Substitutions which Preserve Termination.
Proceedings of the Typed Lambda Calculi and Applications, 4th International Conference, 1999

Categorical Models of Explicit Substitutions.
Proceedings of the Foundations of Software Science and Computation Structure, 1999

1998
Explicit Substitutions for Constructive Necessity.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1997
On Explicit Substitution and Names (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1996
On the Intuitionistic Force of Classical Search (Extended Abstract).
Proceedings of the Theorem Proving with Analytic Tableaux and Related Methods, 1996

Proof-Terms for Classical and Intuitionistic Resolution (Extended Abstract).
Proceedings of the Automated Deduction - CADE-13, 13th International Conference on Automated Deduction, New Brunswick, NJ, USA, July 30, 1996

1995
A Fully Abstract Translation between a Lambda-Calculus with Reference Types and Standard ML.
Proceedings of the Typed Lambda Calculi and Applications, 1995

1994
Categorical Abstract Machines for Higher-Order Typed lambda-Calculi.
Theor. Comput. Sci., 1994

1993
Rewriting Properties of Combinators for Rudimentary Linear Logic.
Proceedings of the Higher-Order Algebra, 1993

Normalization for Typed Lambda Calculi with Explicit Substitution.
Proceedings of the Computer Science Logic, 7th Workshop, 1993

A Generic Strong Normalization Argument: Application to the Calculus of Constructions.
Proceedings of the Computer Science Logic, 7th Workshop, 1993


  Loading...