719 search results - page 89 / 144 » Proving Security Protocols Correct |
IPL
2006
14 years 11 months ago
2006
We study the problem of Perfectly Reliable Message Transmission (PRMT) and Perfectly Secure Message Transmission (PSMT) between two nodes S and R in an undirected synchronous netw...
ACISP
2000
Springer
15 years 3 months ago
2000
Springer
We present a new identification scheme which is based on Legendre symbols modulo a certain hidden prime and which is naturally suited for low power, low memory applications. 1 Ove...
103
click to vote
CSFW
2012
IEEE
13 years 1 months ago
2012
IEEE
—Formal methods have proved their usefulness for analysing the security of protocols. In this setting, privacy-type security properties (e.g. vote-privacy, anonymity, unlinkabili...
ICNP
2006
IEEE
15 years 5 months ago
2006
IEEE
— Binding services are crucial building blocks in networks and networked applications. A binding service (e.g., the Domain Name System (DNS)) maps certain information, namely, bi...
SIGMOD
2004
ACM
15 years 11 months ago
2004
ACM
In a distributed sensor network, large number of sensors deployed which communicate among themselves to selforganize a wireless ad hoc network. We propose an energyefficient level...