By Topic

Information Security, IET

Issue 2 • Date June 2010

Filter Results

Displaying Results 1 - 7 of 7
  • On the security of an identity-based proxy multi-signature scheme

    Page(s): 45 - 48
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (126 KB)  

    In 2000, Yi et al. proposed two proxy multi-signature schemes which enable two or more original signers to delegate their signing power to a proxy signer. Combining proxy multi-signature with identity-based cryptography, Wang et al. proposed an identity-based proxy multi-signature scheme in 2007. Their scheme is claimed to be secure in the random oracle model. However, in this study, the author shows that Wang et al.'s scheme is vulnerable to a forgery attack described in this study. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algebraic cryptanalysis of a small-scale version of stream cipher Lex

    Page(s): 49 - 61
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (321 KB)  

    In this study, the authors analyse with respect to algebraic attacks a small-scale version of the stream cipher Lex. They base it on a small-scale version of the block cipher advanced encryption standard (AES) with 16-bit state and 16-bit key. They represent the small-scale Lex and its key schedule in two alternative ways: as a system of cubic boolean equations and as a system of quadratic boolean equations. The authors use Gröbner bases to solve the two systems for different number of rounds and sizes of the leak. They obtain the best results for the quadratic representation of the cipher. For this case they are able to recover the secret key in time less than 2̈ min by solving a system of 374 quadratic boolean equations in 208 unknowns resulting from 5 rounds of the cipher. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Anonymous voting by two-round public discussion

    Page(s): 62 - 67
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (184 KB)  

    In 2006, Hao and Zieliński proposed a two-round anonymous veto protocol (called AV-net), which provided exceptional efficiency compared to related techniques. In this study, the authors add a self-tallying function to the AV-net, making it a general-purpose voting protocol. The new protocol works in the same setting as the AV-net ́ it requires no trusted third parties or private channels, and participants execute the protocol by sending two-round public messages. Compared with related voting protocols in past work, this is significantly more efficient in terms of the number of rounds, computational cost and bandwidth usage. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cooperative communications based on trust model for mobile ad hoc networks

    Page(s): 68 - 79
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (577 KB)  

    Wireless networks provide a realm in which cooperation among large numbers of egoists can be attained. As the non-cooperative behaviours of nodes will significantly degrade the network performance, effective cooperation incentive of nodes has become a hot issue in cooperative communication. Although a reputation system can stimulate nodes to cooperate with each other, the recommendation-based trust model may cause a decline in network performance, because of fake recommendation, convergence of iteration and node redemption. To address the above issues, a topology transform-based recommendation trust model is proposed to relieve the malicious effects on the accuracy of recommendation trust, which stem from fake recommendation. Some mathematical analysis and simulation results reveal that the global trust of this proposed trust model has convergence characteristic, and the reputation system with this model can more effectively stimulate node cooperation and performs better in terms of packet successful delivery ratio and mean number of packets dropped. Moreover, the topology transform-based recommendation trust algorithm makes this reputation system more suitable for large-scale networks. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mining frequent itemsets in the presence of malicious participants

    Page(s): 80 - 92
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (496 KB)  

    Privacy preserving data mining (PPDM) algorithms attempt to reduce the injuries to privacy caused by malicious parties during the rule mining process. Usually, these algorithms are designed for the semi-honest model, where participants do not deviate from the protocol. However, in the real-world, malicious parties may attempt to obtain the secret values of other parties by probing attacks or collusion. In this study, the authors study how to preserve the privacy of participants in a collusion-free model of the frequent itemset mining process, where the protocol protects against probing attacks and collusion. The mining of frequent itemsets is the main step of association rule mining algorithms, and, in this study, the authors propose two privacy-preserving frequent itemset mining algorithms for both two-party and multi-party states in a collusion-free model for vertically partitioned (heterogeneous) data; in addition, a privacy measuring technique is proposed, which quantifies privacy based on the amount of disclosed sensitive information. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Anonymous roaming in universal mobile telecommunication system mobile networks

    Page(s): 93 - 103
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (362 KB)  

    A secure roaming protocol for mobile networks is proposed. Roaming has been analysed in some schemes from the security point of view; however, there are vulnerabilities in most of them and so the claimed security level is not achieved. The scheme offered by Wan et al. recently is based on hierarchical identity-based encryption, in which the roaming user and the foreign network mutually authenticate each other without the help of the home network. Although the idea behind this proposal is interesting, it contradicts technical considerations such as routing and billing. The proposed protocol makes use of similar functions used in Wan et al.'s scheme but contributes a distinguished structure that overcomes the previous shortcomings and achieves a higher possible level of security in mobile roaming as well as enhancing the security of the key issuing procedure. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Attribute-based ring signature scheme with constant-size signature

    Page(s): 104 - 110
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (167 KB)  

    An attribute-based ring signature scheme with constant size and constant number of pairings computation is proposed. The signer signs messages by using a subset of its attributes. All the users who possess the subset of these attributes form a ring. It requires that anyone cannot tell who generates the signature in this ring. Furthermore, anyone out of this ring could not forge the signature on behalf of the ring. It is proved to be unforgeable in the standard model and unconditionally anonymous. To the best of the authors' knowledge, such a construction is introduced for the first time. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.

Aims & Scope

IET Information Security publishes original research papers in the following areas of information security and cryptography.

Full Aims & Scope

Meet Our Editors

Publisher
IET Research Journals
iet_ifs@theiet.org