#### DMCA

## Cryptographic Identification of Users Based on Inter-mixed Approach

### Citations

894 |
Cryptography, Theory and Practice.
- Stinson
- 1995
(Show Context)
Citation Context ...urity requirement for one assumption is too large for the other assumption. The paper proposes a cryptographic system design based on the two popular assumptions: factoring and discrete logarithms. Breaking this system is computationally infeasible because it requires solving the Diffie-Hellman discrete logarithm problem in a subgroup. Thus, in the proposed system it is possible to choose the same size of security parameter for these two assumptions and, therefore, to maintain the efficiency of the implementation. In practice, these types of schemes are not usually implemented in a secure way [5]. In 1985, Shamir [6] introduced the concept of an identity-based cryptosystem, in which each user must visit a key authentication center (KAC) and identify him before participating in a communication. Since then, several ID-based cryptographic algorithms [7, 8, 9] based on one hard problem, such as the factorization problem or the discrete logarithm problem, have been proposed. In 1994, Harn and Yang [10] presented a digital signature based on multiple cryptographic assumptions. Unfortunately, Lee and Hwang [11] pointed out that the adversary could forge the signatures of Harn’s scheme. Howev... |

180 |
Provably secure and practical identification schemes and corresponding signature schemes
- Okamoto
- 1993
(Show Context)
Citation Context ...e user identification, digital signature, and key distribution. We will first review related work in the next section. User identification scheme will be discussed in Sections III. Sections IV and V discuss the digital signature scheme and key distribution schemes. Security and performance analysis are shown in sections VI. At the end, we will make the notable conclusion. 中正嶺學報 第三十三卷 第一期 民國 93.11. JOURNAL OF C.C.I.T., VOL.33, NO.1, NOV., 2004. -3- II. RELATED WORK ON INTER-MIXED APPROACH 2.1 Description of Identification schemes This section describes the ID-DL proposed identification schemes [15]. This scheme is specified by (G, (A, B)), where G is the key generation operation, (A, B) is the three-move interactive protocol between A (prover) and B (verifier). 2.1.1 Key Generation: G The input and output of G are as follows: Input: Security parameter l, which is a positive integer. Output: A pair of public-key (p, q, g1, g2, t, v), and secret-key, (s1, s2). The operation of G is as follows: (a) Select primes p and q such that q |p - 1 and |q |= l. (e.g., q≥2160, and p≥21024.) (b) Select g1, g2 of order q in the group *pZ , and an integer t = O (|p|). (e.g., t≥20.) Here, if g2 is calcul... |

30 |
Efficient zero-knowledged identification scheme for smart cards
- Beth
- 1988
(Show Context)
Citation Context ... requires solving the Diffie-Hellman discrete logarithm problem in a subgroup. Thus, in the proposed system it is possible to choose the same size of security parameter for these two assumptions and, therefore, to maintain the efficiency of the implementation. In practice, these types of schemes are not usually implemented in a secure way [5]. In 1985, Shamir [6] introduced the concept of an identity-based cryptosystem, in which each user must visit a key authentication center (KAC) and identify him before participating in a communication. Since then, several ID-based cryptographic algorithms [7, 8, 9] based on one hard problem, such as the factorization problem or the discrete logarithm problem, have been proposed. In 1994, Harn and Yang [10] presented a digital signature based on multiple cryptographic assumptions. Unfortunately, Lee and Hwang [11] pointed out that the adversary could forge the signatures of Harn’s scheme. However, the performance of these cryptosystems is not better than those of the original El Gamal scheme and RSA. These signature schemes have one common disadvantage, i.e., each user should use his arithmetic modulo. Later, Shao [12] proposed two signature schemes and ... |

