3504 search results - page 8 / 701 » Secure protocol composition |
CCS
2008
ACM
13 years 11 months ago
2008
ACM
This paper presents the first type system for statically analyzing security protocols that are based on zero-knowledge proofs. We show how several properties offered by zero-knowl...
STOC
2002
ACM
14 years 10 months ago
2002
ACM
A fundamental problem of distributed computing is that of simulating a secure broadcast channel, within the setting of a point-to-point network. This problem is known as Byzantine...
FSTTCS
2009
Springer
14 years 4 months ago
2009
Springer
We present a symbolic framework for refinement and composition of security protocols. ework uses the notion of ideal functionalities. These are abstract systems which are secure b...
PKC
2000
Springer
14 years 1 months ago
2000
Springer
For the two last decades, electronic authentication has been an important topic. The first applications were digital signatures to mimic handwritten signatures for digital document...
ICALP
2010
Springer
14 years 2 months ago
2010
Springer
We give a quantitative sequential model for noninterference security with probability (but not demonic choice), and a novel refinement order that we prove to be the greatest compo...