Perfect Zero-knowledge Proofs and Commutative Algebra

Abstract

In joint work with Rainer Steinwandt and Dominique Unruh, we look at how the notion of perfect zero-knowledge proof leads to an assumption about probabilistic Turing machines. We prove a theorem in commutative algebra which shows that this assumption is not valid.