4908 search results - page 784 / 982 » On the Complexity of Optimal K-Anonymity |
291
click to vote
CRYPTO
2004
Springer
15 years 12 months ago
2004
Springer
In the bare public-key model (BPK in short), each verifier is assumed to have deposited a public key in a file that is accessible by all users at all times. In this model, intro...
140
click to vote
ESA
2004
Springer
15 years 12 months ago
2004
Springer
Many network applications that need to distribute content and data to a large number of clients use a hybrid scheme in which one (or more) multicast channel is used in parallel to...
150
click to vote
ESA
2004
Springer
15 years 12 months ago
2004
Springer
We study polynomials of degree up to 4 over the rationals or a computable real subfield. Our motivation comes from the need to evaluate predicates in nonlinear computational geome...
163
click to vote
ESTIMEDIA
2004
Springer
15 years 12 months ago
2004
Springer
Abstract— This paper presents an exploration framework which performs data assignment and access scheduling exploration for applications given a multilayer memory architecture. O...
147
click to vote
EUROCRYPT
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. We present a technique for Merkle tree traversal which requires only logarithmic space and time1 . For a tree with N nodes, our algorithm computes sequential tree leaves ...