148 search results - page 6 / 30 » ccs 2006 |
AAECC
2006
Springer
13 years 9 months ago
2006
Springer
Cyclicity of a convolutional code (CC) is relying on a nontrivial automorphism of the algebra F[x]/(xn - 1), where F is a finite field. A particular choice of the data leads to th...
CCS
2006
ACM
14 years 1 months ago
2006
ACM
We introduce a simple primitive called Augmented Broadcast Encryption (ABE) that is sufficient for constructing broadcast encryption, traitor-tracing, and trace-and-revoke systems...
CCS
2006
ACM
14 years 1 months ago
2006
ACM
Let us have an NLFSR with the feedback function g(x) and an LFSR with the generating polynomial f(x). The function g(x) is a Boolean function on the state of the NLFSR and the LFS...
CCS
2006
ACM
14 years 1 months ago
2006
ACM
In this paper, we present a way to think about the relative strength of security protocols using SoS, a lattice-theoretic representation of security strength. In particular, we di...
CCS
2006
ACM
14 years 1 months ago
2006
ACM
Programmers of large-scale trusted systems need tools to simplify tasks such as replicating services or data. Group communication systems achieve this via various flavors of relia...