139 search results - page 8 / 28 » Cryptographic Randomized Response Techniques |
CCS
2005
ACM
14 years 3 months 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...
EUROCRYPT
2004
Springer
14 years 3 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)...
ASIACRYPT
2011
Springer
12 years 9 months ago
2011
Springer
A fundamental question in cryptography deals with understanding the role that randomness plays in cryptographic protocols and to what extent it is necessary. One particular line o...
RSA
2000
13 years 9 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...
ACSAC
2007
IEEE
14 years 4 months ago
2007
IEEE
We propose a taxonomy of botnet structures, based on their utility to the botmaster. We propose key metrics to measure their utility for various activities (e.g., spam, ddos). Usi...