Skip to main navigation Skip to search Skip to main content

Robust threshold schemes based on the Chinese remainder theorem

  • Kamer Kaya
  • , Ali Aydin Selçuk

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

Abstract

Recently, Chinese Remainder Theorem (CRT) based function sharing schemes are proposed in the literature. In this paper, we investigate how a CRT-based threshold scheme can be enhanced with the robustness property. To the best of our knowledge, these are the first robust threshold cryptosystems based on a CRT-based secret sharing.

Original languageEnglish
Title of host publicationProgress in Cryptology - AFRICACRYPT 2008 - First International Conference on Cryptology in Africa, Proceedings
Pages94-108
Number of pages15
DOIs
StatePublished - 2008
Event1st International Conference on Cryptology in Africa, AFRICACRYPT 2008 - Casablanca, Morocco
Duration: Jun 11 2008Jun 14 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5023 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other1st International Conference on Cryptology in Africa, AFRICACRYPT 2008
Country/TerritoryMorocco
CityCasablanca
Period06/11/0806/14/08

Keywords

  • Chinese remainder theorem
  • ElGamal
  • Paillier
  • RSA
  • Robustness
  • Threshold cryptography

Fingerprint

Dive into the research topics of 'Robust threshold schemes based on the Chinese remainder theorem'. Together they form a unique fingerprint.

Cite this