5476 search results - page 1059 / 1096 » Resettably Secure Computation |
112
click to vote
FOCS
2002
IEEE
15 years 7 months ago
2002
IEEE
Randomization is vital in cryptography: secret keys should be randomly generated and most cryptographic primitives (e.g., encryption) must be probabilistic. As a bstraction, it is...
115
click to vote
ICALP
2010
Springer
15 years 6 months ago
2010
Springer
Knowledge extraction is a fundamental notion, modeling machine possession of values (witnesses) in a computational complexity sense and enabling one to argue about the internal st...
160
click to vote
SAC
2000
ACM
15 years 6 months ago
2000
ACM
The global scenario put together by communication networks determines new opportunities towards the realization of Internetbased distributed services in many complex and composite...
115
click to vote
CRYPTO
2000
Springer
15 years 6 months ago
2000
Springer
Abstract. The braid groups are infinite non-commutative groups naturally arising from geometric braids. The aim of this article is twofold. One is to show that the braid groups ca...
109
click to vote
SIGGRAPH
1999
ACM
15 years 6 months ago
1999
ACM
A multi-color dithering algorithm is proposed, which converts a barycentric combination of color intensities into a multi-color nonoverlapping surface coverage. Multi-color dither...