A logic of authentication
From MaRDI portal
Publication:4206382
DOI10.1098/rspa.1989.0125zbMath0687.68007OpenAlexW2175661655WikidataQ56518199 ScholiaQ56518199MaRDI QIDQ4206382
No author found.
Publication date: 1989
Published in: Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1098/rspa.1989.0125
Cryptography (94A60) Distributed systems (68M14) Network protocols (68M12) Theory of operating systems (68N25)
Related Items (65)
Gordon's computer: A hardware verification case study in OBJ3 ⋮ Source code verification of a secure payment applet ⋮ Homomorphism key agreement based on RSA ⋮ A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols ⋮ Reasoning About Trust and Belief Change on a Social Network: A Formal Approach ⋮ Three-factor-based confidentiality-preserving remote user authentication scheme in multi-server environment ⋮ On the design of cryptographic primitives ⋮ Static Evidences for Attack Reconstruction ⋮ Robust extended chaotic maps-based three-factor authentication scheme preserving biometric template privacy ⋮ Automatic verification of secrecy properties for linear logic specifications of cryptographic protocols ⋮ Robust and efficient authentication scheme for session initiation protocol ⋮ A game-theoretic framework for specification and verification of cryptographic protocols ⋮ Emerging Issues and Trends in Formal Methods in Cryptographic Protocol Analysis: Twelve Years Later ⋮ Threat scenarios as a means to formally develop secure systems ⋮ Modelling a public-key infrastructure ⋮ Operational and Epistemic Approaches to Protocol Analysis: Bridging the Gap ⋮ Reasoning about cryptographic protocols in the spi calculus ⋮ To know or not to know: Epistemic approaches to security protocol verification ⋮ Timed models of security protocols including delays in the network ⋮ Study on strand space model theory ⋮ Tableaux methods for access control in distributed systems ⋮ A semantics for web services authentication ⋮ An improvement of GNY logic for the reflection attacks ⋮ A new three-party-authenticated key agreement scheme based on chaotic maps without password table ⋮ Automated type-based analysis of injective agreement in the presence of compromised principals ⋮ An attack on the Needham-Schroeder public-key authentication protocol ⋮ The reactive simulatability (RSIM) framework for asynchronous systems ⋮ Cryptographic protocol logic: satisfaction for (timed) Dolev-Yao cryptography ⋮ Key Compromise, Strand Spaces, and the Authentication Tests1 1I gave my MFPS 17 talk on 24 May 2001, Bob Dylan's sixtieth birthday. This paper is dedicated to him. ⋮ A framework for compositional verification of security protocols ⋮ Unifying simulatability definitions in cryptographic systems under different timing assumptions ⋮ A static analysis of cryptographic processes: the denotational approach ⋮ Logics for reasoning about cryptographic constructions ⋮ Verification of cryptographic protocols: tagging enforces termination ⋮ Reachability results for timed automata with unbounded data structures ⋮ Invariant-based reasoning about parameterized security protocols ⋮ Web security: Authentication protocols and their analysis ⋮ Pattern-matching spi-calculus ⋮ Vulnerability analysis of CSP based on stochastic game theory ⋮ ESAP: efficient and secure authentication protocol for roaming user in mobile communication networks ⋮ A Formalization of Credit and Responsibility Within the GNDC Schema ⋮ An extended chaotic-maps-based protocol with key agreement for multiserver environments ⋮ Design and analysis of a chaotic maps-based three-party authenticated key agreement protocol ⋮ Probability timed automata for investigating communication processes ⋮ Comparing State Spaces in Automatic Security Protocol Analysis ⋮ A computationally grounded logic of graded belief ⋮ Authentication and delegation with smart-cards ⋮ EXPLOITING SYMMETRIES FOR TESTING EQUIVALENCE VERIFICATION IN THE SPI CALCULUS ⋮ Automatic verification of cryptographic protocols with SETHEO ⋮ A calculus for cryptographic protocols: The spi calculus ⋮ Abstract Interpretation for Proving Secrecy Properties in Security Protocols ⋮ Information based reasoning about security protocols ⋮ Modal Logics for Cryptographic Processes ⋮ A Formal Analysis of Complex Type Flaw Attacks on Security Protocols ⋮ Refinement of Kripke Models for Dynamics ⋮ An attack-finding algorithm for security protocols. ⋮ On the symbolic reduction of processes with cryptographic functions. ⋮ A new logic for electronic commerce protocols ⋮ A comparison of three authentication properties. ⋮ A Cryptographically Sound Dolev-Yao Style Security Proof of the Otway-Rees Protocol ⋮ A Vector Model of Trust for Developing Trustworthy Systems ⋮ Abstractions Preserving Parameter Confidentiality ⋮ Applying a formal analysis technique to the CCITT X.509 strong two-way authentication protocol ⋮ Temporal Logics of Knowledge and their Applications in Security ⋮ On the role of formal methods in security
This page was built for publication: A logic of authentication
