165 search results - page 17 / 33 » Cryptographic Complexity Classes and Computational Intractab... |
110
click to vote
ICALP
2007
Springer
15 years 7 months 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...
106
Voted
ECCV
2008
Springer
16 years 3 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, ...
125
click to vote
CRYPTO
2009
Springer
15 years 8 months 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...
117
Voted
CRYPTO
2008
Springer
15 years 3 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...
TWC
2008
15 years 1 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...