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∗

First Page		Document Content
Date: 2007-08-20 03:37:31 Cryptography 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 List Source URL: web.cs.ucdavis.edu Download Document from Source Website File Size: 294,27 KB Share Document on Facebook

	Brief Announcement: Proactive Secret Sharing with a Dishonest Majority Shlomi Dolev Karim ElDefrawy DocID: 1u7Ix - View Document
	ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti DocID: 1qUqL - View Document
	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∗ DocID: 1qpgb - View Document
	Structuring Proactive Secret Sharing in Mobile Ad-hoc Networks ∗ Keio Hitoshi Asaeda∗ , Musfiq Rahman† , Yoshihiro Toyama∗ University, Graduate School of Media and Governance, 5322, Endo, Fujisawa-shi, Kanagawa, DocID: 19wY0 - View Document
	MPSS: Mobile Proactive Secret Sharing DAVID SCHULTZ and BARBARA LISKOV Massachusetts Institute of Technology and MOSES LISKOV The MITRE Corporation DocID: 18odH - View Document