127 search results - page 15 / 26 » Proving Properties of Security Protocols by Induction |
101
Voted
IACR
2011
13 years 9 months ago
2011
In this paper we present the first public key encryption scheme that is structure preserving, i.e., our encryption scheme uses only algebraic operations. In particular it does not...
106
click to vote
ADHOC
2007
14 years 9 months ago
2007
Abstract. Many ad hoc routing algorithms rely on broadcast flooding for location discovery or, more generally, for secure routing applications. Flooding is a robust algorithm but ...
68
Voted
CALCO
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We present a coalgebraic semantics for reasoning about information update in multi-agent systems. The novelty is that we have one structure for both states and actions an...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
Abstract— We consider the level of information security provided by random linear network coding in network scenarios in which all nodes comply with the communication protocols y...
FSTTCS
2003
Springer
15 years 2 months ago
2003
Springer
Tagging schemes have been used in security protocols to ensure that the analysis of such protocols can work with messages of bounded length. When the set of nonces is bounded, this...