Sciweavers

135 search results - page 8 / 27
» Towards Key-Dependent Message Security in the Standard Model
Sort
View
77
Voted
ESORICS
2002
Springer
15 years 9 months ago
Analysing a Stream Authentication Protocol Using Model Checking
Abstract. In this paper, we consider how one can analyse a stream authentication protocol using model checking techniques. In particular, we will be focusing on the Timed Efficient...
Philippa J. Broadfoot, Gavin Lowe
98
Voted
FMCO
2003
Springer
121views Formal Methods» more  FMCO 2003»
15 years 2 months ago
TulaFale: A Security Tool for Web Services
Web services security specifications are typically expressed as a mixture of XML schemas, example messages, and narrative explanations. We propose a new specification language fo...
Karthikeyan Bhargavan, Cédric Fournet, Andr...
73
Voted
CSFW
2009
IEEE
15 years 4 months ago
Decidable Analysis for a Class of Cryptographic Group Protocols with Unbounded Lists
Cryptographic protocols are crucial for securing electronic transactions. The confidence in these protocols can be increased by the formal analysis of their security properties. ...
Najah Chridi, Mathieu Turuani, Michaël Rusino...
IJDAR
2007
106views more  IJDAR 2007»
14 years 9 months ago
Investigation and modeling of the structure of texting language
Language usage over computer mediated discourses, like chats, emails and SMS texts, significantly differs from the standard form of the language. An urge towards shorter message l...
Monojit Choudhury, Rahul Saraf, Vijit Jain, Animes...
71
Voted
PKC
2005
Springer
110views Cryptology» more  PKC 2005»
15 years 3 months ago
From Fixed-Length to Arbitrary-Length RSA Encoding Schemes Revisited
To sign with RSA, one usually encodes the message m as µ(m) and then raises the result to the private exponent modulo N. In Asiacrypt 2000, Coron et al. showed how to build a secu...
Julien Cathalo, Jean-Sébastien Coron, David...