Periodical multi-secret threshold cryptosystems

0Citations
Citations of this article
31Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A periodical multi-secret threshold cryptosystem enables a sender to encrypt a message by using a cyclical sequence of keys which are shared by n parties and periodically updated. The same keys appear in the same order in each cycle, and thus any subset of t + 1 parties can decrypt the message only in the periodical time-frames, while no subset of t corrupted parties can control the system(i n particular, none can learn the decryption key). This scheme can be applied to a timedrelease cryptosystem whose release time is determined when the number of share update phases equals the period of the sequence. The system is implemented by sharing a pseudo-random sequence generator function.It realizes n ≥ 3t+1 robustness, and is therefore secure against an adversary who can corrupt at most one third of the parties.

Cite

CITATION STYLE

APA

Numao, M. (1999). Periodical multi-secret threshold cryptosystems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1716, pp. 1–15). Springer Verlag. https://doi.org/10.1007/978-3-540-48000-6_29

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free