Blaise Gassend
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Blaise Gassend has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Marten van Dijk
Massachusetts Institute of Technology, Cambridge, MA 02139
4 shared publications - Srinivas Devadas
Massachusetts Institute of Technology, Cambridge, MA, USA
3 shared publications Emina Torlak
2 shared publications- Andrew Lee
Department of Mathematics MIT 02139-4307 Cambridge MA
1 shared publication Daniel Jackson
1 shared publication- Dwaine Clarke
University of the West Indies
1 shared publication
Latest Publications
- Open Access
- 24 May 2007
- Published by Springer Nature in BMC Bioinformatics
- Vol. 8 (5) , S3
Learning biophysically-motivated parameters for alpha helix prediction
- 24 May 2007
- Published by Springer Nature in BMC Bioinformatics
- Vol. 8 (5) , S3
Open AccessLearning biophysically-motivated parameters for alpha helix prediction
- Open Access
Knowledge Flow Analysis for Security Protocols
Knowledge flow analysis offers a simple and flexible way to find flaws in security protocols. A protocol is described by a collection of rules constraining the propagation of knowledge amongst principals. Because this characterization corresponds closely to informal descriptions of protocols, it allows a succinct and natural formalization; because it abstracts away message ordering, and handles communications between principals and applications of cryptographic primitives uniformly, it is readily represented in a standard logic. A generic framework in the Alloy modelling language is presented, and instantiated for two standard protocols, and a new key management scheme.
Open AccessKnowledge Flow Analysis for Security Protocols
Knowledge flow analysis offers a simple and flexible way to find flaws in security protocols. A protocol is described by a collection of rules constraining the propagation of knowledge amongst principals. Because this characterization corresponds closely to informal descriptions of protocols, it allows a succinct and natural formalization; because it abstracts away message ordering, and handles communications between principals and applications of cryptographic primitives uniformly, it is readily represented in a standard logic. A generic framework in the Alloy modelling language is presented, and instantiated for two standard protocols, and a new key management scheme.
- Open Access
A Generalized Two-Phase Analysis of Knowledge Flows in Security Protocols
We introduce knowledge flow analysis, a simple and flexible formalism for checking cryptographic protocols. Knowledge flows provide a uniform language for expressing the actions of principals, assump- tions about intruders, and the properties of cryptographic primitives. Our approach enables a generalized two-phase analysis: we extend the two-phase theory by identifying the necessary and sufficient proper- ties of a broad class of cryptographic primitives for which the theory holds. We also contribute a library of standard primitives and show that they satisfy our criteria.
Open AccessA Generalized Two-Phase Analysis of Knowledge Flows in Security Protocols
We introduce knowledge flow analysis, a simple and flexible formalism for checking cryptographic protocols. Knowledge flows provide a uniform language for expressing the actions of principals, assump- tions about intruders, and the properties of cryptographic primitives. Our approach enables a generalized two-phase analysis: we extend the two-phase theory by identifying the necessary and sufficient proper- ties of a broad class of cryptographic primitives for which the theory holds. We also contribute a library of standard primitives and show that they satisfy our criteria.
- 1 May 2006
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 39 (2) , 253-273
Speeding up Exponentiation using an Untrusted Computational Resource
- 1 May 2006
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 39 (2) , 253-273
Speeding up Exponentiation using an Untrusted Computational Resource