Sciweavers

2421 search results - page 151 / 485
» Message from the Co-Chairs
Sort
View
APPROX
2011
Springer
272views Algorithms» more  APPROX 2011»
12 years 9 months ago
Public Key Locally Decodable Codes with Short Keys
This work considers locally decodable codes in the computationally bounded channel model. The computationally bounded channel model, introduced by Lipton in 1994, views the channe...
Brett Hemenway, Rafail Ostrovsky, Martin J. Straus...
CEAS
2011
Springer
12 years 9 months ago
Spam or ham?: characterizing and detecting fraudulent "not spam" reports in web mail systems
Web mail providers rely on users to “vote” to quickly and collaboratively identify spam messages. Unfortunately, spammers have begun to use bots to control large collections o...
Anirudh Ramachandran, Anirban Dasgupta, Nick Feams...
IACR
2011
94views more  IACR 2011»
12 years 9 months ago
After-the-Fact Leakage in Public-Key Encryption
What does it mean for an encryption scheme to be leakage-resilient? Prior formulations require that the scheme remains semantically secure even in the presence of leakage, but onl...
Shai Halevi, Huijia Lin
ICDCS
2011
IEEE
12 years 9 months ago
JR-SND: Jamming-Resilient Secure Neighbor Discovery in Mobile Ad Hoc Networks
Abstract—Secure neighbor discovery is fundamental to mobile ad hoc networks (MANETs) deployed in hostile environments and refers to the process in which two neighboring nodes exc...
Rui Zhang 0007, Yanchao Zhang, Xiaoxia Huang
CRYPTO
2012
Springer
327views Cryptology» more  CRYPTO 2012»
11 years 11 months ago
Functional Encryption for Regular Languages
We provide a functional encryption system that supports functionality for regular languages. In our system a secret key is associated with a Deterministic Finite Automata (DFA) M....
Brent Waters