Sciweavers

1612 search results - page 165 / 323
» About models of security protocols
Sort
View
SEFM
2008
IEEE
15 years 10 months ago
Restricted Broadcast Process Theory
We present a process algebra for modeling and reasoning about Mobile Ad hoc Networks (MANETs) and their protocols. In our algebra we model the essential modeling concepts of ad ho...
Fatemeh Ghassemi, Wan Fokkink, Ali Movaghar
FC
2004
Springer
78views Cryptology» more  FC 2004»
15 years 9 months ago
Secure Interaction Design
Abstract. The security of any computer system that is configured or operated by human beings critically depends on the information conveyed by the user interface, the decisions of...
Ka-Ping Yee
CCS
2003
ACM
15 years 9 months ago
k-anonymous message transmission
Informally, a communication protocol is sender k - anonymous if it can guarantee that an adversary, trying to determine the sender of a particular message, can only narrow down it...
Luis von Ahn, Andrew Bortz, Nicholas J. Hopper
FC
2009
Springer
84views Cryptology» more  FC 2009»
15 years 8 months ago
Private Intersection of Certified Sets
Abstract. This paper introduces certified sets to the private set intersection problem. A private set intersection protocol allows Alice and Bob to jointly compute the set intersec...
Jan Camenisch, Gregory M. Zaverucha
PODC
2006
ACM
15 years 10 months ago
Stably computable predicates are semilinear
We consider the model of population protocols introduced by Angluin et al. [2], in which anonymous finite-state agents stably compute a predicate of their inputs via twoway inter...
Dana Angluin, James Aspnes, David Eisenstat