A shared information system is expected to comply with the following potentially conflicting requirements. On the one side it should provide useful answers to arbitrary queries, while on the other side it should preserve certain secrets according to a security policy. We study and compare two previously suggested approaches to meet these requirements, namely refusal of statements and lying . Th...

A challenge in resource-constrained sensor networks is to provide secure communication in an efficient manner, even in the presence of denial-of-service attacks. In this article, we present a simple protocol for secret maintenance between a pair of network neighbors. We claim that certain adversaries cannot compromise the current secret shared by the neighbors, nor can they cause the neighbors ...

A proactive secret sharing scheme is a method of sharing a secret among a set of participants. And, the corresponding shadows can be periodically renewed under the premise of never changing the shared secret. However, in the most existing proactive secret sharing schemes, only one secret can be shared during one secret sharing process. The proposed scheme describes PMSS, a new way to share mult...

This note analyses one of the existing space efficient secret sharing schemes and suggests vulnerabilities in its design. We observe that the said algorithm fails for certain choices of the set of secrets and there is no reason for preferring this particular scheme over alternative schemes. The paper also elaborates the adoption of a scheme proposed by Hugo Krawczyk as an extension of Shamir's ...