New voice over Internet protocol technique with hierarchical data security protection

Guo, Jiun-In; Yen, Jui-Cheng; Pai, Hao-Ting

doi:10.1049/ip-vis:20020457

Cited by 24 publications

(24 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Although the inter-frame interleaving was only intended for avoiding possible loss of continuous packets [2,3], the use of secret chaotic bits has effectively made it one part of the whole encryption scheme.…”

Section: The Hdsp Encryption Schemementioning

confidence: 99%

“…, where g(i) denotes the i-th byte of g, the HDSP encryption scheme can be described as follows (to better describe the original algorithm, some notations and definitions used in [2,3] have been intentionally changed):…”

Section: The Hdsp Encryption Schemementioning

confidence: 99%

“…Thus, it is very important to provide sufficient security for VoIP services with a reasonable cost. In [2,3], a new VoIP protocol with a hierarchical data security protection (HDSP) scheme was proposed as a possible solution to the following two problems: reducing continuous packet loss to avoid large voice corruption, and encrypting the transmitted voice to provide a high-level security. HDSP works under the control of a chaotic bit sequence, which is generated by iterating a discrete-time chaotic map whose initial condition and control parameter serve as the secret key.…”

Section: Introductionmentioning

confidence: 99%

“…HDSP works under the control of a chaotic bit sequence, which is generated by iterating a discrete-time chaotic map whose initial condition and control parameter serve as the secret key. In [3], it was claimed that HDSP can resist the known-plaintext attack.…”

Section: Introductionmentioning

confidence: 99%

“…Next, a brief introduction to HDSP is given in Sec. 3. Section 4 is the main portion of this paper, which focuses on the cryptanalysis of the HDSP scheme.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Cryptanalysis of a data security protection scheme for VoIP

Zhang

et al. 2006

IEE Proc., Vis. Image Process.

View full text Add to dashboard Cite

Recently, a VoIP (voice over Internet protocol) technique with a new hierarchical data security protection (HDSP) scheme was proposed by using a secret chaotic bit sequence. This paper points out some insecure properties of the HDSP scheme, and then uses them to develop known/chosen-plaintext attacks. The following main findings are: 1) given n known plaintexts, about (100 − 50 2 n ) percent of secret chaotic bits can be uniquely determined; 2) given only one specially-chosen plaintext, all secret chaotic bits can be uniquely derived; 3) the secret key can be derived with practically small computational complexity when only one plaintext is known (or chosen). These facts reveal that HDSP is very weak against known/chosen-plaintext attacks. Experiments are given to show the feasibility of the proposed attacks. Furthermore, it is also found that the security of HDSP against the brute-force attack is not practically strong. Finally, some countermeasures are discussed for enhancing the security of HDSP, and several basic principles are suggested for the design of a secure encryption scheme.

show abstract

Section: The Hdsp Encryption Schemementioning

confidence: 99%

Section: The Hdsp Encryption Schemementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

“…Next, a brief introduction to HDSP is given in Sec. 3. Section 4 is the main portion of this paper, which focuses on the cryptanalysis of the HDSP scheme.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations