2967 search results - page 468 / 594 » Cryptology |
153
Voted
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...
154
click to vote
ASIACRYPT
2001
Springer
15 years 10 months ago
2001
Springer
The aim of this article is to propose a fully distributed environment for the RSA scheme. What we have in mind is highly sensitive applications and even if we are ready to pay a pr...
161
Voted
CRYPTO
2001
Springer
15 years 9 months ago
2001
Springer
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
168
click to vote
CRYPTO
2001
Springer
15 years 9 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...
205
Voted
CRYPTO
2001
Springer
15 years 9 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...