T. M. Wong, C. Wang, and J. M. Wing, "Verifiable secret redistribution for archive systems," in Proceedings of the 1st International IEEE Security in Storage Workshop, 2002. 21 Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Modeling (k, n) Threshold Scheme in Ad Hoc Network - Chen (Correct)
....In [7] A. Shamir first proposed the (k, n) threshold scheme to share a secret. With this scheme, a secret D is divided into n shares. Even knowing k 1 shares reveals nothing of D while any k pieces of shares are enough to reconstruct D. The threshold scheme has been used in many applications ([2, 9, 3, 8]) Ad Hoc network turns to be a hot research area since it is an ideal technology for military tactical operations, law enforcement and rescue missions. After some works focusing on routing protocols, researchers now pay more attention to securing the Ad Hoc network, which has different ....
T. M. Wong, C. Wang, and J. M. Wing, "Verifiable Secret Redistribution for archive systems", In Proceedings of the First International IEEE Security in Storage Workshop (SISW 2002.
Using Byzantine Quorum Systems to Manage Confidential Data - Subbiah, Ahamad, Blough (2004) (Correct)
No context found.
T. M. Wong, C. Wang, and J. M. Wing, "Verifiable secret redistribution for archive systems," in Proceedings of the 1st International IEEE Security in Storage Workshop, 2002. 21
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC