Mechanized proofs for a recursive authentication protocol

نویسنده

  • Lawrence C. Paulson
چکیده

A novel protocol has been formally analyzed using the prover Isabelle/HOL, following the inductive approach described in earlier work [10]. There is no limit on the length of a run, the nesting of messages or the number of agents involved. A single run of the protocol delivers session keys for all the agents, allowing neighbours to perform mutual authentication. The basic security theorem states that session keys are correctly delivered to adjacent pairs of honest agents, regardless of whether other agents in the chain are compromised. The protocol’s complexity caused some difficulties in the specification and proofs, but its symmetry reduced the number of theorems to prove.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mechanized Proofs for a Recursive Authentication Protocol 1

A novel protocol has been formally analyzed using the prover Isabelle/HOL, following the inductive approach described in earlier work [11]. There is no limit on the length of a run, the nesting of messages or the number of agents involved. A single run of the protocol delivers session keys for all the agents, allowing neighbours to perform mutual authentication. The basic security theorem state...

متن کامل

Proving Correctness of the Basic TESLA Multicast Stream Authentication Protocol with TAME

The TESLA multicast stream authentication protocol is distinguished from other types of cryptographic protocols in both its key management scheme and its use of timing. It takes advantage of the stream being broadcast to periodically commit to and later reveal keys used by a receiver to verify that packets are authentic, and it uses both inductive reasoning and time arithmetic to allow the rece...

متن کامل

Myla Archer / Proving TESLA with TAME 3

The TESLA multicast stream authentication protocol is distinguished from other types of cryptographic protocols in both its key management scheme and its use of timing. It takes advantage of the stream being broadcast to periodically commit to and later reveal keys used by a receiver to verify that packets are authentic, and it uses both inductive reasoning and time arithmetic to allow the rece...

متن کامل

A TESLA-based mutual authentication protocol for GSM networks

The widespread use of wireless cellular networks has made security an ever increasing concern. GSM is the most popular wireless cellular standard, but security is an issue. The most critical weakness in the GSM protocol is the use of one-way entity authentication, i.e., only the mobile station is authenticated by the network. This creates many security problems including vulnerability against m...

متن کامل

Authentication Logics: New Theory and Implementations

Project GR/K77051, funded by the Engineering and Physical Sciences Research Council (EPSRC), was undertaken to provide better tools for verifying security protocols. A new method has been developed in which protocols are modelled inductively [5]. The method has been applied to numerous protocols, such as TLS [6], an Internet protocol descended from SSL 3.0. APM Limited’s recursive authenticatio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997