3751 search results - page 42 / 751 » Events in security protocols |
156
click to vote
PODC
2009
ACM
16 years 6 months ago
2009
ACM
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
120
click to vote
IMA
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. The key agreement protocol are either based on some computational infeasability, such as the calculus of the discrete logarithm in [1], or on theoretical impossibility un...
151
click to vote
TCC
2007
Springer
16 years 2 days ago
2007
Springer
We prove a computational soundness theorem for symmetric-key encryption protocols that can be used to analyze security against adaptively corrupting adversaries (that is, adversar...
150
click to vote
IJISEC
2008
15 years 6 months ago
2008
We present a model checking technique for security protocols based on a reduction to propositional logic. At the core of our approach is a procedure that, given a description of th...
178
click to vote
IJNSEC
2007
15 years 5 months ago
2007
A protocol for secure communication between set-top box and smart card in conditional access system is proposed. The proposed protocol uses the Schnorr identification scheme to a...