10304 search results - page 1765 / 2061 » Computer science with the sciences: an emphasis in computati... |
145
click to vote
ICALP
2005
Springer
16 years 6 days ago
2005
Springer
Abstract An encryption scheme is non-malleable if the adversary cannot transform a ciphertext into one of a related message under the given public key. Although providing a very st...
157
click to vote
ICALP
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. We generalize the k-means algorithm presented by the authors [14] and show that the resulting algorithm can solve a larger class of clustering problems that satisfy certa...
167
click to vote
ICALP
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. In this paper we attempt to formally study two very intuitive physical models: sealed envelopes and locked boxes, often used as illustrations for common cryptographic ope...
166
click to vote
ICTCS
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. We consider the problem of maintaining polynomial and exponential decay aggregates of a data stream, where the weight of values seen from the stream diminishes as time el...
190
click to vote
MFCS
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...