Date: 2013-10-04 08:09:02Complexity classes Probabilistic complexity theory Zero-knowledge proof Probabilistically checkable proof NP Proof of knowledge IP Non-interactive zero-knowledge proof Soundness Cryptography Cryptographic protocols Theoretical computer science | | Secure Two-Party Computation with Low Communication Ivan Damg˚ard∗ Sebastian Faust† Carmit Hazay‡Document is deleted from original location. Use the Download Button below to download from the Web Archive.Download Document from Web Archive File Size: 221,77 KB
|