2601 search results - page 371 / 521 » Secure Rewarding Schemes |
128
Voted
CSFW
2005
IEEE
15 years 10 months ago
2005
IEEE
We consider expansions of the Abadi-Rogaway logic of indistinguishability of formal cryptographic expressions. We expand the logic in order to cover cases when partial information...
166
click to vote
IQIS
2005
ACM
15 years 10 months ago
2005
ACM
In this paper, the problem of quickly matching records (i.e., record linkage problem) from two autonomous sources without revealing privacy to the other parties is considered. In ...
158
click to vote
CRYPTO
2005
Springer
15 years 10 months ago
2005
Springer
Since bit and string oblivious transfer and commitment, two primitives of paramount importance in secure two- and multi-party computation, cannot be realized in an unconditionally ...
135
click to vote
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
We introduce the notion of hierarchical group signatures. This is a proper generalization of group signatures, which allows multiple group managers organized in a tree with the si...
125
Voted
CCS
2004
ACM
15 years 10 months ago
2004
ACM
This paper studies the problem of resource discovery in unstructured peer-to-peer (P2P) systems. We propose simple policies that make the discovery of resources resilient to coord...