3299 search results - page 281 / 660 » Privacy and Trusted Computing |
185
Voted
ESORICS
2009
Springer
16 years 7 months ago
2009
Springer
We propose a probabilistic contract signing protocol that achieves balance even in the presence of an adversary that may delay messages sent over secure channels. To show that this...
146
Voted
CHI
2002
ACM
16 years 7 months ago
2002
ACM
Despite many sensor, hardware, networking, and software advances, it is still quite difficult to build effective and reliable context-aware applications. We propose to build a con...
182
click to vote
DAWAK
2007
Springer
16 years 1 months ago
2007
Springer
We propose a privacy-preserving protocol for computing aggregation queries over the join of private tables. In this problem, several parties wish to share aggregated information ov...
158
click to vote
CSFW
2005
IEEE
16 years 14 days 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...
187
Voted
CCS
2008
ACM
15 years 8 months ago
2008
ACM
Many security properties are naturally expressed as indistinguishability between two versions of a protocol. In this paper, we show that computational proofs of indistinguishabili...