On the complexity of bounded-interaction and noninteractive zero-knowledge proofs | IEEE Conference Publication | IEEE Xplore