First Page | Document Content | |
---|---|---|
Date: 2012-05-30 09:00:34Complexity classes Cryptography Computational complexity theory Proof of knowledge IP Quantum complexity theory Soundness NP Commitment scheme PSPACE PP Security parameter | J. Cryptol: 116–135 DOI: s00145x Parallel Repetition of Computationally Sound Protocols Revisited∗ Krzysztof PietrzakAdd to Reading ListSource URL: www.nada.kth.seDownload Document from Source WebsiteFile Size: 390,75 KBShare Document on Facebook |