Sciweavers

208 search results - page 19 / 42
» Variationally universal hashing
Sort
View
CRYPTO
2000
Springer
277views Cryptology» more  CRYPTO 2000»
15 years 1 months ago
Almost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic Applications
The best known constructions for arrays with low bias are those from [1] and the exponential sum method based on the WeilCarlitz-Uchiyama bound. They all yield essentially the same...
Jürgen Bierbrauer, Holger Schellwat
ICIP
2005
IEEE
15 years 3 months ago
Mining arbitrary-length repeated patterns in television broadcast
Mining repeated patterns in television broadcast is important to advertisers in tracking a large number of television commercials. It can also benefit long-term archival of telev...
Sen-Ching S. Cheung, Thinh Nguyen
NORDSEC
2009
Springer
15 years 4 months ago
Towards True Random Number Generation in Mobile Environments
In our paper, we analyze possibilities to generate true random data in mobile devices such as mobile phones or pocket computers. We show how to extract arguably true random data w...
Jan Bouda, Jan Krhovjak, Vashek Matyas, Petr Svend...
ACNS
2007
Springer
129views Cryptology» more  ACNS 2007»
15 years 3 months ago
Gradually Convertible Undeniable Signatures
In 1990, Boyar, Chaum, Damg˚ard and Pedersen introduced convertible undeniable signatures which limit the self-authenticating property of digital signatures but can be converted b...
Laila El Aimani, Damien Vergnaud
ACSAC
2003
IEEE
15 years 2 months ago
Practical Random Number Generation in Software
There is a large gap between the theory and practice for random number generation. For example, on most operating systems, using /dev/random to generate a 256-bit AES key is highl...
John Viega