Skip to main content
Conference ProceedingsOPEN ACCESS

Linear integer secret sharing and distributed exponentiation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2006) 3958 LNCS 75-90
DOI: 10.1007/11745853_6
32Citations
Citations of this article
44Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We introduce the notion of Linear Integer Secret-Sharing (LISS) schemes, and show constructions of such schemes for any access structure. We show that any LISS scheme can be used to build a secure distributed protocol for exponentiation in any group. This implies, for instance, distributed RSA protocols for arbitrary access structures and with arbitrary public exponents. © International Association for Cryptologic Research 2006.

Cite

CITATION STYLE

APA

Damgård, I., & Thorbck, R. (2006). Linear integer secret sharing and distributed exponentiation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3958 LNCS, pp. 75–90). Springer Verlag. https://doi.org/10.1007/11745853_6

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