242 search results - page 29 / 49 » Randomness in Cryptography |
JDCTA
2010
14 years 4 months ago
2010
In visual cryptography, the secret can be any written text, graphical representation, or picture. This technique, some time called visual secret sharing (VSS), allows visual infor...
95
Voted
IPL
2006
14 years 9 months ago
2006
The strongest well-known measure for the quality of a universal hash-function family H is its being -strongly universal, which measures, for randomly chosen h H, one's inabi...
102
Voted
EUROCRYPT
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. Recently, methods from provable security, that had been developped for the last twenty years within the research community, have been extensively used to support emerging...
CHES
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. It has recently been shown that logic circuits in the implementation of cryptographic algorithms, although protected by “secure” random masking schemes, leak side-cha...
COCO
2009
Springer
15 years 1 months ago
2009
Springer
We give polynomial time computable extractors for low-weight affince sources. A distribution is affine if it samples a random points from some unknown low dimensional subspace of ...