First Page | Document Content | |
---|---|---|
![]() Date: 2008-02-13 04:47:39Commitment scheme Randomized algorithm One-way function PP IP RSA Ciphertext indistinguishability Negligible function Computational complexity theory Theoretical computer science Cryptography Applied mathematics | Add to Reading List |
![]() | ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro CorettiDocID: 1rsiG - View Document |
![]() | Locally Random Reductions: Improvements and Applications D. Beavery J. Feigenbaumz J. Kilianx September 1, 1995DocID: 1raDV - View Document |
![]() | ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro CorettiDocID: 1rauh - View Document |
![]() | A Commitment-Consistent Proof of a Shuffle Douglas Wikstr¨om CSC KTH Stockholm, Sweden Abstract. We introduce a pre-computation technique that drasticallyDocID: 1r7EK - View Document |
![]() | ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro CorettiDocID: 1qUxu - View Document |