Sciweavers

179 search results - page 33 / 36
» On the Security of Some Proxy Blind Signature Schemes
Sort
View
CRYPTO
2006
Springer
125views Cryptology» more  CRYPTO 2006»
13 years 10 months ago
Automated Security Proofs with Sequences of Games
This paper presents the first automatic technique for proving not only protocols but also primitives in the exact security computational model. Automatic proofs of cryptographic pr...
Bruno Blanchet, David Pointcheval
WAIFI
2010
Springer
158views Mathematics» more  WAIFI 2010»
13 years 4 months ago
On the Efficiency and Security of Pairing-Based Protocols in the Type 1 and Type 4 Settings
Abstract. We focus on the implementation and security aspects of cryptographic protocols that use Type 1 and Type 4 pairings. On the implementation front, we report improved timing...
Sanjit Chatterjee, Darrel Hankerson, Alfred Meneze...
CHES
2009
Springer
140views Cryptology» more  CHES 2009»
14 years 6 months ago
On Tamper-Resistance from a Theoretical Viewpoint
Tamper-proof devices are pretty powerful. They can be used to have better security in applications. In this work we observe that they can also be maliciously used in order to defea...
Paulo Mateus, Serge Vaudenay
MOBIHOC
2005
ACM
14 years 5 months ago
An efficient scheme for authenticating public keys in sensor networks
With the advance of technology, Public Key Cryptography (PKC) will sooner or later be widely used in wireless sensor networks. Recently, it has been shown that the performance of ...
Wenliang Du, Ronghua Wang, Peng Ning
MOBIQUITOUS
2005
IEEE
13 years 12 months ago
Defend Against Cache Consistency Attacks in Wireless Ad Hoc Networks
Caching techniques can be used to reduce bandwidth consumption and data access delay in wireless ad hoc networks. When cache is used, cache consistency issues must be addressed. T...
Wensheng Zhang, Guohong Cao