Sciweavers

3504 search results - page 146 / 701
» Secure protocol composition
Sort
View
FROCOS
2007
Springer
15 years 11 months ago
Combining Algorithms for Deciding Knowledge in Security Protocols
Abstract. In formal approaches, messages sent over a network are usually modeled by terms together with an equational theory, axiomatizing the properties of the cryptographic funct...
Mathilde Arnaud, Véronique Cortier, St&eacu...
PERCOM
2005
ACM
16 years 4 months ago
A Scalable and Provably Secure Hash-Based RFID Protocol
The biggest challenge for RFID technology is to provide benefits without threatening the privacy of consumers. Many solutions have been suggested but almost as many ways have been...
Gildas Avoine, Philippe Oechslin
124
Voted
IACR
2011
84views more  IACR 2011»
14 years 4 months ago
Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting
In this paper, we explore a general methodology for converting composite order pairingbased cryptosystems into the prime order setting. We employ the dual pairing vector space app...
Allison B. Lewko
JCS
2011
156views more  JCS 2011»
14 years 12 months ago
Securing low-cost RFID systems: An unconditionally secure approach
We explore a new direction towards solving the identity authentication problem in RFID systems. We break the RFID authentication process into two main problems: message authenticat...
Basel Alomair, Loukas Lazos, Radha Poovendran
LPAR
2007
Springer
15 years 11 months ago
Deciding Knowledge in Security Protocols for Monoidal Equational Theories
Abstract. In formal approaches, messages sent over a network are usually modeled by terms together with an equational theory, axiomatizing the properties of the cryptographic funct...
Véronique Cortier, Stéphanie Delaune