Sciweavers

947 search results - page 134 / 190
» HMM-Based Trust Model
Sort
View
CONCURRENCY
2008
80views more  CONCURRENCY 2008»
15 years 5 months ago
Robust incentives via multi-level Tit-for-Tat
Much work has been done to address the need for incentive models in real deployed peer-to-peer networks. In this paper, we discuss problems found with the incentive model in a lar...
Qiao Lian, Yu Peng, Mao Yang, Zheng Zhang, Yafei D...
EUROCRYPT
2008
Springer
15 years 6 months ago
New Constructions for UC Secure Computation Using Tamper-Proof Hardware
The Universal Composability framework was introduced by Canetti to study the security of protocols which are concurrently executed with other protocols in a network environment. U...
Nishanth Chandran, Vipul Goyal, Amit Sahai
TCC
2009
Springer
124views Cryptology» more  TCC 2009»
16 years 5 months ago
Universally Composable Multiparty Computation with Partially Isolated Parties
It is well known that universally composable multiparty computation cannot, in general, be achieved in the standard model without setup assumptions when the adversary can corrupt a...
Ivan Damgård, Jesper Buus Nielsen, Daniel Wi...
SOSP
2007
ACM
16 years 1 months ago
Information flow control for standard OS abstractions
ion Flow Control for Standard OS Abstractions Maxwell Krohn Alexander Yip Micah Brodsky Natan Cliffer M. Frans Kaashoek Eddie Kohler† Robert Morris MIT CSAIL †UCLA http://flum...
Maxwell N. Krohn, Alexander Yip, Micah Z. Brodsky,...
140
Voted
ACSAC
2009
IEEE
15 years 11 months ago
Enabling Secure Secret Sharing in Distributed Online Social Networks
—We study a new application of threshold-based secret sharing in a distributed online social network (DOSN), where users need a means to back up and recover their private keys in...
Le-Hung Vu, Karl Aberer, Sonja Buchegger, Anwitama...