111 search results - page 19 / 23 » Errors in Computational Complexity Proofs for Protocols |
CCS
2008
ACM
13 years 10 months ago
2008
ACM
We extend the Camenisch-Lysyanskaya anonymous credential system such that selective disclosure of attributes becomes highly efficient. The resulting system significantly improves ...
STOC
2010
ACM
14 years 21 days ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
HPCA
2003
IEEE
14 years 9 months ago
2003
IEEE
We consider the impact of different communication architectures on the performability (performance + availability) of cluster-based servers. In particular, we use a combination of ...
DAC
2011
ACM
12 years 8 months ago
2011
ACM
As transistor dimensions continue to scale deep into the nanometer regime, silicon reliability is becoming a chief concern. At the same time, transistor counts are scaling up, ena...
QSHINE
2005
IEEE
14 years 2 months ago
2005
IEEE
Protocols designed to provide error-free communications over lossy links, at both data link and transport layers, commonly employ the idea of sliding windows, which is based on th...