Using encryption for authentication in large networks of computers

DOI10.1145/359657.359659zbMath0387.68003OpenAlexW2146973388WikidataQ55879611 ScholiaQ55879611MaRDI QIDQ4168037

Michael Schroeder, Roger M. Needham

Publication date: 1978

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/359657.359659

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Data encryption (aspects in computer science) (68P25) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

Related Items (only showing first 100 items - show all)

Certifying choreography compilation ⋮ Secrecy types for asymmetric communication. ⋮ Three systems for cryptographic protocol analysis ⋮ Private authentication ⋮ A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols ⋮ Arbitrated unconditionally secure authentication scheme with multi-senders ⋮ An approach for formal verification of authentication protocols ⋮ Model Checking Security Protocols ⋮ First-order temporal verification in practice ⋮ Validation of Decentralised Smart Contracts Through Game Theory and Formal Methods ⋮ Symbolic Protocol Analysis with Disequality Constraints Modulo Equational Theories ⋮ A tutorial-style introduction to \(\mathsf{DY}^{\star}\) ⋮ Joshua Guttman: pioneering strand spaces ⋮ Automatic verification of secrecy properties for linear logic specifications of cryptographic protocols ⋮ Information theoretically secure key sharing protocol executing with constant noiseless public channels ⋮ Formal analysis of Kerberos 5 ⋮ Injective synchronisation: An extension of the authentication hierarchy ⋮ A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties ⋮ A (restricted) quantifier elimination for security protocols ⋮ Attacking group protocols by refuting incorrect inductive conjectures ⋮ Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures ⋮ A collusion problem and its solution ⋮ A game-theoretic framework for specification and verification of cryptographic protocols ⋮ Protocol Verification Via Rigid/Flexible Resolution ⋮ Unnamed Item ⋮ FORSAKES: a forward-secure authenticated key exchange protocol based on symmetric key-evolving schemes ⋮ To know or not to know: Epistemic approaches to security protocol verification ⋮ Extended KCI attack against two-party key establishment protocols ⋮ Universally composable symbolic security analysis ⋮ A matrix key-distribution scheme ⋮ The IITM model: a simple and expressive model for universal composability ⋮ The meeting businessmen problem: requirements and limitations ⋮ Bounded memory Dolev-Yao adversaries in collaborative systems ⋮ Efficient network authentication protocols: Lower bounds and optimal implementations ⋮ Celf – A Logical Framework for Deductive and Concurrent Systems (System Description) ⋮ Computation of discrete logarithms in prime fields ⋮ Automated type-based analysis of injective agreement in the presence of compromised principals ⋮ An attack on the Needham-Schroeder public-key authentication protocol ⋮ On the security of SPLICE/AS -- The authentication system in WIDE Internet ⋮ Theorem Proving Based on Proof Scores for Rewrite Theory Specifications of OTSs ⋮ Provably secure key establishment protocol using one-way functions ⋮ Enhancing the security of password authenticated key agreement protocols based on chaotic maps ⋮ A Maude environment for CafeOBJ ⋮ Attacks on Okamoto and Tanaka's one-way ID-based key distribution system ⋮ 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 Probabilistic Polynomial-time Calculus For Analysis of Cryptographic Protocols ⋮ Modeling and Verifying Time Sensitive Security Protocols with Constraints ⋮ Cryptographic logical relations ⋮ Symbolic protocol analysis for monoidal equational theories ⋮ Breaking and fixing public-key Kerberos ⋮ A framework for compositional verification of security protocols ⋮ Unnamed Item ⋮ Abstraction and resolution modulo AC: How to verify Diffie--Hellman-like protocols automatically ⋮ Typed Multiset Rewriting Specifications of Security Protocols ⋮ A core model for choreographic programming ⋮ Distributed temporal logic for the analysis of security protocol models ⋮ Verification of cryptographic protocols: tagging enforces termination ⋮ An NP decision procedure for protocol insecurity with XOR ⋮ Simulation relations for alternating Büchi automata ⋮ Two phases encryption and its applications ⋮ Invariant-based reasoning about parameterized security protocols ⋮ A new password authentication mechanism based on two phases encryption ⋮ Automatic verification of temporal-epistemic properties of cryptographic protocols ⋮ Unnamed Item ⋮ Compiling and securing cryptographic protocols ⋮ Password-based authentication and key distribution protocols with perfect forward secrecy ⋮ Relating state-based and process-based concurrency through linear logic (full-version) ⋮ Safely Composing Security Protocols ⋮ A countable and time-bound password-based user authentication scheme for the applications of electronic commerce ⋮ Ping-pong protocols as prefix grammars: modelling and verification via program transformation ⋮ Practical uses of synchronized clocks in distributed systems ⋮ Обзор уязвимостей некоторых протоколов выработки общего ключа с аутентификацией на основе пароля и принципы построения протокола SESPAKE ⋮ Computational Semantics for First-Order Logical Analysis of Cryptographic Protocols ⋮ Comparing State Spaces in Automatic Security Protocol Analysis ⋮ A ramp model for distributed key distribution schemes ⋮ Combining proverif and automated theorem provers for security protocol verification ⋮ Password-Authenticated Group Key Agreement with Adaptive Security and Contributiveness ⋮ Cryptographic Verification by Typing for a Sample Protocol Implementation ⋮ Completeness and Herbrand theorems for nominal logic ⋮ Perfectly secure key distribution for dynamic conferences ⋮ Safely composing security protocols ⋮ Authentication and delegation with smart-cards ⋮ EXPLOITING SYMMETRIES FOR TESTING EQUIVALENCE VERIFICATION IN THE SPI CALCULUS ⋮ A calculus for cryptographic protocols: The spi calculus ⋮ Formalization in PVS of Balancing Properties Necessary for Proving Security of the Dolev-Yao Cascade Protocol Model ⋮ Automatic Verification of Security Protocols in the Symbolic Model: The Verifier ProVerif ⋮ Bounded memory protocols ⋮ Secure implementation of channel abstractions ⋮ Protocol Composition Logic (PCL) ⋮ Temporal Logics of Knowledge and their Applications in Security ⋮ Skeletons, Homomorphisms, and Shapes: Characterizing Protocol Executions ⋮ Scheme for secure digital mobile communications based on symmetric key cryptography ⋮ Theoretical Aspects of Communication-Centred Programming ⋮ Models and emerging trends of concurrent constraint programming ⋮ Authentication tests and the structure of bundles. ⋮ A remote password authentication scheme based on the digital signature method ⋮ Narrowing and Rewriting Logic: from Foundations to Applications ⋮ Inter-protocol interleaving attacks on some authentication and key distribution protocols ⋮ An iterative modular multiplication algorithm ⋮ Equal To The Task?

This page was built for publication: Using encryption for authentication in large networks of computers