227 search results - page 18 / 46 » On the Reachability Problem in Cryptographic Protocols |
88
Voted
ACNS
2010
Springer
15 years 5 months ago
2010
Springer
We look at the problem of designing Message Recognition Protocols (MRP) and note that all proposals available in the literature have relied on security proofs which hold in the ran...
RTA
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We consider the problem of deciding the security of cryptographic protocols for a bounded number of sessions, taking into account some algebraic properties of the securit...
75
Voted
RTA
2007
Springer
15 years 6 months ago
2007
Springer
In the analysis of cryptographic protocols, a treacherous set of terms is one from which an intruder can get access to what was intended to be secret, by adding on to the top of a ...
87
Voted
ENTCS
2006
15 years 12 days ago
2006
There are two main ways of defining secrecy of cryptographic protocols. The first version checks if the adversary can learn the value of a secret parameter. In the second version,...
91
Voted
ASIACRYPT
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. The problem of proving a number is of a given arithmetic format with some prime elements, is raised in RSA undeniable signature, group signature and many other cryptograp...