Sciweavers

1769 search results - page 227 / 354
» Cryptography
Sort
View
STOC
2002
ACM
80views Algorithms» more  STOC 2002»
14 years 10 months ago
Strict polynomial-time in simulation and extraction
The notion of efficient computation is usually identified in cryptography and complexity with (strict) probabilistic polynomial time. However, until recently, in order to obtain c...
Boaz Barak, Yehuda Lindell
MOBISYS
2007
ACM
14 years 9 months ago
Addressing security in medical sensor networks
We identify the security challenges facing a sensor network for wireless health monitoring, and propose an architecture called "SNAP" (Sensor Network for Assessment of P...
Kriangsiri Malasri, Lan Wang
MOBIHOC
2007
ACM
14 years 9 months ago
Containing denial-of-service attacks in broadcast authentication in sensor networks
Broadcast authentication is an important application in sensor networks. Public Key Cryptography (PKC) is desirable for this application, but due to the resource constraints on se...
Ronghua Wang, Wenliang Du, Peng Ning
DCC
2007
IEEE
14 years 9 months ago
On binary signed digit representations of integers
Applications of signed digit representations of an integer include computer arithmetic, cryptography, and digital signal processing. An integer of length n bits can have several b...
Nevine Maurice Ebeid, M. Anwar Hasan
DCC
2005
IEEE
14 years 9 months ago
Elliptic Curve Cryptosystems in the Presence of Permanent and Transient Faults
Elliptic curve cryptosystems in the presence of faults were studied by Biehl, Meyer and M?uller (2000). The first fault model they consider requires that the input point P in the c...
Mathieu Ciet, Marc Joye