2237 search results - page 299 / 448 » On the Security of Random Sources |
138
click to vote
STOC
2003
ACM
16 years 5 months ago
2003
ACM
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
145
click to vote
ACSAC
2009
IEEE
15 years 12 months ago
2009
IEEE
—We take a systematic approach to developing a symmetric cryptography library in Javascript. We study various strategies for optimizing the code for the Javascript interpreter, a...
127
Voted
CSE
2009
IEEE
15 years 12 months ago
2009
IEEE
Conventional cryptography uses encryption key, which are long bit strings and are very hard to memorize such a long random numbers. Also it can be easily attacked by using the brut...
177
click to vote
SP
2009
IEEE
15 years 12 months ago
2009
IEEE
Malware authors have recently begun using emulation technology to obfuscate their code. They convert native malware binaries into bytecode programs written in a randomly generated...
146
click to vote
CIKM
2009
Springer
15 years 11 months ago
2009
Springer
We consider the problem of releasing a limited public view of a sensitive graph which reveals at least k edges per node. We are motivated by Facebook’s public search listings, w...