Proceedings Article10.1109/CSFW.2001.930143
Authenticity by typing for security protocols
Andrew D. Gordon,Alan Jeffrey +1 more
- 11 Jun 2001
- pp 145-159
TL;DR: The main theorem guarantees that any well-typed protocol is robustly safe, that is, its correspondence assertions are true in the presence of any opponent expressible in spi.
read more
Abstract: We propose a new method to check authenticity properties of cryptographic protocols. First, code up the protocol in the spi-calculus of Abadi and Gordon. Second, specify authenticity properties by annotating the code with correspondence assertions in the style of Woo and Lam. Third, figure out types for the keys, nonces, and messages of the protocol. Fourth, check that the spi-calculus code is well-typed according to a novel type and effect system presented in this paper. Our main theorem guarantees that any well-typed protocol is robustly safe, that is, its correspondence assertions are true in the presence of any opponent expressible in spi.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Book
Advanced Topics in Types and Programming Languages
Benjamin C. Pierce
- 01 Dec 2004
TL;DR: Topics covered include precise type analyses, which extend simple type systems to give them a better grip on the run time behavior of systems; type systems for low-level languages; applications of types to reasoning about computer programs; type theory as a framework for the design of sophisticated module systems; and advanced techniques in ML-style type inference.
Automated verification of selected equivalences for security protocols
TL;DR: This work focuses on proving equivalences P ≈ Q in which P and Q are two processes that differ only in the choice of some terms, and shows how to treat them as predicates on the behaviors of a process that represents P and Q at the same time.
334
Adapterama I: Universal stubs and primers for 384 unique dual-indexed or 147,456 combinatorially-indexed Illumina libraries (iTru & iNext)
Travis C. Glenn,Roger Nilsen,Troy J. Kieran,Jon G. Sanders,Natalia J. Bayona-Vásquez,John W. Finger,John W. Finger,Todd W. Pierson,Kerin E. Bentley,Sandra L. Hoffberg,Swarnali Louha,Francisco J. García de León,Miguel Ángel Del Río-Portilla,Kurt D. Reed,Jennifer L. Anderson,Jennifer K. Meece,Samuel E. Aggrey,Romdhane Rekaya,Magdy S. Alabady,Myriam Bélanger,Kevin Winker,Brant C. Faircloth +21 more
TL;DR: This approach reduces start-up and per-sample costs by requiring only one universal adapter that works with indexed PCR primers to uniquely identify samples, and reduces buy-in costs because relatively few oligonucleotides are needed to produce a large number of indexed libraries.
244
Formal methods for cryptographic protocol analysis: emerging issues and trends
TL;DR: Some of the ongoing work in the application of formal methods to cryptographic protocol analysis is described, as well as some of the new challenges and the ways in which they are being met.
238
Secure distributed programming with value-dependent types
TL;DR: F*, a full-fledged design and implementation of a new dependently typed language for secure distributed programming, provides arbitrary recursion while maintaining a logically consistent core; it enables modular reasoning about state and other effects using affine types; and it supports proofs of refinement properties using a mixture of cryptographic evidence and logical proof terms.
References
On the security of public key protocols
Danny Dolev,Andrew Chi-Chih Yao +1 more
TL;DR: Several models are formulated in which the security of protocols can be discussed precisely, and algorithms and characterizations that can be used to determine protocol security in these models are given.
•Book
The Java Virtual Machine Specification
Tim Lindholm,Frank Yellin +1 more
- 19 Sep 1996
TL;DR: In this article, the authors present a detailed overview of the Java Virtual Machine, including the internal structure of the class file format, the internal form of Fully Qualified Class and Interface names, and the implementation of new class instances.
A logic of authentication
Michael Burrows,Martín Abadi,Roger M. Needham +2 more
- 01 Nov 1989
TL;DR: This paper describes the beliefs of trustworthy parties involved in authentication protocols and the evolution of these beliefs as a consequence of communication, and gives the results of the analysis of four published protocols.
•Book
Communicating and Mobile Systems: the Pi-Calculus
Robin Milner
- 01 Jan 1999
TL;DR: Communicating Systems: Behaviour of automata and Observation equivalence: theory, examples, and Discussion and related work Bibliography Index.
2.6K
Entity authentication and key distribution
Mihir Bellare,Phillip Rogaway +1 more
- 22 Aug 1993
TL;DR: This work provides the first formal treatment of entity authentication and authenticated key distribution appropriate to the distributed environment and presents a definition, protocol, and proof that the protocol meets its goal, assuming only the existence of a pseudorandom function.