2601 search results - page 363 / 521 » Secure Rewarding Schemes |
217
click to vote
PKC
2011
Springer
14 years 7 months ago
2011
Springer
ded abstract of this work appears in Public Key Cryptography — PKC 2011, ed. R. Gennaro, Springer LNCS 6571 (2011), 1–16. This is the full version. We propose a linearly homom...
169
click to vote
CCS
2009
ACM
15 years 11 months ago
2009
ACM
Network information distribution is a fundamental service for any anonymization network. Even though anonymization and information distribution about the network are two orthogona...
135
click to vote
IWCMC
2009
ACM
15 years 11 months ago
2009
ACM
This paper proposes a dynamic trust establishment protocol that enables the nodes of an ad hoc network to establish security associations among each other in a distributed and pee...
132
click to vote
TCC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. A (k; n)-robust combiner for a primitive F takes as input n candidate implementations of F and constructs an implementation of F, which is secure assuming that at least k...
150
click to vote
CCS
2004
ACM
15 years 10 months ago
2004
ACM
Comparing the expressive power of access control models is recognized as a fundamental problem in computer security. Such comparisons are generally based on simulations between di...