Sciweavers

256 search results - page 30 / 52
» Reusing Static Keys in Key Agreement Protocols
Sort
View
STOC
2005
ACM
112views Algorithms» more  STOC 2005»
16 years 2 months ago
The complexity of agreement
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...
Scott Aaronson
TOOLS
2009
IEEE
15 years 8 months ago
Reusing and Composing Tests with Traits
Single inheritance often forces developers to duplicate code and logic. This widely recognized situation affects both business code and tests. In a large and complex application w...
Stéphane Ducasse, Damien Pollet, Alexandre ...
ISW
2010
Springer
14 years 11 months ago
Security Analysis of the Extended Access Control Protocol for Machine Readable Travel Documents
We analyze the Extended Access Control (EAC) protocol for authenticated key agreement, recently proposed by the German Federal Office for Information Security (BSI) for the deploym...
Özgür Dagdelen, Marc Fischlin
DAM
2006
97views more  DAM 2006»
15 years 1 months ago
Entity authentication schemes using braid word reduction
Abstract. Artin's braid groups currently provide a promising background for cryptographical applications, since the first cryptosystems using braids were introduced in [2, 3, ...
Hervé Sibert, Patrick Dehornoy, Marc Giraul...
SCL
2011
14 years 8 months ago
Analysis of consensus protocols with bounded measurement errors
This paper analyzes two classes of consensus algorithms in presence of bounded measurement errors. The considered protocols adopt an updating rule based either on constant or vani...
Andrea Garulli, Antonio Giannitrapani