Sciweavers

5476 search results - page 857 / 1096
» Resettably Secure Computation
Sort
View
NDSS
1998
IEEE
15 years 11 months ago
Efficient Protocols for Signing Routing Messages
In this work, we aim to reduce the computational costs of using public-key digital signatures in securing routing protocols. Two protocols (COSP and IOSP) using one-time digitalsi...
Kan Zhang
ICDCS
2010
IEEE
15 years 10 months ago
Quantifying and Querying Network Reachability
—Quantifying and querying network reachability is important for security monitoring and auditing as well as many aspects of network management such as troubleshooting, maintenanc...
Amir R. Khakpour, Alex X. Liu
FTDCS
2004
IEEE
15 years 10 months ago
Self-Aware Distributed Embedded Systems
Distributed embedded sensor networks are now being successfully deployed in environmental monitoring of natural phenomena as well as for applications in commerce and physical secu...
Richard Pon, Maxim A. Batalin, Mohammad H. Rahimi,...
EUROCRYPT
2006
Springer
15 years 10 months ago
The Function Field Sieve in the Medium Prime Case
In this paper, we study the application of the function field sieve algorithm for computing discrete logarithms over finite fields of the form Fqn when q is a medium-sized prime po...
Antoine Joux, Reynald Lercier
GCC
2006
Springer
15 years 10 months ago
UGE4B: An Universal Grid Environment for Bioinformatics Research
Recent years, grid technology has been used widely in the fields of scientific research. In this paper, we present an universal grid environment for Bioinformatics Research (UGE4B...
Gang Chen, Yongwei Wu, Weimin Zheng