256 search results - page 42 / 52 » Reusing Static Keys in Key Agreement Protocols |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Tree-based protocols are ubiquitous in distributed systems. They are flexible, they perform generally well, and, in static conditions, their analysis is mostly simple. Under churn...
ASIACRYPT
2011
Springer
12 years 7 months ago
2011
Springer
A fundamental question in cryptography deals with understanding the role that randomness plays in cryptographic protocols and to what extent it is necessary. One particular line o...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
Abstract— Protocols for distributed hash tables (DHTs) incorporate features to achieve low latency for lookup requests in the face of churn, continuous changes in membership. The...
DATE
2007
IEEE
14 years 2 months ago
2007
IEEE
Everybody agrees that curing DFM/DFY issues is of paramount importance at 65 nanometers and beyond. Unfortunately, there is disagreement about how and when to cure them. “Surgeo...
EUROCRYPT
2008
Springer
13 years 9 months ago
2008
Springer
Secure multi-party computation (MPC) is a central problem in cryptography. Unfortunately, it is well known that MPC is possible if and only if the underlying communication network...