13 | Public-key cryptosystem design based on factoring and discrete logarithms,”
- Harn
- 1994
(Show Context)
Citation Context ... security parameter for these two assumptions and, therefore, to maintain the efficiency of the implementation. In practice, these types of schemes are not usually implemented in a secure way [5]. In 1985, Shamir [6] introduced the concept of an identity-based cryptosystem, in which each user must visit a key authentication center (KAC) and identify him before participating in a communication. Since then, several ID-based cryptographic algorithms [7, 8, 9] based on one hard problem, such as the factorization problem or the discrete logarithm problem, have been proposed. In 1994, Harn and Yang [10] presented a digital signature based on multiple cryptographic assumptions. Unfortunately, Lee and Hwang [11] pointed out that the adversary could forge the signatures of Harn’s scheme. However, the performance of these cryptosystems is not better than those of the original El Gamal scheme and RSA. These signature schemes have one common disadvantage, i.e., each user should use his arithmetic modulo. Later, Shao [12] proposed two signature schemes and claimed the security Recently, Lee [13] pointed out that Shao’s signature schemes are not sufficiently secure. To overcome weaknesses inherent i... |

10 |
Signature schemes based on factoring and discrete logarithms,”
- Shao
- 1998
(Show Context)
Citation Context ...based cryptographic algorithms [7, 8, 9] based on one hard problem, such as the factorization problem or the discrete logarithm problem, have been proposed. In 1994, Harn and Yang [10] presented a digital signature based on multiple cryptographic assumptions. Unfortunately, Lee and Hwang [11] pointed out that the adversary could forge the signatures of Harn’s scheme. However, the performance of these cryptosystems is not better than those of the original El Gamal scheme and RSA. These signature schemes have one common disadvantage, i.e., each user should use his arithmetic modulo. Later, Shao [12] proposed two signature schemes and claimed the security Recently, Lee [13] pointed out that Shao’s signature schemes are not sufficiently secure. To overcome weaknesses inherent in Shao’s scheme, a digital signature scheme is proposed [14]. This paper is built on that of [14] but has the outstanding advantage of applications in digital signature and key distribution schemes. In the paper, we propose three identity-based cryptographic schemes based on the FAC and the DL problems. Our schemes can provide user identification, digital signature, and key distribution. We will first review related ... |

7 |
Modified Harn signature scheme based on factoring and discrete logarithms,”
- Lee, Hwang
- 1996
(Show Context)
Citation Context ...n. In practice, these types of schemes are not usually implemented in a secure way [5]. In 1985, Shamir [6] introduced the concept of an identity-based cryptosystem, in which each user must visit a key authentication center (KAC) and identify him before participating in a communication. Since then, several ID-based cryptographic algorithms [7, 8, 9] based on one hard problem, such as the factorization problem or the discrete logarithm problem, have been proposed. In 1994, Harn and Yang [10] presented a digital signature based on multiple cryptographic assumptions. Unfortunately, Lee and Hwang [11] pointed out that the adversary could forge the signatures of Harn’s scheme. However, the performance of these cryptosystems is not better than those of the original El Gamal scheme and RSA. These signature schemes have one common disadvantage, i.e., each user should use his arithmetic modulo. Later, Shao [12] proposed two signature schemes and claimed the security Recently, Lee [13] pointed out that Shao’s signature schemes are not sufficiently secure. To overcome weaknesses inherent in Shao’s scheme, a digital signature scheme is proposed [14]. This paper is built on that of [14] but has the... |

5 |
Security of shao’s signature schemes based on factoring and discrete logarithms,”
- Lee
- 1999
(Show Context)
Citation Context ... the factorization problem or the discrete logarithm problem, have been proposed. In 1994, Harn and Yang [10] presented a digital signature based on multiple cryptographic assumptions. Unfortunately, Lee and Hwang [11] pointed out that the adversary could forge the signatures of Harn’s scheme. However, the performance of these cryptosystems is not better than those of the original El Gamal scheme and RSA. These signature schemes have one common disadvantage, i.e., each user should use his arithmetic modulo. Later, Shao [12] proposed two signature schemes and claimed the security Recently, Lee [13] pointed out that Shao’s signature schemes are not sufficiently secure. To overcome weaknesses inherent in Shao’s scheme, a digital signature scheme is proposed [14]. This paper is built on that of [14] but has the outstanding advantage of applications in digital signature and key distribution schemes. In the paper, we propose three identity-based cryptographic schemes based on the FAC and the DL problems. Our schemes can provide user identification, digital signature, and key distribution. We will first review related work in the next section. User identification scheme will be discussed in S... |

