1058 search results - page 90 / 212 » Secure Group Communications Using Key Graphs |
125
Voted
SOUPS
2009
ACM
15 years 9 months ago
2009
ACM
Initiating and bootstrapping secure, yet low-cost, ad-hoc transactions is an important challenge that needs to be overcome if the promise of mobile and pervasive computing is to b...
123
click to vote
ACSC
2008
IEEE
15 years 9 months ago
2008
IEEE
We propose a more efficient privacy preserving set intersection protocol which improves the previously known result by a factor of O(N) in both the computation and communication c...
137
click to vote
FC
1998
Springer
15 years 6 months ago
1998
Springer
In this paper we construct a practical group blind signature scheme. Our scheme combines the already existing notions of blind signatures and group signatures. It is an extension o...
126
click to vote
INDOCRYPT
2005
Springer
15 years 8 months ago
2005
Springer
We propose a scheme for electronic cash based on symmetric primitives. The scheme is secure in the framework for universal composability assuming the existence of a symmetric CCA2-...
146
click to vote
ICICS
2009
Springer
15 years 9 months ago
2009
Springer
We propose a novel approach for statistical risk modeling of network attacks that lets an operator perform risk analysis using a data model and an impact model on top of an attack ...