2421 search results - page 211 / 485 » Message from the Co-Chairs |
133
click to vote
PODC
2003
ACM
15 years 11 months ago
2003
ACM
Consider a dynamic, large-scale communication infrastructure (e.g., the Internet) where nodes (e.g., in a peer to peer system) can communicate only with nodes whose id (e.g., IP a...
170
click to vote
ASIACRYPT
2001
Springer
15 years 10 months ago
2001
Springer
The number of communication rounds is a classic complexity measure for protocols; reducing round complexity is a major goal in protocol design. However, when the communication time...
218
click to vote
CRYPTO
2001
Springer
15 years 10 months ago
2001
Springer
We deal with the problem of a center sending a message to a group of users such that some subset of the users is considered revoked and should not be able to obtain the content of...
156
click to vote
NDSS
1999
IEEE
15 years 10 months ago
1999
IEEE
We present protocols that allow a user Alice, knowing only her name and password, and not carrying a smart card, to "log in to the network" from a "generic" wo...
167
click to vote
AI
1998
Springer
15 years 10 months ago
1998
Springer
The evaluation of a large implemented natural language processing system involves more than its application to a common performance task. Such tasks have been used in the message u...