23036 search results - page 4442 / 4608 » Sketching informal presentations |
191
click to vote
CRYPTO
2001
Springer
15 years 11 months ago
2001
Springer
Consider a scenario where an l-bit secret has been distributed among n players by an honest dealer using some secret sharing scheme. Then, if all players behave honestly, the secre...
146
click to vote
EUROCRYPT
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. We consider the question of protecting the privacy of customers buying digital goods. More specifically, our goal is to allow a buyer to purchase digital goods from a ve...
183
click to vote
EUROCRYPT
2001
Springer
15 years 11 months ago
2001
Springer
We formalize the notion of a cryptographic counter, which allows a group of participants to increment and decrement a cryptographic representation of a (hidden) numerical value pri...
218
click to vote
ICALP
2001
Springer
15 years 11 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
184
click to vote
LPAR
2001
Springer
15 years 11 months ago
2001
Springer
Several logic-based languages, such as Prolog II and its successors, SICStus Prolog and Oz, offer a computation domain including rational trees. Infinite rational trees allow fo...