Sciweavers

401 search results - page 60 / 81
» Formal Analysis of Meeting Protocols
Sort
View
ESORICS
2003
Springer
14 years 3 months ago
Rapid Mixing and Security of Chaum's Visual Electronic Voting
Recently, David Chaum proposed an electronic voting scheme that combines visual cryptography and digital processing. It was designed to meet not only mathematical security standard...
Marcin Gomulkiewicz, Marek Klonowski, Miroslaw Kut...
SAS
2000
Springer
14 years 2 months ago
A Transformational Approach for Generating Non-linear Invariants
Computing invariants is the key issue in the analysis of infinite-state systems whether analysis means testing, verification or parameter synthesis. In particular, methods that all...
Saddek Bensalem, Marius Bozga, Jean-Claude Fernand...
SCAM
2008
IEEE
14 years 5 months ago
User-Input Dependence Analysis via Graph Reachability
Bug-checking tools have been used with some success in recent years to find bugs in software. For finding bugs that can cause security vulnerabilities, bug checking tools requir...
Bernhard Scholz, Chenyi Zhang, Cristina Cifuentes
FSTTCS
2003
Springer
14 years 3 months ago
Tagging Makes Secrecy Decidable with Unbounded Nonces as Well
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...
Ramaswamy Ramanujam, S. P. Suresh
PODC
1994
ACM
14 years 2 months ago
Using Belief to Reason about Cache Coherence
The notion of belief has been useful in reasoning about authentication protocols. In this paper, we show how the notion of belief can be applied to reasoning about cache coherence...
Lily B. Mummert, Jeannette M. Wing, Mahadev Satyan...