By Topic

Information Security, IET

Issue 1 • Date March 2012

Filter Results

Displaying Results 1 - 6 of 6
  • Attack against a batch zero-knowledge proof system

    Publication Year: 2012 , Page(s): 1 - 5
    Click to expandAbstract | PDF file iconPDF (201 KB)  

    Chida and Yamamoto propose a batch proof algorithm to enhance the performance of multiple instances of zero knowledge proof of partial knowledge. When multiple instances of zero knowledge proof of partial knowledge need to be proved simultaneously, their proof algorithm employs a batching mechanism to reduce the cost in computation and communication. Unfortunately, their batch proof algorithm is n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and logical analysis on the access authentication scheme for satellite mobile communication networks

    Publication Year: 2012 , Page(s): 6 - 13
    Click to expandAbstract | PDF file iconPDF (490 KB)  

    It is important for security of satellite mobile communication networks to design an efficient access authentication process. A two-way access authentication scheme among mobile users, gateways and the Network Control Centre (NCC) is designed in this study. The authentication scheme consists of four phases: mobile users registration, mobile users management, mobile authentication and mobile authen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Obtaining more Karatsuba-like formulae over the binary field

    Publication Year: 2012 , Page(s): 14 - 19
    Click to expandAbstract | PDF file iconPDF (142 KB)  

    The aim of this study is to find more Karatsuba-like formulae for a fixed set of moduli polynomials in GF(2)[x]. To this end, a theoretical framework is established. The authors first generalise the division algorithm, and then present a generalised definition of the remainder of integer division. Finally, a generalised Chinese remainder theorem is used to achieve their initial goal.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cryptanalysis and improvements of an anonymous multi-receiver identity-based encryption scheme

    Publication Year: 2012 , Page(s): 20 - 27
    Cited by:  Papers (6)
    Click to expandAbstract | PDF file iconPDF (178 KB)  

    In 2010, Fan et al. presented an anonymous multi-receiver identity-based encryption scheme where they adopt Lagrange interpolating polynomial mechanism. They showed that their scheme makes it impossible for an attacker or any other message receiver to derive the identity of a message receiver such that the privacy of every receiver can be guaranteed. They also formally showed that every receiver i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Non-linear error detection for elliptic curve cryptosystems

    Publication Year: 2012 , Page(s): 28 - 40
    Click to expandAbstract | PDF file iconPDF (472 KB)  

    The authors propose applying systematic non-linear error-detection codes to protect elliptic curve point addition and doubling operations against active fault attacks. These codes provide nearly perfect error-detection capability (except with exponentially small probability) at reasonable overhead. The proposed technique is applied to secure point addition and doubling operations for both Weierstr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some results on fast algebraic attacks and higher-order non-linearities

    Publication Year: 2012 , Page(s): 41 - 46
    Click to expandAbstract | PDF file iconPDF (147 KB)  

    In this study, the authors investigate the resistance of Boolean functions against fast algebraic attacks and deduce a bound between fast algebraic immunity and higher-order non-linearity (it is the first time that a bound between these two cryptographic criteria is given). The authors then show that the fast algebraic immunity of the following two classes of Boolean functions is not good: (a) The... 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