Sciweavers

360 search results - page 13 / 72
» On Protection by Layout Randomization
Sort
View
SIGKDD
2002
93views more  SIGKDD 2002»
14 years 9 months ago
Randomization in Privacy-Preserving Data Mining
Suppose there are many clients, each having some personal information, and one server, which is interested only in aggregate, statistically significant, properties of this informa...
Alexandre V. Evfimievski
58
Voted
WIMOB
2008
IEEE
15 years 3 months ago
Random Beacon for Privacy and Group Security
Abstract—Most contemporary security mechanisms and protocols include exchange of random or time-variant nonces as an essential means of protection against replay and other threat...
Aleksi Saarela, Jan-Erik Ekberg, Kaisa Nyberg
IEEEPACT
2006
IEEE
15 years 3 months ago
A low-cost memory remapping scheme for address bus protection
The address sequence on the processor-memory bus can reveal abundant information about the control flow of a program. This can lead to critical information leakage such as encryp...
Lan Gao, Jun Yang 0002, Marek Chrobak, Youtao Zhan...
COMCOM
2006
99views more  COMCOM 2006»
14 years 9 months ago
Applying 4-regular grid structures in large-scale access networks
4-Regular grid structures have been used in multiprocessor systems for decades due to a number of nice properties with regard to routing, protection, and restoration, together wit...
Jens Myrup Pedersen, Ahmed Patel, Thomas Phillip K...
CMS
2006
14 years 10 months ago
TAO: Protecting Against Hitlist Worms Using Transparent Address Obfuscation
Abstract. Sophisticated worms that use precomputed hitlists of vulnerable targets are especially hard to contain, since they are harder to detect, and spread at rates where even au...
Spyros Antonatos, Kostas G. Anagnostakis