1058 search results - page 153 / 212 » Secure Group Communications Using Key Graphs |
138
click to vote
ISCA
2002
IEEE
14 years 9 months ago
2002
IEEE
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
CCS
2007
ACM
15 years 4 months ago
2007
ACM
Distance bounding protocols have been proposed as means of detecting relay attacks, also known as mafia fraud. In this paper we present the first symmetric key based distance bou...
IEEEARES
2006
IEEE
15 years 3 months ago
2006
IEEE
The raising need for e-government applications leads to many new approaches in this sector. To fulfill the requirement for a flexible government-to-government (G2G) software sys...
69
Voted
WIMOB
2008
IEEE
15 years 4 months ago
2008
IEEE
—Wireless networking is currently dominated by radio frequency (RF) techniques. However, the soon-to-be ubiquity of LED-based lighting motivated by significant energy savings pro...
CCS
2008
ACM
14 years 11 months ago
2008
ACM
The requirements for secure document workflows in enterprises become increasingly sophisticated, with employees performing different tasks under different roles using the same pro...