Sciweavers

360 search results - page 16 / 72
» On Protection by Layout Randomization
Sort
View
ACISP
2009
Springer
15 years 7 months ago
Random Order m-ary Exponentiation
This paper describes a m-ary exponentiation algorithm where the radix-m digits of an exponent can be treated in a somewhat random order without using any more group operations than...
Michael Tunstall
ASIACRYPT
2007
Springer
15 years 8 months ago
Fully Anonymous Group Signatures Without Random Oracles
We construct a new group signature scheme using bilinear groups. The group signature scheme is practical, both keys and group signatures consist of a constant number of group elem...
Jens Groth
ICC
2009
IEEE
127views Communications» more  ICC 2009»
15 years 9 months ago
Wireless Location Privacy Protection in Vehicular Ad-Hoc Networks
Abstract—Advances in mobile networks and positioning technologies have made location information a valuable asset in vehicular ad-hoc networks (VANETs). However, the availability...
Joo-Han Song, Vincent W. S. Wong, Victor C. M. Leu...
ISSRE
2010
IEEE
15 years 12 days ago
Preventing Overflow Attacks by Memory Randomization
Buffer overflow is known to be a common memory vulnerability affecting software. It is exploited to gain various kinds of privilege escalation. C and C++ are very commonly used to ...
Vivek Iyer, Amit Kanitkar, Partha Dasgupta, Raghun...
119
Voted
ICIP
2010
IEEE
15 years 14 days ago
Fast semantic scene segmentation with conditional random field
In this paper, we present a fast approach to obtain semantic scene segmentation with high precision. We employ a two-stage classifier to label all image pixels. First, we use the ...
Wen Yang, Dengxin Dai, Bill Triggs, Gui-Song Xia, ...