Sciweavers

155 search results - page 7 / 31
» Transducer-based analysis of cryptographic protocols
Sort
View
IPPS
2008
IEEE
14 years 4 months ago
What is the best way to prove a cryptographic protocol correct?
In this paper, we identify that protocol verification using invariants have significant limitations such as inapplicability to some protocols, non-standard attacker inferences a...
Sreekanth Malladi, Gurdeep S. Hura
STOC
2005
ACM
103views Algorithms» more  STOC 2005»
14 years 10 months ago
New and improved constructions of non-malleable cryptographic protocols
We present a new constant round protocol for non-malleable zero-knowledge. Using this protocol as a subroutine, we obtain a new constant-round protocol for non-malleable commitmen...
Rafael Pass, Alon Rosen
FCT
2003
Springer
14 years 3 months ago
Context-Sensitive Equivalences for Non-interference Based Protocol Analysis
We develop new proof techniques, based on non-interference, for the analysis of safety and liveness properties of cryptographic protocols expressed as terms of the process algebra ...
Michele Bugliesi, Ambra Ceccato, Sabina Rossi
ICICS
2010
Springer
13 years 7 months ago
Proving Coercion-Resistance of Scantegrity II
By now, many voting protocols have been proposed that, among others, are designed to achieve coercion-resistance, i.e., resistance to vote buying and voter coercion. Scantegrity II...
Ralf Küsters, Tomasz Truderung, Andreas Vogt
FOSSACS
2006
Springer
14 years 1 months ago
Symbolic and Cryptographic Analysis of the Secure WS-ReliableMessaging Scenario
Abstract. Web services are an important series of industry standards for adding semantics to web-based and XML-based communication, in particular among enterprises. Like the entire...
Michael Backes, Sebastian Mödersheim, Birgit ...