3341 search results - page 420 / 669 » On Bounded Queries and Approximation |
172
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
158
click to vote
ALT
2002
Springer
16 years 3 months ago
2002
Springer
Abstract. We consider a problem that is related to the “Universal Encoding Problem” from information theory. The basic goal is to find rules that map “partial information”...
142
click to vote
AFRICACRYPT
2008
Springer
16 years 1 months ago
2008
Springer
In this paper, we investigate the security of the Tractable Rationale Maps Signature (TRMS) signature scheme [9] proposed at PKC’05. To do so, we present a hybrid approach for so...
176
click to vote
COCOON
2007
Springer
16 years 24 days ago
2007
Springer
The last decade witnessed the extensive studies of algorithms for data streams. In this model, the input is given as a sequence of items passing only once or a few times, and we ar...
182
click to vote
FSTTCS
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. This paper proposes a new algorithm that improves the complexity bound for solving parity games. Our approach combines McNaughton’s iterated fixed point algorithm with...