AbstractDolev and Yao (1983) developed an elegant characterization of two-party cascade protocols that are secure. Pan (1985) extended their result to the case of p-party cascade protocols. Here we show that there is no such simple characterization of nam-stamp protocols that are secure
We present a new mechanized prover for secrecy properties of cryptographic protocols. In contrast to...
Abstract—We study the composition of security protocols when protocols share secrets such as keys. W...
In this paper, mostly consisting of definitions, we revisit the models of security protocols: we sho...
AbstractDolev and Yao (1983) developed an elegant characterization of two-party cascade protocols th...
AbstractCharacterizations of secure multi-party symmetric and nonsymmetric cascade protocols are giv...
AbstractTwo-party communication protocols for public-key cryptosystems are studied. The formal model...
In this work, we present an algebraic approach for modeling the two-party cascade protocol of Dolev-...
In this work, we present an algebraic approach for modeling the two-party cascade protocol of Dolev-...
19 pagesRapport interneIn this paper we propose a general definition of secrecy for cryptographic pr...
International audienceSecurity protocols are short programs that aim at securing communication over ...
Since the 1980s, two approaches have been developed for analyzing security protocols. One of the app...
Security protocols are small programs that are executed in hostile environments. Many results and to...
International audienceWe address the proof-based development of cryptographic protocols satisfying s...
Abstract. In the mid 1980s, Yao presented a constant-round protocol for securely computing any two-p...
Secure two-party computation allows two mutually distrusting parties to compute a function together,...
We present a new mechanized prover for secrecy properties of cryptographic protocols. In contrast to...
Abstract—We study the composition of security protocols when protocols share secrets such as keys. W...
In this paper, mostly consisting of definitions, we revisit the models of security protocols: we sho...
AbstractDolev and Yao (1983) developed an elegant characterization of two-party cascade protocols th...
AbstractCharacterizations of secure multi-party symmetric and nonsymmetric cascade protocols are giv...
AbstractTwo-party communication protocols for public-key cryptosystems are studied. The formal model...
In this work, we present an algebraic approach for modeling the two-party cascade protocol of Dolev-...
In this work, we present an algebraic approach for modeling the two-party cascade protocol of Dolev-...
19 pagesRapport interneIn this paper we propose a general definition of secrecy for cryptographic pr...
International audienceSecurity protocols are short programs that aim at securing communication over ...
Since the 1980s, two approaches have been developed for analyzing security protocols. One of the app...
Security protocols are small programs that are executed in hostile environments. Many results and to...
International audienceWe address the proof-based development of cryptographic protocols satisfying s...
Abstract. In the mid 1980s, Yao presented a constant-round protocol for securely computing any two-p...
Secure two-party computation allows two mutually distrusting parties to compute a function together,...
We present a new mechanized prover for secrecy properties of cryptographic protocols. In contrast to...
Abstract—We study the composition of security protocols when protocols share secrets such as keys. W...
In this paper, mostly consisting of definitions, we revisit the models of security protocols: we sho...
DOI
Add to ORKG