Results 1  10
of
17,418
Timed spicalculus with types for secrecy and authenticity
 In CONCUR’05: Concurrency Theory
, 2005
"... Abstract. We present a discretely timed spicalculus. A primitive for key compromise allows us to model key compromise attacks, thus going beyond the standard Dolev–Yao attacker model. A primitive for reading a global clock allows us to express protocols based on timestamps, which are common in prac ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
in practice. We accompany the timed spicalculus with a type system, prove that welltyped protocols are robustly safe for secrecy and authenticity and present examples of welltyped protocols as well as an example where failure to typecheck reveals a (wellknown) flaw. 1
A calculus for cryptographic protocols: The spi calculus
 Information and Computation
, 1999
"... We introduce the spi calculus, an extension of the pi calculus designed for the description and analysis of cryptographic protocols. We show how to use the spi calculus, particularly for studying authentication protocols. The pi calculus (without extension) suffices for some abstract protocols; the ..."
Abstract

Cited by 919 (55 self)
 Add to MetaCart
We introduce the spi calculus, an extension of the pi calculus designed for the description and analysis of cryptographic protocols. We show how to use the spi calculus, particularly for studying authentication protocols. The pi calculus (without extension) suffices for some abstract protocols
On Compositional Reasoning in the Spicalculus
 In Proc. of the 5th International Conference on Foundations of Software Science and Computation Structures (FossaCS’02), volume 2303 of LNCS
, 2002
"... Observational equivalences can be used to reason about the correctness of security protocols described in the spicalculus. Unlike in CCS or in #calculus, these equivalences do not enjoy a simple formulation in spicalculus. The present paper aims at enriching the set of tools for reasoning on proc ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
Observational equivalences can be used to reason about the correctness of security protocols described in the spicalculus. Unlike in CCS or in #calculus, these equivalences do not enjoy a simple formulation in spicalculus. The present paper aims at enriching the set of tools for reasoning
A BRUTUS Logic for a SpiCalculus Dialect
"... In the field of process algebras, the spicalculus, a modified version of the calculus with encryption primitives, is indicated as an expressive specification language for cryptographic protocols. In spicalculus basic security properties, such as secrecy and integrity can be formalized as may ..."
Abstract
 Add to MetaCart
In the field of process algebras, the spicalculus, a modified version of the calculus with encryption primitives, is indicated as an expressive specification language for cryptographic protocols. In spicalculus basic security properties, such as secrecy and integrity can be formalized as may
Secrecy by Typing in Security Protocols
 Journal of the ACM
, 1998
"... We develop principles and rules for achieving secrecy properties in security protocols. Our approach is based on traditional classification techniques, and extends those techniques to handle concurrent processes that use sharedkey cryptography. The rules have the form of typing rules for a basic co ..."
Abstract

Cited by 281 (15 self)
 Add to MetaCart
We develop principles and rules for achieving secrecy properties in security protocols. Our approach is based on traditional classification techniques, and extends those techniques to handle concurrent processes that use sharedkey cryptography. The rules have the form of typing rules for a basic
The SpiCalculus and a Bisimulation Method
, 1999
"... We present the spicalculus, an extension of the calculus, developped by Abadi and Gordon [AG98b]. Strengths and weaknesses of the model are analyzed. A Bisimulation method (framed bisimulation), used to equate two cryptographically equivalent processes written in spicalculus, dened in [AG98a] i ..."
Abstract
 Add to MetaCart
We present the spicalculus, an extension of the calculus, developped by Abadi and Gordon [AG98b]. Strengths and weaknesses of the model are analyzed. A Bisimulation method (framed bisimulation), used to equate two cryptographically equivalent processes written in spicalculus, dened in [AG98a
A BRUTUS Logic for the SpiCalculus
 In: Proceedings of the IFIP Workshop on Issues in the Theory of Security. (2001
, 2001
"... A spicalculus dialect and its BRUTUS logic is presented. The BRUTUS logic is a temporal first order logic defined within the BRUTUS model checker by Clarke, Jha and Marrero [10], and its use within spicalculus like languages can help in expressing security properties. The spicalculus dialect i ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
A spicalculus dialect and its BRUTUS logic is presented. The BRUTUS logic is a temporal first order logic defined within the BRUTUS model checker by Clarke, Jha and Marrero [10], and its use within spicalculus like languages can help in expressing security properties. The spicalculus dialect
Security Architecture for the Internet Protocol
 RFC 1825
, 1995
"... ContentType: text/plain ..."
The Protection of Information in Computer Systems
, 1975
"... This tutorial paper explores the mechanics of protecting computerstored information from unauthorized use or modification. It concentrates on those architectural structureswhether hardware or softwarethat are necessary to support information protection. The paper develops in three main sections ..."
Abstract

Cited by 815 (2 self)
 Add to MetaCart
sections. Section I describes desired functions, design principles, and examples of elementary protection and authentication mechanisms. Any reader familiar with computers should find the first section to be reasonably accessible. Section II requires some familiarity with descriptorbased computer
Fuzzy extractors: How to generate strong keys from biometrics and other noisy data. Technical Report 2003/235, Cryptology ePrint archive, http://eprint.iacr.org, 2006. Previous version appeared at EUROCRYPT 2004
 34 [DRS07] [DS05] [EHMS00] [FJ01] Yevgeniy Dodis, Leonid Reyzin, and Adam
, 2004
"... We provide formal definitions and efficient secure techniques for • turning noisy information into keys usable for any cryptographic application, and, in particular, • reliably and securely authenticating biometric data. Our techniques apply not just to biometric information, but to any keying mater ..."
Abstract

Cited by 532 (38 self)
 Add to MetaCart
We provide formal definitions and efficient secure techniques for • turning noisy information into keys usable for any cryptographic application, and, in particular, • reliably and securely authenticating biometric data. Our techniques apply not just to biometric information, but to any keying
Results 1  10
of
17,418