Sciweavers

5891 search results - page 411 / 1179
» On the Computational Security of a Distributed Key Distribut...
Sort
View
JPDC
2006
134views more  JPDC 2006»
15 years 6 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
MICRO
2003
IEEE
148views Hardware» more  MICRO 2003»
16 years 5 days ago
Fast Secure Processor for Inhibiting Software Piracy and Tampering
Due to the widespread software piracy and virus attacks, significant efforts have been made to improve security for computer systems. For stand-alone computers, a key observation...
Jun Yang 0002, Youtao Zhang, Lan Gao
ECRIME
2007
15 years 10 months ago
Evaluating a trial deployment of password re-use for phishing prevention
We propose a scheme that exploits scale to prevent phishing. We show that while stopping phishers from obtaining passwords is very hard, detecting the fact that a password has bee...
Dinei A. F. Florêncio, Cormac Herley
ICPADS
2005
IEEE
16 years 15 days ago
An Adaptive Multiparty Protocol for Secure Data Protection
To better protect information systems, computation time data protection needs to be considered such that even when the system is partially compromised, the security of the system ...
Qingkai Ma, Liangliang Xiao, I-Ling Yen, Manghui T...
SKG
2006
IEEE
16 years 27 days ago
Security Attack Ontology for Web Services
Web services (WS) have become a significant part of the Web because of such attractive features as simple to use, platform independence, and XML/SOAP support. However, these featu...
Artem Vorobiev, Jun Han