how to prove that a committed number is prime

Tri Van Le, Khanh Quoc Nguyen, Vijay Varadharajan

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

5 Citations (Scopus)

Abstract

The problem of proving a number is of a given arithmetic format with some prime elements, is raised in RSA undeniable signature, group signature and many other cryptographic protocols. So far, there have been several studies in literature on this topic. However, except the scheme of Camenisch and Michels, other works are only limited to some special forms of arithmetic format with prime elements. In Camenisch and Michels's scheme, the main building block is a protocol to prove a committed number to be prime based on algebraic primality testing algorithms. In this paper, we propose a new protocol to prove a committed number to be prime. Our protocol is O(t) times more efficient than Camenisch and Michels's protocol, where t is the security parameter. This results in O(t) time improvement for the overall scheme.

Original languageEnglish
Title of host publicationAdvances in Cryptology - ASIACRYPT 1999 - International Conference on the Theory and Application of Cryptology and Information Security, Proceedings
Place of PublicationBerlin
PublisherSpringer, Springer Nature
Pages208-218
Number of pages11
Volume1716
ISBN (Print)3540666664, 9783540666660
DOIs
Publication statusPublished - 1999
Externally publishedYes
Event5th International Conference on the Theory and Applications of Cryptology and Information Security, ASIACRYPT 1999 - Singapore, Singapore
Duration: 14 Nov 199918 Nov 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1716
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other5th International Conference on the Theory and Applications of Cryptology and Information Security, ASIACRYPT 1999
CountrySingapore
CitySingapore
Period14/11/9918/11/99

Fingerprint

Dive into the research topics of 'how to prove that a committed number is prime'. Together they form a unique fingerprint.

Cite this