165 search results - page 17 / 33 » Cryptographic Complexity Classes and Computational Intractab... |
162
click to vote
ICALP
2007
Springer
16 years 1 days ago
2007
Springer
We consider the problem of constructing efficient locally decodable codes in the presence of a computationally bounded adversary. Assuming the existence of one-way functions, we c...
152
click to vote
ECCV
2008
Springer
16 years 7 months ago
2008
Springer
Abstract. Class hierarchies are commonly used to reduce the complexity of the classification problem. This is crucial when dealing with a large number of categories. In this work, ...
174
click to vote
CRYPTO
2009
Springer
16 years 14 days ago
2009
Springer
Most of the work in the analysis of cryptographic schemes is concentrated in abstract adversarial models that do not capture side-channel attacks. Such attacks exploit various for...
174
click to vote
CRYPTO
2008
Springer
15 years 7 months ago
2008
Springer
We construct noninteractive statistical zero-knowledge (NISZK) proof systems for a variety of standard approximation problems on lattices, such as the shortest independent vectors...
147
click to vote
TWC
2008
15 years 5 months ago
2008
The study of the class of new spatial multiplexing architectures (SMAs) is continued. As introduced in Part I of this paper, the SMAs consist of joint design of rate and power all...