1058 search results - page 47 / 212 » Secure Group Communications Using Key Graphs |
100
click to vote
TCC
2005
Springer
15 years 6 months ago
2005
Springer
Adaptively-secure encryption schemes ensure secrecy even in the presence of an adversary who can corrupt parties in an adaptive manner based on public keys, ciphertexts, and secret...
139
Voted
SCN
2010
Springer
14 years 10 months ago
2010
Springer
Serge Vaudenay [20] introduced a notion of Message Authentication (MA) protocols in the Short Authenticated String (SAS) model. A SAS-MA protocol authenticates arbitrarily long mes...
113
click to vote
EUROCRYPT
2010
Springer
15 years 5 months ago
2010
Springer
We develop an abstract framework that encompasses the key properties of bilinear groups of composite order that are required to construct secure pairing-based cryptosystems, and we...
108
Voted
JSC
2010
14 years 11 months ago
2010
We examine designs and binary codes associated with the line graph of the n-cube Qn, i.e. the Hamming graph H(n, 2). We find the automorphism groups and the parameters of the cod...
100
Voted
JUCS
2007
15 years 13 days ago
2007
: For modeling real-life situations where not only the intensity of the relation existing between elements but also its polarity is important, we have proposed (see [Marcus and Tat...