Pairing based threshold cryptography improving on Libert-Quisquater and Baek-Zheng

Y. Desmedt, T. Lange

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

2 Citations (Scopus)

Abstract

In this paper we apply techniques from secret sharing and threshold decryption to show how to properly design an ID-based threshold system in which one assumes no trust in any party. In our scheme: – We avoid that any single machine ever knew the master secret s of the trusted authority (TA). Instead only shares of it will be known by parties of the distributed TA and it can be seen as a virtual key. –The threshold t TA and the number of shareholders n TA used by the distributed TA do not need to be identical to the ones used by user ID. Moreover, each user ID can use its own values for the threshold t i and the number of parties n i that will acquire shares. –No single machine will ever know the secret key of the user – this means no single machine in the distributed TA and no shareholder of the user ID and not ID itself. Like Baek and Zheng suggest, such a scheme can be turned into a mediated system.
Original languageEnglish
Title of host publicationFinancial cryptography and data security : 10th international conference, FC'06, Anguilla, British West Indies, February 27-March 2, 2006 : revised selected papers
EditorsG. Di Crescenzo, A. Rubin
Place of PublicationBerlin
PublisherSpringer
Pages154-159
ISBN (Print)3-540-46255-4
DOIs
Publication statusPublished - 2006

Publication series

NameLecture Notes in Computer Science
Volume4107
ISSN (Print)0302-9743

Fingerprint Dive into the research topics of 'Pairing based threshold cryptography improving on Libert-Quisquater and Baek-Zheng'. Together they form a unique fingerprint.

Cite this