Sciweavers

93 search results - page 15 / 19
» Propagation of trust and distrust
Sort
View
FOCS
2006
IEEE
14 years 3 months ago
Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority
Secret sharing and multiparty computation (also called “secure function evaluation”) are fundamental primitives in modern cryptography, allowing a group of mutually distrustfu...
Michael Ben-Or, Claude Crépeau, Daniel Gott...
AISC
1998
Springer
14 years 1 months ago
Reasoning About Coding Theory: The Benefits We Get from Computer Algebra
The use of computer algebra is usually considered beneficial for mechanised reasoning in mathematical domains. We present a case study, in the application domain of coding theory, ...
Clemens Ballarin, Lawrence C. Paulson
JOC
2007
84views more  JOC 2007»
13 years 9 months ago
Concurrent Composition of Secure Protocols in the Timing Model
In the setting of secure multiparty computation, a set of mutually distrustful parties wish to securely compute some joint function of their inputs. In the stand-alone case, it ha...
Yael Tauman Kalai, Yehuda Lindell, Manoj Prabhakar...
IWCMC
2009
ACM
14 years 4 months ago
Dynamic trust establishment in emergency ad hoc networks
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...
Christos A. Papageorgiou, Konstantinos Birkos, Tas...
ATAL
2007
Springer
14 years 3 months ago
Rumours and reputation: evaluating multi-dimensional trust within a decentralised reputation system
In this paper we develop a novel probabilistic model of computational trust that explicitly deals with correlated multi-dimensional contracts. Our starting point is to consider an...
Steven Reece, Alex Rogers, Stephen Roberts, Nichol...