172 search results - page 3 / 35 » Key agreement from weak bit agreement |
IJNSEC
2006
14 years 9 months ago
2006
Anonymity is a very important security feature in addition to authentication and key agreement features in communication protocols. In this paper, we propose two authentication an...
ALGORITHMICA
2008
14 years 9 months ago
2008
We propose and study the Maximum Constrained Agreement Subtree (MCAST) problem, which is a variant of the classical Maximum Agreement Subtree (MAST) problem. Our problem allows us...
FSS
2010
14 years 7 months ago
2010
In this paper we investigate the relationship between two prioritized knowledge bases by measuring both the conflict and the agreement between them. First of all, a quantity of co...
NTMS
2009
IEEE
15 years 4 months ago
2009
IEEE
—New approaches that generate secret keys from radio channel characteristics have been recently proposed. The security of these schemes usually relies on the reciprocity principl...
STOC
2005
ACM
15 years 10 months ago
2005
ACM
A celebrated 1976 theorem of Aumann asserts that honest, rational Bayesian agents with common priors will never "agree to disagree": if their opinions about any topic ar...