227 search results - page 24 / 46 » On the Reachability Problem in Cryptographic Protocols |
ITCC
2005
IEEE
14 years 1 months ago
2005
IEEE
— Several problems are required to be fixed in order to apply geographical routing protocol Greedy Perimeter Stateless Routing (GPSR) in wireless sensor networks. First, GPSR is...
ESORICS
2008
Springer
13 years 9 months ago
2008
Springer
In this paper we consider the problem of securely outsourcing computation on private data. We present a protocol for securely distributing the computation of the data structures u...
ASIAN
2009
Springer
13 years 8 months ago
2009
Springer
Abstract. Static equivalence is a well established notion of indistinguishability of sequences of terms which is useful in the symbolic analysis of cryptographic protocols. Static ...
EUROCRYPT
2009
Springer
14 years 8 months ago
2009
Springer
The notion of Zero Knowledge Proofs (of knowledge) [ZKP] is central to cryptography; it provides a set of security properties that proved indispensable in concrete protocol design...
FOSAD
2000
Springer
13 years 11 months ago
2000
Springer
This material was presented in a series of lectures at fosad, a summer school on Foundations of Security Analysis and Design, at the University of Bologna Center at Bertinoro in Se...