This study presents an expandable essential secret image sharing structure showing that some important shared images, named essential ones, are necessary when recovering the secret image and the proposed structure must incorporate other secret image sharing scheme to expand to a new secret image sharing scheme with multiple functions. An (s, t, n) essential secret image sharing structure shares...

The concept of quasi-threshold multipartite access structures for secret sharing schemes is introduced. These access structures allow one distinguished class of participants to retain control over the reconstruction of the secret, while allowing flexibility over the quorum of participants from other classes. While ideal bipartite access structures have been classified, the case for multipartite...

Information security becomes more and more important while the internet communication grows up. The secret image sharing technique, called (k, n) threshold scheme, is a useful method to protect our secret. This technique distributes a secret image to n shadow images preserved by n participants, respectively and we can only reveal the secret image by collecting at least k out of n shadow images....

The devastating consequence of secret key exposure in digital signature is that any signature can be forged and cannot be trusted. To mitigate the damage of secret key exposure, forward-secure signature schemes and threshold signature schemes are devised. In this paper, we propose a robust forward-secure threshold signature scheme with the applicability to mobile ad-hoc network in mind. Our mai...

Secret sharing schemes protect secrets by distributing them over diierent locations (share holders). In particular, in k out of n threshold schemes, security is assured if throughout the entire lifetime of the secret the adversary is restricted to compromise less than k of the n locations. For long-lived and sensitive secrets this protection may be insuucient. We propose an eecient proactive se...

We have presented some algebraic (n, n)threshold schemes in [3]. In this paper we proposed the algebraic (n, n)secret image sharing schemes.

A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...

We define three privacy-preserving solutions to the problem of distributing secrets between manufacturers and vendors of items labeled with Electronic Product Code (EPC) Gen2 tags. The solutions rely on the use of an anonymous threshold secret sharing scheme that allows the exchange of blinded information between readers and tags. Moreover, our secret sharing scheme allows self-renewal of share...

The paper analyses the multiple assignment secret sharing scheme, presented at the GLOBECOM'87 Conference. It contains three technical comments and a contribution to extend the capabilities of Shamir scheme. First it is proved that the proposed multiple assignment secret sharing scheme is not perfect. In fact, the non-perfectness of the scheme is due to the non-perfectness of a certain type of ...