January 1, 1997· Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97
conference-paper
Open access
Probabilistically checkable proofs with zero knowledge
Abstract
In the course of constructing these PCP'S we abstract a tool we call locking systems. We provide the definition and also a locking system with very efficient parameters. This mechanism may be useful in other settings as well.
Community
0 commentsUse Connect Wallet in the navigation
No discussion yet
Be the first to share a question or observation.