Sciweavers

155 search results - page 6 / 31
» Cryptographic Protocol Analysis of AN.ON
Sort
View
TACAS
2007
Springer
67views Algorithms» more  TACAS 2007»
16 years 1 days ago
Searching for Shapes in Cryptographic Protocols
Abstract. We describe a method for enumerating all essentially different executions possible for a cryptographic protocol. We call them the shapes of the protocol. Naturally occur...
Shaddin F. Doghmi, Joshua D. Guttman, F. Javier Th...
LPAR
2007
Springer
16 years 2 days ago
Verifying Cryptographic Protocols with Subterms Constraints
Many analysis techniques and decidability results have been obtained for cryptographic protocols. However all of them consider protocols with limited procedures for the processing ...
Yannick Chevalier, Denis Lugiez, Michaël Rusi...
ESORICS
2005
Springer
15 years 11 months ago
Security-Typed Languages for Implementation of Cryptographic Protocols: A Case Study
Security protocols are critical for protecting modern communication infrastructures and are therefore subject to thorough analysis. However practical implementations of these proto...
Aslan Askarov, Andrei Sabelfeld
IPPS
2008
IEEE
16 years 10 days 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»
16 years 6 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