Date: 2007-08-20 03:37:31Cryptography Secret sharing Public-key cryptography Proactive secret sharing Commitment scheme Ciphertext indistinguishability Adversary model Digital signature Encryption Information-theoretic security | | The proceedings version of this paper appears in ACM CCSThis is the full version of that paper. Robust Computational Secret Sharing and a Unified Account of Classical Secret-Sharing Goals Mihir Bellare∗Add to Reading ListSource URL: web.cs.ucdavis.eduDownload Document from Source Website File Size: 294,27 KBShare Document on Facebook
|