Sciweavers

517 search results - page 35 / 104
» Bit Encryption Is Complete
Sort
View
ECCC
2000
120views more  ECCC 2000»
13 years 7 months ago
A Complete Problem for Statistical Zero Knowledge
Abstract. We present the first complete problem for SZK, the class of promise problems possessing statistical zero-knowledge proofs (against an honest verifier). The problem, calle...
Amit Sahai, Salil P. Vadhan
CISS
2010
IEEE
12 years 11 months ago
Transmission completion time minimization in an energy harvesting system
Abstract—We consider the transmission completion time minimization problem in a single-user energy harvesting wireless communication system. In this system, both the data packets...
Jing Yang, Sennur Ulukus
ASIACRYPT
2009
Springer
13 years 11 months ago
Hedged Public-Key Encryption: How to Protect against Bad Randomness
Abstract. Public-key encryption schemes rely for their IND-CPA security on per-message fresh randomness. In practice, randomness may be of poor quality for a variety of reasons, le...
Mihir Bellare, Zvika Brakerski, Moni Naor, Thomas ...
WWW
2003
ACM
14 years 8 months ago
An Effective Complete-Web Recommender System
There are a number of recommendation systems that can suggest the webpages, within a single website, that other (purportedly similar) users have visited. By contrast, our goal is ...
Gerald Häubl, Russell Greiner, Tingshao Zhu
INFOCOM
2012
IEEE
11 years 10 months ago
BitTrickle: Defending against broadband and high-power reactive jamming attacks
—Reactive jamming is not only cost effective, but also hard to track and remove due to its intermittent jamming behaviors. Frequency Hopping Spread Spectrum (FHSS) and Direct Seq...
Yao Liu, Peng Ning