Anúncios
Schedule for tool presentations
7 dezembro 2011, 15:47 • Carlos Caleiro
Aleksandar Stojanovic
OFMC - January 23
Andreia Mordido
CryptoVerif - January 30
Jacinta Poças
ProVerif - January 30
Always in Room 5.23, 14h.
Rescheduling of assignments
16 novembro 2011, 15:49 • Carlos Caleiro
- November 23, Jacinta Poças
- Paulson, The inductive approach to verifying cryptographic protocols. Journal of Computer Security 6(1-2), 1998.
-
- November 30, Jacinta Poças
- Caleiro, Viganò & Basin. Metareasoning about security protocols using distributed temporal logic. Electronic Notes in Theoretical Computer Science, 125(1):67-89, 2005.
- Basin, Caleiro, Ramos & Viganò. Distributed temporal logic for the analysis of security protocol models. Theoretical Computer Science, 412(31):4007-4043, 2011.
-
- December 7, Andreia Mordido
- Warinschi, A computational analysis of the Needham-Schroeder-(Lowe) protocol.Journal of Computer Security 13(3), 2005.
- Abadi & Rogaway, Reconciling Two Views of Cryptography - The Computational Soundness of Formal Encryption. LNCS 1872:3-22, 2000.
-
- December 14, Aleksandar Stojanovic
- Durgin, Lincoln, Mitchell & Scedrov. The undecidability of bounded security protocols.In Proceedings of the Workshop on Formal Methods and Security Protocols, 1999.
- Ramanujam & Suresh, Deciding knowledge properties of security protocols.Proceedings of the 10th Conference on Theoretical Aspects of Rationality and Knowledge, pages 219-235, 2005.
Tool assignments
19 outubro 2011, 16:32 • Carlos Caleiro
Aleksandar Stojanovic
OFMC (part of the AVISPA tool)
Jacinta Poças
Andreia Mordido
Next assignments
19 outubro 2011, 15:47 • Carlos Caleiro
- November 2, Aleksandar Stojanovic
-
- Abadi & Gordon, A Calculus for Cryptographic Protocols: The Spi Calculus. Information and Computation 148(1):1-70, 1999.
- November 9, Jacinta Poças
-
- Paulson, The inductive approach to verifying cryptographic protocols. Journal of Computer Security 6(1-2), 1998.
-
- November 16, Andreia Mordido
-
- Thayer, Herzog & Guttman, Strand spaces: proving security protocols correct. Journal of Computer Security 7:191-230, 1999.
-
- November 30, Aleksandar Stojanovic
-
- Durgin, Lincoln, Mitchell & Scedrov. The undecidability of bounded security protocols. In Proceedings of the Workshop on Formal Methods and Security Protocols, 1999.
- Ramanujam & Suresh, Deciding knowledge properties of security protocols. Proceedings of the 10th Conference on Theoretical Aspects of Rationality and Knowledge, pages 219-235, 2005.
-
- December 7, Jacinta Poças
-
- Caleiro, Viganò & Basin. Metareasoning about security protocols using distributed temporal logic. Electronic Notes in Theoretical Computer Science, 125(1):67-89, 2005.
- Basin, Caleiro, Ramos & Viganò. Distributed temporal logic for the analysis of security protocol models. Theoretical Computer Science, 412(31):4007-4043, 2011.
-
- December 14, Andreia Mordido
-
- Warinschi, A computational analysis of the Needham-Schroeder-(Lowe) protocol. Journal of Computer Security 13(3), 2005.
- Abadi & Rogaway, Reconciling Two Views of Cryptography - The Computational Soundness of Formal Encryption. LNCS 1872:3-22, 2000.
Assignments for October 12 (30 min. each)
21 setembro 2011, 15:56 • Carlos Caleiro
Andreia Mordido
Shannon, Communication Theory of Secrecy Systems. Bell System Technical Journal, vol. 28(4), page 656-715, 1949.
Jacinta Poças
Diffie & Hellman, New Directions in Cryptography. IEEE Transactions on Information Theory, vol. IT-22, Nov. 1976, pp: 644-654.
Rivest, Shamir & Adleman, A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the ACM 21 (2): 120-126, 1978.
Aleksandar Stojanovic
Goldreich, Micali & Wigderson, Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. Journal of the ACM, Volume 38 Issue 3, July 1991.