In the traditional scenario in cryptography there is one sender, one receiver and an active or passive eavesdropper who is an opponent. Depending from the application the sender or the receiver (or both) need to use a secret key. Often we are not dealing with an individual sender/receiver, but the sender/receiver is an organization. The goal of threshold cryptography is to present practical schemes to solve such problems without the need to use the more general methods of mental games. In this paper we survey some recent research results on this topic. In particular on: DSS based threshold signatures, robust threshold cryptography, threshold cryptography without a trusted dealer, more optimal secret sharing schemes for threshold cryptography, proactive threshold cryptography and its generalizations.
CITATION STYLE
Desmedt, Y. (1998). Some recent research aspects of threshold cryptography. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1396, pp. 158–173). Springer Verlag. https://doi.org/10.1007/bfb0030418
Mendeley helps you to discover research relevant for your work.