5 |
Digital signature scheme based on factoring and discrete logarithms,”
- He
- 2001
(Show Context)
Citation Context ...raphic assumptions. Unfortunately, Lee and Hwang [11] pointed out that the adversary could forge the signatures of Harn’s scheme. However, the performance of these cryptosystems is not better than those of the original El Gamal scheme and RSA. These signature schemes have one common disadvantage, i.e., each user should use his arithmetic modulo. Later, Shao [12] proposed two signature schemes and claimed the security Recently, Lee [13] pointed out that Shao’s signature schemes are not sufficiently secure. To overcome weaknesses inherent in Shao’s scheme, a digital signature scheme is proposed [14]. This paper is built on that of [14] but has the outstanding advantage of applications in digital signature and key distribution schemes. In the paper, we propose three identity-based cryptographic schemes based on the FAC and the DL problems. Our schemes can provide user identification, digital signature, and key distribution. We will first review related work in the next section. User identification scheme will be discussed in Sections III. Sections IV and V discuss the digital signature scheme and key distribution schemes. Security and performance analysis are shown in sections VI. At the ... |

4 |
Identitybased conference key broadcast systems,”
- Hwang, Chen
- 1994
(Show Context)
Citation Context ... requires solving the Diffie-Hellman discrete logarithm problem in a subgroup. Thus, in the proposed system it is possible to choose the same size of security parameter for these two assumptions and, therefore, to maintain the efficiency of the implementation. In practice, these types of schemes are not usually implemented in a secure way [5]. In 1985, Shamir [6] introduced the concept of an identity-based cryptosystem, in which each user must visit a key authentication center (KAC) and identify him before participating in a communication. Since then, several ID-based cryptographic algorithms [7, 8, 9] based on one hard problem, such as the factorization problem or the discrete logarithm problem, have been proposed. In 1994, Harn and Yang [10] presented a digital signature based on multiple cryptographic assumptions. Unfortunately, Lee and Hwang [11] pointed out that the adversary could forge the signatures of Harn’s scheme. However, the performance of these cryptosystems is not better than those of the original El Gamal scheme and RSA. These signature schemes have one common disadvantage, i.e., each user should use his arithmetic modulo. Later, Shao [12] proposed two signature schemes and ... |

2 |
Publicly Verifiable Secret Sharing. Adv
- Stadler
- 1996
(Show Context)
Citation Context ...出了三種植基於大家所熟悉的混合式困難度的身分識別密碼技術。現行大多數 的密碼學演算法的安全性取決於計算因式分解或離散對數的單一困難度問題，在強調資 訊安全的現實生活中，能提供強化演算法的安全性且不影響演算法執行效率，一直是本 研究領域首要積極追求的目標。本研究提出植基於同時解因式分解及離散對數困難度的 密碼機制，且計算模數等同於一般因式分解模數位數，任一使用者在本架構下僅需一對 身分證別碼及私秘金鑰即可。本文架構可適用於使用者身分認證、加解密、數位簽章、 金鑰交換及分配等應用機制。 關鍵字：身分基底,因式分解, 解散對數, 數位簽章, 金鑰分配 文稿收件日期 92.3.21; 文稿修正後接受日期 93.5.26. Manuscript received Mar. 21, 2003; revised May 26, 2004. Pin-Chang Su, etc. Cryptographic Identification of Users Based on Inter-mixed Approach - 2 - I. INTRODUCTION Most existing cryptosystem designs incorporate just one cryptographic assumption, such as factoring or discrete logarithms [1, 2, 3, 4]. These assumptions appear secure today; but it is possible that efficient algorithms will be developed in the future to break one or more of these assumptions. In 1994, K.S. McCurley proposed the first key distribution system based on two dissimilar assumptions, both of which appear to be hard. In his design, the sizes of the security parameters for these two assumptions are quite different. The modulus to satisfy the proper security requirement for one assumption is too large for the other assumption. The paper proposes a cryptographic system design based on the two popular assumptions: fact... |

