IEE Proceedings - Information Security
Volume 153, Issue 4, December 2006
Volume 153, Issue 4
December 2006
-
- Author(s): F. Hao
- Source: IEE Proceedings - Information Security, Volume 153, Issue 4, p. 141 –142
- DOI: 10.1049/ip-ifs:20060068
- Type: Article
- + Show details - Hide details
-
p.
141
–142
(2)
Kish proposed a scheme to exchange keys between two parties under the concealment of thermal noise. We show that the theoretical model in the scheme implicitly assumes thermal equilibrium throughout the communication channel. This assumption, however, is invalid in real communication systems. A slight temperature difference in the channel, as demonstrated in the paper, will lead to security failure. - Author(s): C.-C. Wang ; M.-C. Kao ; Y.-S. Yeh
- Source: IEE Proceedings - Information Security, Volume 153, Issue 4, p. 143 –145
- DOI: 10.1049/ip-ifs:20060085
- Type: Article
- + Show details - Hide details
-
p.
143
–145
(3)
We describe a forgery attack on the RPC incremental unforgeable encryption scheme. The attack allows an adversary to forge a new ciphertext with probability 1/2 using 2r/2 incremental update queries, where r is the parameter of random values used in the RPC scheme and is at most half the block length of the block cipher used. However, the original analysis claimed that on the order of 2r queries would be needed. When applying the attack to the scheme using a block cipher with 128-bit block length and assuming r = 48 as suggested in the original article of the RPC scheme, the adversary can obtain a forgery with probability 1/2 after 224 update queries. Even in the case of 256-bit RPC scheme with r = 64, the required number of queries is only 232. We also propose two methods to strengthen the RPC scheme for defeating the proposed attack. - Author(s): S. Zhou and D. Lin
- Source: IEE Proceedings - Information Security, Volume 153, Issue 4, p. 146 –152
- DOI: 10.1049/ip-ifs:20055141
- Type: Article
- + Show details - Hide details
-
p.
146
–152
(7)
Group signatures are generalised credential/member authentication schemes with wide applications. Membership revocation problem is a major issue of group signatures, and is often resolved through an additional protocol which would encumber the whole group signature both in computation and storage, as Camenisch et al. did to ACJT's group signature scheme (the first ever practical group signature based on RSA problem put forward by Ateniese et al. at Crypto'00) by dynamic accumulator. Boneh et al. applied Camenisch et al.'s dynamic accumulator based revocation reversely, resulted in short group signature. We formally define the method used by Boneh et al., named reversed dynamic accumulator in this paper, and apply it on some previous group signatures to obtain improved ones with revocation capability, reduced bandwidth (signature size) and less signature generation computations. We also address the problems unsolved in Boneh et al.'s work, e.g. how to open a group signature since the current certificate may no longer be the one stored when it is firstly generated. - Author(s): J. Herranz and G. Sáez
- Source: IEE Proceedings - Information Security, Volume 153, Issue 4, p. 153 –162
- DOI: 10.1049/ip-ifs:20060081
- Type: Article
- + Show details - Hide details
-
p.
153
–162
(10)
In a multipartite access structure, the set of players is divided into K different classes in such a way that all players of the same class play the same role in the structure. Not many results are known about these structures, when K ≥ 3.Although the total characterisation of ideal multipartite access structures seems a very ambitious goal, we nevertheless take a first step in this direction. On the one hand, we detect some conditions that directly imply that a multipartite structure cannot be ideal. On the other hand, we introduce a new strategy which helps to prove that a multipartite access structure is ideal, and we apply this strategy to three wide families of multipartite access structures. - Author(s): A.M. Youssef
- Source: IEE Proceedings - Information Security, Volume 153, Issue 4, p. 163 –165
- DOI: 10.1049/ip-ifs:20060075
- Type: Article
- + Show details - Hide details
-
p.
163
–165
(3)
Baocang and Yupu proposed a relatively fast public key cryptosystem. The authors claim that the security of their system is based on two number-theoretic hard problems, namely the simultaneous Diophantine approximation problem and the integer factorisation problem. In this article we present a polynomial time heuristic attack that enables us to recover the private key from the public key. In particular, we show that breaking the system can be reduced to finding a short vector in a lattice which can be achieved using the L3-lattice reduction algorithm. - Author(s): F. Yaghmaee and M. Jamzad
- Source: IEE Proceedings - Information Security, Volume 153, Issue 4, p. 167 –172
- DOI: 10.1049/ip-ifs:20060025
- Type: Article
- + Show details - Hide details
-
p.
167
–172
(6)
Some of the most important classes of watermark detection methods in image watermarking are correlation-based algorithms. In these methods usually a pseudorandom noise pattern is embedded in the host image. The receiver can regenerate this pattern by having a key that is the seed of a random number generator. After that if the correlation between this pattern and the image that is assumed to have the watermark is higher than a predefined threshold, it means that the watermark exists and vice versa. Here, we show the advantage of using the Julian set patterns as a watermark, instead of the commonly used pseudorandom noise pattern. Julian set patterns can be regenerated in receiver with few parameters such as coefficients of its function and an initial point. These parameters can be embedded in the key. Our experiments show that the Julian set patterns not only manipulate a lower number of pixels (and therefore provide better visual quality) but also, compared with the pseudorandom noise pattern, it increases the robustness of watermark against attacks. - Author(s): Z.-M. Lu ; Y.-N. Li ; H.-X. Wang ; S.-H. Sun
- Source: IEE Proceedings - Information Security, Volume 153, Issue 4, p. 173 –182
- DOI: 10.1049/ip-ifs:20060034
- Type: Article
- + Show details - Hide details
-
p.
173
–182
(10)
The technologies of multimedia compression, copyright protection and content authentication are essential to the booming multimedia industry. Watermarking schemes for compressed video are effective solutions to the video industry. In this paper, we first present a hybrid video compression scheme that adopts both scalar quantisation and transform domain vector quantisation, and then a multipurpose watermarking algorithm for the hybrid compressed video is proposed. The digital fingerprint, robust and fragile watermarks are embedded in different parts of the compressed video stream to accomplish the multiple purposes of copyright protection, pirate tracing and content authentication. We first demonstrate the effectiveness of the proposed video compression scheme by comparing it with the H.263 compression standard, and then we evaluate the robustness and fragility of the proposed multipurpose watermarking algorithm against conventional attacks.
Kish's key exchange scheme is insecure
Forgery attack on the RPC incremental unforgeable encryption scheme
Group signatures with reduced bandwidth
New results on multipartite access structures
Cryptanalysis of a public key cryptosystem based on two cryptographic assumptions
Achieving higher perceptual quality and robustness in watermarking using Julian set patterns
Multipurpose video watermarking algorithm in the hybrid compressed domain
Most viewed content for this Journal
Article
content/journals/ip-ifs
Journal
5
Most cited content for this Journal
We currently have no most cited data available for this content.
