In this paper, we make two contributions to this problem space. First, we identify weaker cryptographic assumptions that we show to be sufficient for ...

In this paper, we first identify which additional properties a cryptographic zero-knowledge proof needs to fulfill in order to serve as a computationally sound ...

First, we identify weaker cryptographic assumptions that we show to be sufficient for obtaining a com- putational soundness result for symbolic ZK proofs.

Sep 10, 2009 · The abstraction of cryptographic operations by term algebras, called Dolev-Yao models, is essential in almost all tool-supported methods for ...

Significant progress was made in proving that symbolic models offering basic cryptographic operations such as encryption and digital signatures can be sound ...

The abstraction of cryptographic operations by term algebras, called Dolev–Yao models, is essential in almost all tool-supported methods for proving ...

This yields the first computational soundness result for symbolic zero-knowledge proofs and the first such result against fully active adversaries of Dolev-Yao ...

In this paper, we first identify which additional proper- ties a cryptographic zero-knowledge proof needs to fulfill in order to serve as a computationally ...

Computational Soundness of Symbolic Zero-knowledge Proofs: Weaker Assumptions and Mechanized Verification · M. Backes, Fabian Bendun, Dominique Unruh · Published ...

Abstract. The abstraction of cryptographic operations by term alge- bras, called symbolic models, is essential in almost all tool-supported.