Sciweavers

224 search results - page 8 / 45
» Transformations between Cryptographic Protocols
Sort
View
TIT
2008
164views more  TIT 2008»
13 years 10 months ago
Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
Aggelos Kiayias, Moti Yung
PERCOM
2005
ACM
14 years 10 months ago
Security Parallels between People and Pervasive Devices
Unique and challenging security problems arise due to the scarcity of computational, storage, and power resources in the low-cost pervasive computing environment. Particularly rel...
Stephen A. Weis
SECPERU
2006
IEEE
14 years 4 months ago
Using One-Way Chains to Provide Message Authentication without Shared Secrets
The objective of this paper is to propose a cryptographic protocol which provides authenticity in the exchange of information between two entities without using any shared secret ...
Bogdan Groza
WIMOB
2008
IEEE
14 years 5 months ago
On the Energy Cost of Communication and Cryptography in Wireless Sensor Networks
Energy is a central concern in the deployment of wireless sensor networks. In this paper, we investigate the energy cost of cryptographic protocols, both from a communication and ...
Giacomo de Meulenaer, François Gosset, Fran...
COMCOM
2000
97views more  COMCOM 2000»
13 years 10 months ago
Verification of security protocols using LOTOS-method and application
We explain how the formal language LOTOS can be used to specify security protocols and cryptographic operations. We describe how security properties can be modelled as safety prop...
Guy Leduc, François Germeau