Sciweavers

3130 search results - page 33 / 626
» Collusion without communication
Sort
View
CRYPTO
2005
Springer
125views Cryptology» more  CRYPTO 2005»
15 years 5 months ago
Secure Computation Without Authentication
In the setting of secure multiparty computation, a set of parties wish to jointly compute some function of their inputs. Such a computation must preserve certain security propertie...
Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pa...
CCR
2007
107views more  CCR 2007»
14 years 11 months ago
Dynamic load balancing without packet reordering
Dynamic load balancing is a popular recent technique that protects ISP networks from sudden congestion caused by load spikes or link failures. Dynamic load balancing protocols, ho...
Srikanth Kandula, Dina Katabi, Shantanu Sinha, Art...
EUROCRYPT
2003
Springer
15 years 5 months ago
On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions
The recently proposed universally composable (UC) security framework for analyzing security of cryptographic protocols provides very strong security guarantees. In particular, a p...
Ran Canetti, Eyal Kushilevitz, Yehuda Lindell
IMC
2010
ACM
14 years 9 months ago
Speed testing without speed tests: estimating achievable download speed from passive measurements
How fast is the network? The speed at which real users can download content at different locations and at different times is an important metric for service providers. Knowledge o...
Alexandre Gerber, Jeffrey Pang, Oliver Spatscheck,...
MOBIHOC
2007
ACM
15 years 11 months ago
Surviving attacks on disruption-tolerant networks without authentication
Disruption-Tolerant Networks (DTNs) deliver data in network environments composed of intermittently connected nodes. Just as in traditional networks, malicious nodes within a DTN ...
John Burgess, George Dean Bissias, Mark D. Corner,...