First Page | Document Content | |
---|---|---|
Date: 2011-03-20 04:03:37Cryptography Public-key cryptography Commitment scheme Secret sharing Computational hardness assumption Digital signature Entropy XTR | Efficient String-Commitment from Weak Bit-Commitment Kai-Min Chung1, , Feng-Hao Liu2, , Chi-Jen Lu3 , and Bo-Yin Yang3 1 2Add to Reading ListSource URL: precision.moscito.orgDownload Document from Source WebsiteFile Size: 261,54 KBShare Document on Facebook |
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 |