1 |
ID-Based Cryptographic Schemes based on Factoring and Discrete Logarithms,”
- Su, Lu, et al.
- 2003
(Show Context)
Citation Context ...出了三種植基於大家所熟悉的混合式困難度的身分識別密碼技術。現行大多數 的密碼學演算法的安全性取決於計算因式分解或離散對數的單一困難度問題，在強調資 訊安全的現實生活中，能提供強化演算法的安全性且不影響演算法執行效率，一直是本 研究領域首要積極追求的目標。本研究提出植基於同時解因式分解及離散對數困難度的 密碼機制，且計算模數等同於一般因式分解模數位數，任一使用者在本架構下僅需一對 身分證別碼及私秘金鑰即可。本文架構可適用於使用者身分認證、加解密、數位簽章、 金鑰交換及分配等應用機制。 關鍵字：身分基底,因式分解, 解散對數, 數位簽章, 金鑰分配 文稿收件日期 92.3.21; 文稿修正後接受日期 93.5.26. Manuscript received Mar. 21, 2003; revised May 26, 2004. Pin-Chang Su, etc. Cryptographic Identification of Users Based on Inter-mixed Approach - 2 - I. INTRODUCTION Most existing cryptosystem designs incorporate just one cryptographic assumption, such as factoring or discrete logarithms [1, 2, 3, 4]. These assumptions appear secure today; but it is possible that efficient algorithms will be developed in the future to break one or more of these assumptions. In 1994, K.S. McCurley proposed the first key distribution system based on two dissimilar assumptions, both of which appear to be hard. In his design, the sizes of the security parameters for these two assumptions are quite different. The modulus to satisfy the proper security requirement for one assumption is too large for the other assumption. The paper proposes a cryptographic system design based on the two popular assumptions: fact... |

1 |
Cryptographic Identification of Users over Ad hoc Networks”,
- Su, Lu, et al.
- 2003
(Show Context)
Citation Context ...出了三種植基於大家所熟悉的混合式困難度的身分識別密碼技術。現行大多數 的密碼學演算法的安全性取決於計算因式分解或離散對數的單一困難度問題，在強調資 訊安全的現實生活中，能提供強化演算法的安全性且不影響演算法執行效率，一直是本 研究領域首要積極追求的目標。本研究提出植基於同時解因式分解及離散對數困難度的 密碼機制，且計算模數等同於一般因式分解模數位數，任一使用者在本架構下僅需一對 身分證別碼及私秘金鑰即可。本文架構可適用於使用者身分認證、加解密、數位簽章、 金鑰交換及分配等應用機制。 關鍵字：身分基底,因式分解, 解散對數, 數位簽章, 金鑰分配 文稿收件日期 92.3.21; 文稿修正後接受日期 93.5.26. Manuscript received Mar. 21, 2003; revised May 26, 2004. Pin-Chang Su, etc. Cryptographic Identification of Users Based on Inter-mixed Approach - 2 - I. INTRODUCTION Most existing cryptosystem designs incorporate just one cryptographic assumption, such as factoring or discrete logarithms [1, 2, 3, 4]. These assumptions appear secure today; but it is possible that efficient algorithms will be developed in the future to break one or more of these assumptions. In 1994, K.S. McCurley proposed the first key distribution system based on two dissimilar assumptions, both of which appear to be hard. In his design, the sizes of the security parameters for these two assumptions are quite different. The modulus to satisfy the proper security requirement for one assumption is too large for the other assumption. The paper proposes a cryptographic system design based on the two popular assumptions: fact... |

1 |
Improved identity-based key sharing system for multiaddress communication,”
- Chikazawa, Inoue
- 1992
(Show Context)
Citation Context ... requires solving the Diffie-Hellman discrete logarithm problem in a subgroup. Thus, in the proposed system it is possible to choose the same size of security parameter for these two assumptions and, therefore, to maintain the efficiency of the implementation. In practice, these types of schemes are not usually implemented in a secure way [5]. In 1985, Shamir [6] introduced the concept of an identity-based cryptosystem, in which each user must visit a key authentication center (KAC) and identify him before participating in a communication. Since then, several ID-based cryptographic algorithms [7, 8, 9] based on one hard problem, such as the factorization problem or the discrete logarithm problem, have been proposed. In 1994, Harn and Yang [10] presented a digital signature based on multiple cryptographic assumptions. Unfortunately, Lee and Hwang [11] pointed out that the adversary could forge the signatures of Harn’s scheme. However, the performance of these cryptosystems is not better than those of the original El Gamal scheme and RSA. These signature schemes have one common disadvantage, i.e., each user should use his arithmetic modulo. Later, Shao [12] proposed two signature schemes and ... |