5606 search results - page 285 / 1122 » Randomization Techniques for Graphs. |
176
click to vote
MICRO
2009
IEEE
16 years 1 months ago
2009
IEEE
The phase-change random access memory (PRAM) technology is fast maturing to production levels. Main advantages of PRAM are non-volatility, byte addressability, in-place programmab...
175
click to vote
CCS
2005
ACM
16 years 2 days ago
2005
ACM
We describe a new encryption technique that is secure in the standard model against adaptive chosen ciphertext (CCA2) attacks. We base our method on two very efficient Identity-Ba...
187
click to vote
EUROCRYPT
2004
Springer
15 years 12 months ago
2004
Springer
Informally, an obfuscator O is an efficient, probabilistic “compiler” that transforms a program P into a new program O(P) with the same functionality as P, but such that O(P)...
163
click to vote
PLDI
2005
ACM
16 years 2 days ago
2005
ACM
We present a new tool, named DART, for automatically testing software that combines three main techniques: (1) automated extraction of the interface of a program with its external...
189
click to vote
RSA
2000
15 years 6 months ago
2000
We analyze various stochastic processes for generating permutations almost uniformly at random in distributed and parallel systems. All our protocols are simple, elegant and are b...