Sciweavers

5665 search results - page 215 / 1133
» Introduction to Computer Security
Sort
View
JPDC
2006
134views more  JPDC 2006»
15 years 2 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
107
Voted
CCS
2008
ACM
15 years 4 months ago
A look in the mirror: attacks on package managers
This work studies the security of ten popular package managers. These package managers use different security mechanisms that provide varying levels of usability and resilience to...
Justin Cappos, Justin Samuel, Scott M. Baker, John...
SKG
2006
IEEE
15 years 8 months ago
A New Method to Security Electronic Commerce Protocol
We use semi-regular entities to denote the entities different from penetrates that participate in the protocol on behalf of themselves such as customers in e-commerce.
Jie Yang, Hai-guang Mo, Yu-heng Long
AC
1998
Springer
15 years 6 months ago
The Search for the Holy Grail in Quantum Cryptography
Abstract. In 1982, Bennett and Brassard suggested a new way to provide privacy in long distance communications with security based on the correctness of the basic principles of qua...
Louis Salvail