Pages that link to "Item:Q4168037"
From MaRDI portal
The following pages link to Using encryption for authentication in large networks of computers (Q4168037):
Displaying 50 items.
- Arbitrated unconditionally secure authentication scheme with multi-senders (Q293236) (← links)
- Bounded memory Dolev-Yao adversaries in collaborative systems (Q462499) (← links)
- Automated type-based analysis of injective agreement in the presence of compromised principals (Q492914) (← links)
- Enhancing the security of password authenticated key agreement protocols based on chaotic maps (Q508778) (← links)
- A Maude environment for CafeOBJ (Q520244) (← links)
- Distributed temporal logic for the analysis of security protocol models (Q549724) (← links)
- An NP decision procedure for protocol insecurity with XOR (Q557799) (← links)
- Simulation relations for alternating Büchi automata (Q557801) (← links)
- Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures (Q596095) (← 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)
- On the security of SPLICE/AS -- The authentication system in WIDE Internet (Q673820) (← links)
- Relating state-based and process-based concurrency through linear logic (full-version) (Q731895) (← links)
- Ping-pong protocols as prefix grammars: modelling and verification via program transformation (Q739638) (← links)
- First-order temporal verification in practice (Q851137) (← links)
- Formal analysis of Kerberos 5 (Q860899) (← links)
- Injective synchronisation: An extension of the authentication hierarchy (Q860905) (← links)
- A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties (Q860906) (← links)
- A (restricted) quantifier elimination for security protocols (Q860909) (← links)
- Attacking group protocols by refuting incorrect inductive conjectures (Q861695) (← links)
- FORSAKES: a forward-secure authenticated key exchange protocol based on symmetric key-evolving schemes (Q895004) (← links)
- A matrix key-distribution scheme (Q914646) (← links)
- Compiling and securing cryptographic protocols (Q990127) (← links)
- A countable and time-bound password-based user authentication scheme for the applications of electronic commerce (Q1006746) (← links)
- Safely composing security protocols (Q1028731) (← links)
- Computation of discrete logarithms in prime fields (Q1179517) (← links)
- Attacks on Okamoto and Tanaka's one-way ID-based key distribution system (Q1199939) (← links)
- Practical uses of synchronized clocks in distributed systems (Q1261109) (← links)
- Perfectly secure key distribution for dynamic conferences (Q1273875) (← links)
- A calculus for cryptographic protocols: The spi calculus (Q1283776) (← links)
- Scheme for secure digital mobile communications based on symmetric key cryptography (Q1313721) (← links)
- Three systems for cryptographic protocol analysis (Q1330137) (← links)
- A collusion problem and its solution (Q1383158) (← links)
- Authentication tests and the structure of bundles. (Q1603655) (← links)
- Inter-protocol interleaving attacks on some authentication and key distribution protocols (Q1607566) (← links)
- An iterative modular multiplication algorithm (Q1609170) (← links)
- Verification of cryptographic protocols: tagging enforces termination (Q1770413) (← links)
- A ramp model for distributed key distribution schemes (Q1811091) (← links)
- Secure implementation of channel abstractions (Q1854520) (← links)
- Secrecy types for asymmetric communication. (Q1874278) (← links)
- Private authentication (Q1881255) (← links)
- Extended KCI attack against two-party key establishment protocols (Q1944127) (← links)
- A core model for choreographic programming (Q2007727) (← links)
- Certifying choreography compilation (Q2119966) (← links)
- An approach for formal verification of authentication protocols (Q2140957) (← links)
- A tutorial-style introduction to \(\mathsf{DY}^{\star}\) (Q2154012) (← links)
- Joshua Guttman: pioneering strand spaces (Q2154021) (← links)
- The IITM model: a simple and expressive model for universal composability (Q2210435) (← links)
- Invariant-based reasoning about parameterized security protocols (Q2268473) (← links)
