Online ISSN
1751-8717
Print ISSN
1751-8709
IET Information Security
Volume 6, Issue 2, June 2012
Volumes & issues:
Volume 6, Issue 2
June 2012
-
- Author(s): A.-J. Ge ; C.-G. Ma ; Z.-F. Zhang
- Source: IET Information Security, Volume 6, Issue 2, p. 47 –54
- DOI: 10.1049/iet-ifs.2011.0094
- Type: Article
- + Show details - Hide details
-
p.
47
–54
(8)
In this study, the authors propose a new efficient attribute-based signature (ABS) scheme. This scheme achieves existential unforgeability against selective predicate attack and attributes signer privacy in the standard model. The signature scheme only needs three pairing operations, and the signature size is constant, regardless of the number of attributes. Compared with other existing schemes, this construction provides better efficiency in terms of the computational cost and communication cost. To the best of author's knowledge, this is the first ABS scheme that can achieve constant signature size and constant number of pairing operations. In addition, after the analysis of Wang and Chen's attribute-based ring signature scheme, the authors show that their scheme is incorrect. - Author(s): M.J. Mihaljević ; S. Gangopadhyay ; G. Paul ; H. Imai
- Source: IET Information Security, Volume 6, Issue 2, p. 55 –64
- DOI: 10.1049/iet-ifs.2011.0107
- Type: Article
- + Show details - Hide details
-
p.
55
–64
(10)
A novel technique for cryptanalysis of the stream cipher Grain-v1 is given. In a particular setting, the algorithms proposed in this study provide recovery of an internal state of Grain-v1 with the expected time complexity of only 254 table look-up operations employing a memory of dimension ∼270, assuming availability of 234 keystream sequences each of length 238 generated for different initial values, and the pre-processing time complexity of ∼288. These figures appear as significantly better in comparison with the previously reported ones. The proposed approach for cryptanalysis primarily depends on the order of normality of the employed Boolean function in Grain-v1. Accordingly, in addition to the security evaluation insights of Grain-v1, the results of this study are also an evidence of the cryptographic significance of the normality criteria of Boolean functions. - Author(s): Q. Xie
- Source: IET Information Security, Volume 6, Issue 2, p. 65 –70
- DOI: 10.1049/iet-ifs.2011.0162
- Type: Article
- + Show details - Hide details
-
p.
65
–70
(6)
In 2009, Tsai proposed an efficient convertible multi-authenticated encryption (CMAE) scheme. However, the author shows that his scheme is distinguishable under adaptive chosen-message attack, and that the designated verifier can generate the signature of the same message for other verifiers. Since no formal model of CMAE has been presented in the literature, the author presents the first complete formal model of CMAE. Then, a new scheme is proposed. The proposed scheme is provably secure in the random oracle model. - Author(s): I. Kim
- Source: IET Information Security, Volume 6, Issue 2, p. 71 –76
- DOI: 10.1049/iet-ifs.2010.0212
- Type: Article
- + Show details - Hide details
-
p.
71
–76
(6)
Although the powerful functions of smartphones provide much convenience for users, it causes a great damage because of loss and theft. Therefore the user has to use the phone lock provided by the smartphone. With the phone lock, the user is able to secure the time for requesting to stop the call service to the mobile telecommunication company and deleting the sensitive information with an anti-theft programme. However, the fixed keypad lock can be easily unlocked by brute force attacks and the pattern lock is vulnerable to smudge attacks. In this study, we propose a keypad for making brute force attacks and smudge attacks taking place on smartphones more difficult. The proposed keypad increases the time it takes for brute force attacks and is safe to smudge attacks. The smartphone equipped with the proposed keypad increases the time required for brute force attacks by the finder through formation of random buttons, random button arrangement and display delay time. Consequently, the smartphone owners are able to secure more time to become aware of the loss or theft and take action. - Author(s): N. Marchang and R. Datta
- Source: IET Information Security, Volume 6, Issue 2, p. 77 –83
- DOI: 10.1049/iet-ifs.2010.0160
- Type: Article
- + Show details - Hide details
-
p.
77
–83
(7)
Mobile ad hoc networks (MANETs) were originally designed for a cooperative environment. To use them in hostile environments, trust-based routing can be used, where instead of establishing the shortest routes as done in traditional routing protocols, most trusted routes are established. In this study, the authors present a light-weight trust-based routing protocol. It is light-weight in the sense that the intrusion detection system (IDS) used for estimating the trust that one node has for another, consumes limited computational resource. Moreover, it uses only local information thereby ensuring scalability. Our light-weight IDS takes care of two kinds of attacks, namely, the blackhole attack and the grey hole attack. Whereas our proposed approach can be incorporated in any routing protocol, the authors have used AODV as the base routing protocol to evaluate our proposed approach and give a performance analysis. - Author(s): Y.-H. Chou ; C.-Y. Chen ; R.-K. Fan ; H.-C. Chao ; F.-J. Lin
- Source: IET Information Security, Volume 6, Issue 2, p. 84 –92
- DOI: 10.1049/iet-ifs.2011.0233
- Type: Article
- + Show details - Hide details
-
p.
84
–92
(9)
Based on the multiparty quantum secret sharing (QSS) protocol called Zhang–Man protocol, the authors proposed two schemes to enhance the transmission efficiency of whole protocol. In the proposed improved protocol, the dealer can transmit double amount of secret messages at a time securely instead of doing the original Zhang–Man protocol twice. Besides, the authors save a lot of cost of whole QSS system. When the amount of secret messages is large and the number of agents is more, the performance of our protocol is much better than the Zhang–Man protocol. The authors also proposed a reuse scheme, after the secret message had been deduced, the left qubits can be reused for a new round. All of the scheme the authors mentioned above could be extended to multiparty cases in practice. - Author(s): J. Astorga ; E. Jacob ; M. Huarte ; M. Higuero
- Source: IET Information Security, Volume 6, Issue 2, p. 93 –101
- DOI: 10.1049/iet-ifs.2010.0259
- Type: Article
- + Show details - Hide details
-
p.
93
–101
(9)
The authors present Ladon, an enhanced version of Kerberos which extends the original protocol with authorisation capacity and relaxes the necessity of clock synchronisation by adding to the protocol special limited-lifetime nonces. This way, although all entities need timers, only the clocks of the two servers that constitute the key distribution centre must be synchronised with each other. The design of this protocol is motivated by the emergence of a new trend of applications in which sensors and low-capacity devices become tiny information or application servers directly addressable by any Internet-connected entity. Despite the huge potential of these environments, security is probably the greatest barrier to their long-term success. To address this issue, Ladon allows for end-to-end pair-wise key establishment in an authenticated and authorised manner, while keeping the introduced storage, computational and communication overhead very low. The security analysis with the AVISPA formal validation tool shows that the protocol meets the stated security goals, whereas the performance analysis shows that the overhead of the protocol is bounded and comparable to that of other security protocols which provide even less functionalities. - Author(s): Y. Yu ; Y. Mu ; G. Wang ; Q. Xia ; B. Yang
- Source: IET Information Security, Volume 6, Issue 2, p. 102 –110
- DOI: 10.1049/iet-ifs.2011.0004
- Type: Article
- + Show details - Hide details
-
p.
102
–110
(9)
Certificateless cryptography shares many features of identity-based cryptography and partially solves the problem of key escrow. Three certificateless signature schemes without random oracles were found in the literature. However, all the schemes suffer from some common drawbacks. First, by obtaining a signature on a message and replacing the public key of a signer, an adversary can forge valid signatures on the same message under the replaced public key. Secondly, all the schemes require a relatively large size of public parameters. The authors propose a new certificateless signature scheme, which exhibits an improvement on the existing schemes. Compared with the previous schemes, the proposed scheme offers stronger security, shorter system parameters and higher computational efficiency. - Author(s): A. Feng ; M. Knieser ; M. Rizkalla ; B. King ; P. Salama ; F. Bowen
- Source: IET Information Security, Volume 6, Issue 2, p. 111 –121
- DOI: 10.1049/iet-ifs.2010.0073
- Type: Article
- + Show details - Hide details
-
p.
111
–121
(11)
Inter-integrated circuit mode (I2C) software is used to communicate between sensors and on embedded control system utilising PIC182585 MPLAB hardware. These sensors were built as part of a system on-board that includes sensors, a Q2 microcontroller and interface circuitry. The hardware includes a PIC18 processor, a field programmable gate array (FPGA) chip and peripherals. The FPGA chip is used to interface the processor with the peripherals operating at the same clock speed. This hardware design features high-level integration, reliability, high precision and high-speed communications. The system was demonstrated using temperature and CO2 sensors. The overall system was implemented and successfully tested. The response of the multi-sensor system was agreeable with the design parameters. The system is expandable to include other sensors such as light and pressure sensors. Monitoring threshold values should add to the security features of the integrated communication system. The use of a signature detection algorithm to determine threatening situation and/or intrusion within the sittings are discussed as a potential application for home land security. The integrated system features low-power consumption (utilising the sleeping mode of the processors), high-speed communications, security and flexibility to expansion.
Attribute-based signature scheme with constant size signature in the standard model
Internal state recovery of Grain-v1 employing normality order of the filter function
Provably secure convertible multi-authenticated encryption scheme
Keypad against brute force attacks on smartphones
Light-weight trust-based routing protocol for mobile ad hoc networks
Enhanced multiparty quantum secret sharing of classical messages by using entanglement swapping
Ladon: end-to-end authorisation support for resource-deprived environments
Improved certificateless signature scheme provably secure in the standard model
Embedded system for sensor communication and security
Most viewed content for this Journal
Article
content/journals/iet-ifs
Journal
5
Most cited content for this Journal
-
High accuracy android malware detection using ensemble learning
- Author(s): Suleiman Y. Yerima ; Sakir Sezer ; Igor Muttik
- Type: Article
-
Crypto-based algorithms for secured medical image transmission
- Author(s): Ali Al-Haj ; Gheith Abandah ; Noor Hussein
- Type: Article
-
Pseudorandom bit generator based on non-stationary logistic maps
- Author(s): Lingfeng Liu ; Suoxia Miao ; Hanping Hu ; Yashuang Deng
- Type: Article
-
Constructing important features from massive network traffic for lightweight intrusion detection
- Author(s): Wei Wang ; Yongzhong He ; Jiqiang Liu ; Sylvain Gombault
- Type: Article
-
Empirical analysis of Tor Hidden Services
- Author(s): Gareth Owen and Nick Savage
- Type: Article
