The following pages link to A logic of authentication (Q4206382):
Displaying 50 items.
- On the Clark-Jacob version of SPLICE/AS (Q287082) (← links)
- Robust extended chaotic maps-based three-factor authentication scheme preserving biometric template privacy (Q335718) (← links)
- A new three-party-authenticated key agreement scheme based on chaotic maps without password table (Q490481) (← links)
- Automated type-based analysis of injective agreement in the presence of compromised principals (Q492914) (← links)
- A game-theoretic framework for specification and verification of cryptographic protocols (Q607405) (← links)
- To know or not to know: Epistemic approaches to security protocol verification (Q625717) (← links)
- An attack on the Needham-Schroeder public-key authentication protocol (Q672251) (← links)
- Reachability results for timed automata with unbounded data structures (Q707597) (← links)
- Probability timed automata for investigating communication processes (Q747506) (← links)
- Applying a formal analysis technique to the CCITT X.509 strong two-way authentication protocol (Q802867) (← links)
- Beacon based authentication (Q826059) (← links)
- On the design of cryptographic primitives (Q850775) (← links)
- Injective synchronisation: An extension of the authentication hierarchy (Q860905) (← links)
- Knowledge structure approach to verification of authentication protocols (Q866176) (← links)
- Cryptographic protocol logic: satisfaction for (timed) Dolev-Yao cryptography (Q953531) (← links)
- A calculus for cryptographic protocols: The spi calculus (Q1283776) (← links)
- Gordon's computer: A hardware verification case study in OBJ3 (Q1329091) (← links)
- Logarithm Cartesian authentication codes. (Q1398375) (← links)
- Study on strand space model theory (Q1412125) (← links)
- Authentication tests and the structure of bundles. (Q1603655) (← links)
- On the role of formal methods in security (Q1607104) (← links)
- Three-factor-based confidentiality-preserving remote user authentication scheme in multi-server environment (Q1640497) (← links)
- Robust and efficient authentication scheme for session initiation protocol (Q1666852) (← links)
- Verification of cryptographic protocols: tagging enforces termination (Q1770413) (← links)
- Vulnerability analysis of CSP based on stochastic game theory (Q1788526) (← links)
- ESAP: efficient and secure authentication protocol for roaming user in mobile communication networks (Q1789161) (← links)
- An attack-finding algorithm for security protocols. (Q1850665) (← links)
- On the symbolic reduction of processes with cryptographic functions. (Q1853612) (← links)
- A new logic for electronic commerce protocols (Q1853749) (← links)
- A comparison of three authentication properties. (Q1853750) (← links)
- Private authentication (Q1881255) (← links)
- Source code verification of a secure payment applet (Q1881671) (← links)
- An improvement of GNY logic for the reflection attacks (Q1975143) (← links)
- A computationally grounded logic of graded belief (Q2055797) (← links)
- Timed models of security protocols including delays in the network (Q2201162) (← links)
- Invariant-based reasoning about parameterized security protocols (Q2268473) (← links)
- A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols (Q2368990) (← links)
- The reactive simulatability (RSIM) framework for asynchronous systems (Q2464139) (← links)
- A framework for compositional verification of security protocols (Q2482454) (← links)
- Unifying simulatability definitions in cryptographic systems under different timing assumptions (Q2484407) (← links)
- A static analysis of cryptographic processes: the denotational approach (Q2484412) (← links)
- Logics for reasoning about cryptographic constructions (Q2490263) (← links)
- Pattern-matching spi-calculus (Q2500522) (← links)
- An extended chaotic-maps-based protocol with key agreement for multiserver environments (Q2517587) (← links)
- Design and analysis of a chaotic maps-based three-party authenticated key agreement protocol (Q2520636) (← links)
- Automatic verification of secrecy properties for linear logic specifications of cryptographic protocols (Q2643568) (← links)
- A formalization of credit and responsibility within the GNDC schema (Q2804933) (← links)
- Abstract interpretation for proving secrecy properties in security protocols (Q2841216) (← links)
- Information based reasoning about security protocols (Q2841219) (← links)
- Modal logics for cryptographic processes (Q2842609) (← links)
