AbstractCharacterizations of secure multi-party symmetric and nonsymmetric cascade protocols are given. A simple correspondence problem over an alphabet is shown linearly reducible to the security problem of symmetric name-stamp protocols. Also, the security problem of nonsymmetric protocols is shown linearly reducible to that of symmetric protocols
In symmetric secure function evaluation (SSFE), Alice has an input x, Bob has an input y, and both p...
Security protocols are small programs that are executed in hostile environments. Many results and to...
Abstract—We study the composition of security protocols when protocols share secrets such as keys. W...
AbstractCharacterizations of secure multi-party symmetric and nonsymmetric cascade protocols are giv...
AbstractDolev and Yao (1983) developed an elegant characterization of two-party cascade protocols th...
AbstractTwo-party communication protocols for public-key cryptosystems are studied. The formal model...
International audienceSecurity protocols are short programs that aim at securing communication over ...
In practice, users will rely on a wide variety of communication protocols to conduct their work over...
In this work, we present an algebraic approach for modeling the two-party cascade protocol of Dolev-...
The contributions of this paper are three-fold. First, as an abstraction of previously proposed cryp...
Since the 1980s, two approaches have been developed for analyzing security protocols. One of the app...
. We develop principles and rules for achieving secrecy properties in security protocols. Our approa...
We devise an abstraction of secure multi-party computations in the applied $pi$-calculus. Based on t...
We present a new mechanized prover for secrecy properties of cryptographic protocols. In contrast to...
We introduce a family of multi-party authentication protocols and discuss six novel protocols, which...
In symmetric secure function evaluation (SSFE), Alice has an input x, Bob has an input y, and both p...
Security protocols are small programs that are executed in hostile environments. Many results and to...
Abstract—We study the composition of security protocols when protocols share secrets such as keys. W...
AbstractCharacterizations of secure multi-party symmetric and nonsymmetric cascade protocols are giv...
AbstractDolev and Yao (1983) developed an elegant characterization of two-party cascade protocols th...
AbstractTwo-party communication protocols for public-key cryptosystems are studied. The formal model...
International audienceSecurity protocols are short programs that aim at securing communication over ...
In practice, users will rely on a wide variety of communication protocols to conduct their work over...
In this work, we present an algebraic approach for modeling the two-party cascade protocol of Dolev-...
The contributions of this paper are three-fold. First, as an abstraction of previously proposed cryp...
Since the 1980s, two approaches have been developed for analyzing security protocols. One of the app...
. We develop principles and rules for achieving secrecy properties in security protocols. Our approa...
We devise an abstraction of secure multi-party computations in the applied $pi$-calculus. Based on t...
We present a new mechanized prover for secrecy properties of cryptographic protocols. In contrast to...
We introduce a family of multi-party authentication protocols and discuss six novel protocols, which...
In symmetric secure function evaluation (SSFE), Alice has an input x, Bob has an input y, and both p...
Security protocols are small programs that are executed in hostile environments. Many results and to...
Abstract—We study the composition of security protocols when protocols share secrets such as keys. W...
DOI
Add to ORKG