13214 search results - page 34 / 2643 » Pseudorandomness for network algorithms |
127
Voted
APPROX
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We give a generic construction of an optimal hitting set generator (HSG) from any good “reconstructive” disperser. Past constructions of optimal HSGs have been based ...
185
click to vote
CIT
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Both encryption and digital watermarking techniques need to be incorporated in a digital rights management framework to address different aspects of content management. W...
129
click to vote
VTS
2003
IEEE
15 years 11 months ago
2003
IEEE
Reseeding is used to improve fault coverage in pseudo-random testing. Most of the work done on reseeding is based on storing the seeds in an external tester. Besides its high cost...
168
click to vote
IJNSEC
2010
15 years 13 days ago
2010
Digital Signature Algorithm (DSA) is an underlying algorithm to form a signature in the Digital Signature Standard (DSS). DSA uses a new random number (or nonce) each time a signa...
176
click to vote
SASN
2005
ACM
15 years 11 months ago
2005
ACM
Many emerging applications in both wired and wireless networks, such as information dissemination and distributed collaboration in an adversarial environment, need support of secu...