6 search results - page 1 / 2 » Computationally Sound Symbolic Secrecy in the Presence of Ha... |
100
Voted
FSTTCS
2006
Springer
15 years 4 months ago
2006
Springer
The standard symbolic, deducibility-based notions of secrecy are in general insufficient from a cryptographic point of view, especially in presence of hash functions. In this paper...
109
Voted
SP
2006
IEEE
15 years 6 months ago
2006
IEEE
We present a new mechanized prover for secrecy properties of security protocols. In contrast to most previous provers, our tool does not rely on the Dolev-Yao model, but on the co...
101
click to vote
EUROCRYPT
2010
Springer
15 years 5 months ago
2010
Springer
We analyze the relation between induction, co-induction and the presence of encryption cycles in the context of computationally sound symbolic equivalence of cryptographic express...
108
Voted
CSFW
2007
IEEE
15 years 7 months ago
2007
IEEE
We present a new mechanized prover for showing correspondence assertions for cryptographic protocols in the computational model. Correspondence assertions are useful in particular...
125
Voted
ESORICS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Several generic constructions for transforming one-way functions to asymmetric encryption schemes have been proposed. One-way functions only guarantee the weak secrecy of...