TY - GEN
T1 - how to prove that a committed number is prime
AU - Van Le, Tri
AU - Nguyen, Khanh Quoc
AU - Varadharajan, Vijay
PY - 1999
Y1 - 1999
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84956853783&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-48000-6_17
DO - 10.1007/978-3-540-48000-6_17
M3 - Conference proceeding contribution
AN - SCOPUS:84956853783
SN - 3540666664
SN - 9783540666660
VL - 1716
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 208
EP - 218
BT - Advances in Cryptology - ASIACRYPT 1999 - International Conference on the Theory and Application of Cryptology and Information Security, Proceedings
PB - Springer, Springer Nature
CY - Berlin
T2 - 5th International Conference on the Theory and Applications of Cryptology and Information Security, ASIACRYPT 1999
Y2 - 14 November 1999 through 18 November 1999
ER -