This is in contrast to an actual proof, where if the party attempting to prove failed even once to answer a question then the proof would be rejected. ... aquot;reverse- engineeringaquot; that is considered a very hard (if not impossible) thing to do. ... zero- knowledge protocol3 (the choice of n is quite arbitrary and could be replaced with any fixed polynomial (e.g. n3) in the security parameter.) ... 2 Actually in this paper we need to require that there exist hash functions that are collision resistent againstanbsp;...
|Title||:||42nd Annual Symposium on Foundations of Computer Science|
|Author||:||IEEE Computer Society. Technical Committee on Mathematical Foundations of Computing|