By Topic

IEE Proceedings - Computers and Digital Techniques

Issue 5 • Date Sep 1999

Filter Results

Displaying Results 1 - 8 of 8
  • Cryptographic key assignment scheme for dynamic access control in a user hierarchy

    Publication Year: 1999, Page(s):235 - 240
    Cited by:  Papers (13)  |  Patents (6)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (532 KB)

    The authors present a cryptographic key assignment scheme based on both the Rabin public key system and the Chinese remainder theorem, in order to solve dynamic access control problems in user hierarchies. Compared to earlier assignment schemes, the new scheme ensures that a security class can efficiently derive secret keys of its successors. Dynamic access control problems, such as adding/deletin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scheduling schemes for data farming

    Publication Year: 1999, Page(s):227 - 234
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (704 KB)

    The use of order statistics to arrive at a scheduling regime is shown to be applicable to data farms running on second-generation parallel processors. Uniform and decreasing task-size scheduling regimes are examined. Experimental timings and a further simulation for large-scale effects were used to exercise the scheduling regimes. The paper also considers a number of other scheduling schemes for d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • (t,n) threshold verifiable multisecret sharing scheme based on factorisation intractability and discrete logarithm modulo a composite problems

    Publication Year: 1999, Page(s):264 - 268
    Cited by:  Papers (2)  |  Patents (1)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (420 KB)

    A new (t, n) threshold verifiable multisecret sharing ((t, n) VMSS) scheme, based on the intractability of the factorisation and the discrete logarithm modulo a large composite problems, is proposed in which the dealer can freely give any set of multiple secrets for sharing, and the shadow held by the participant is not only reusable but also verifiable. The proposed scheme provides efficient solu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Instruction cache prefetching directed by branch prediction

    Publication Year: 1999, Page(s):241 - 246
    Cited by:  Papers (1)  |  Patents (2)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (604 KB)

    As the gap between processor speed and memory speed grows, so the performance penalty of instruction cache misses gets higher. Instruction cache prefetching is a technique to reduce this penalty. The prefetching methods determine the target line to be prefetched generally based on the current fetched line address. However, as the cache line becomes wider, it may contain multiple branches. This is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exact AEP model in signature analysis using LCM

    Publication Year: 1999, Page(s):247 - 252
    Cited by:  Papers (3)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (432 KB)

    Linear compacting modules (LCMs) cover a wide range of compacting machines, of which linear feedback shift registers (LFSRs) and linear cellular automata (LCA) are two examples. An exact analytical model for aliasing error probability (AEP) in signature analysis using LCMs is derived. The model quantitatively specifies the effects of the LCM architecture, including the number of stages, the LCM in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application of symbolic FSM Markovian analysis to protocol verification

    Publication Year: 1999, Page(s):221 - 226
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (552 KB)

    Computer-aided design tools for Markovian analysis and verification of digital circuits have gained much interest in the last few years. This is mainly due to the advent of effective data structures, e.g., binary and algebraic decision diagrams, for Boolean and pseudo-Boolean function representation and manipulation. The authors illustrate how those tools can be successfully exploited to analyse t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Study of an efficient simulation method

    Publication Year: 1999, Page(s):253 - 258
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (428 KB)

    Trace-driven simulation has been widely used to evaluate the performance of cache memory. Prior to this investigation, a number of research projects were proposed for reducing the long execution time of trace-driven simulation. In the paper, a one-pass algorithm, called the flash-PM algorithm, is proposed which is both simple and efficient. The Hash-PM algorithm facilitates simulation by reducing ... View full abstract»

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

    Publication Year: 1999, Page(s):259 - 263
    Cited by:  Papers (21)  |  Patents (1)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (456 KB)

    A (t, n) threshold proxy signature scheme allows t or more proxy signers from a designated group of n proxy signers to sign messages on behalf of an original signer. The authors review both Zhang's threshold proxy signature scheme and Kim's threshold proxy signature scheme. They show that Zhang's scheme suffers from some weaknesses and Kim's scheme suffers from a disadvantage. Based on Zhang's sch... View full abstract»

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