Sciweavers

2699 search results - page 324 / 540
» On Evaluating the Performance of Security Protocols
Sort
View
SIGCOMM
2010
ACM
15 years 6 months ago
Symbiotic routing in future data centers
Building distributed applications for data centers is hard. CamCube explores whether replacing the traditional switchbased network with a directly connected topology makes it easi...
Hussam Abu-Libdeh, Paolo Costa, Antony I. T. Rowst...
SECPERU
2006
IEEE
16 years 18 days ago
Detecting Critical Nodes for MANET Intrusion Detection Systems
Ad hoc routing protocols have been designed to efficiently reroute traffic when confronted with network congestion, faulty nodes, and dynamically changing topologies. The common d...
A. Karygiannis, E. Antonakakis, A. Apostolopoulos
SP
2009
IEEE
106views Security Privacy» more  SP 2009»
16 years 1 months ago
Pretty-Bad-Proxy: An Overlooked Adversary in Browsers' HTTPS Deployments
– HTTPS is designed to provide secure web communications over insecure networks. The protocol itself has been rigorously designed and evaluated by assuming the network as an adve...
Shuo Chen, Ziqing Mao, Yi-Min Wang, Ming Zhang
CLUSTER
2007
IEEE
15 years 6 months ago
Meta-communications in component-based communication frameworks for grids
— Applications are faced with several network-related problems on current grids: heterogeneous networks, firewalls, NAT, private IP addresses, non-routed networks, performance p...
Alexandre Denis
TIT
2008
164views more  TIT 2008»
15 years 6 months ago
Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
Aggelos Kiayias, Moti Yung