4340 search results - page 9 / 868 » Formal Methods and Cryptography |
129
click to vote
ICIP
2003
IEEE
16 years 1 months ago
2003
IEEE
This paper considers the problem of encoding a secret binary image SI into n shares of meaningful halftone images within the scheme of visual cryptography (VC). Secret pixels enco...
ICASSP
2009
IEEE
15 years 6 months ago
2009
IEEE
This paper introduces a color visual cryptography encryption method that produces meaningful color shares via visual information pixel (VIP) synchronization and error diffusion ha...
AICCSA
2006
IEEE
15 years 5 months ago
2006
IEEE
This paper proposes a new method to compute Elliptic Curve Cryptography in Galois Fields GF(p). The method incorporates pipelining to utilize the benefit of both parallel and seri...
117
click to vote
STOC
2009
ACM
16 years 8 days ago
2009
ACM
We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an n-bit secret W, which might not be uniformly random, but the ad...
DCC
2006
IEEE
15 years 11 months ago
2006
IEEE
Recently, Eisentr?ager et al. proposed a very elegant method for speeding up scalar multiplication on elliptic curves. Their method relies on improved formulas for evaluating S = (...