Undetachable threshold signatures

9Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A major problem of mobile agents is their inability to authenticate transactions in a hostile environment. Users will not wish to equip agents with their private signature keys when the agents may execute on untrusted platforms. Undetachable signatures were introduced to solve this problem by allowing users to equip agents with the means to sign signatures for tightly constrainedtransactions, using information especially derived from the user private signature key. However, the problem remains that a platform can force an agent to commit to a sub-optimal transaction. In parallel with the work on undetachable signatures, much work has been performedon thresholdsignature schemes, which allow signing power to be distributed across multiple agents, thereby reducing the trust in a single entity. We combine these notions and introduce the concept of an undetachable threshold signature scheme, which enables constrainedsigning power to be distributed across multiple agents, thus reducing the necessary trust in single agent platforms. We also provide an RSA-based example of such a scheme basedon a combination of Shoup’s thresholdsignature scheme, [1] and Kotzanikolaou et al’s undetachable signature scheme.

Cite

CITATION STYLE

APA

Borselius, N., Mitchell, C. J., & Wilson, A. (2001). Undetachable threshold signatures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2260, pp. 239–244). Springer Verlag. https://doi.org/10.1007/3-540-45325-3_21

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