Sciweavers

2601 search results - page 342 / 521
» Secure Rewarding Schemes
Sort
View
INFOCOM
2005
IEEE
15 years 10 months ago
Group rekeying for filtering false data in sensor networks: a predistribution and local collaboration-based approach
— When a sensor network is deployed in hostile environments, the adversary may compromise some sensor nodes, and use the compromised nodes to inject false sensing reports or modi...
Wensheng Zhang, Guohong Cao
ASIACRYPT
2009
Springer
15 years 11 months ago
Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices
Abstract. We describe a public-key encryption scheme based on lattices — specifically, based on the hardness of the learning with error (LWE) problem — that is secure against ...
Jonathan Katz, Vinod Vaikuntanathan
CCS
2005
ACM
15 years 10 months ago
Automated trust negotiation using cryptographic credentials
In automated trust negotiation (ATN), two parties exchange digitally signed credentials that contain attribute information to establish trust and make access control decisions. Be...
Jiangtao Li, Ninghui Li, William H. Winsborough
EUROCRYPT
2005
Springer
15 years 10 months ago
On Robust Combiners for Oblivious Transfer and Other Primitives
A (1,2)-robust combiner for a cryptographic primitive P is a construction that takes two candidate schemes for P and combines them into one scheme that securely implement P even i...
Danny Harnik, Joe Kilian, Moni Naor, Omer Reingold...
SASN
2003
ACM
15 years 9 months ago
Location-based pairwise key establishments for static sensor networks
Sensor networks are ideal candidates for applications such as target tracking and environment monitoring. Security in sensor networks is critical when there are potential adversar...
Donggang Liu, Peng Ning