scispace - formally typeset
Search or ask a question

Showing papers by "Chris J. Mitchell published in 1997"


Book ChapterDOI
07 Jul 1997
TL;DR: A threshold secret sharing scheme based on polynomial interpolation and the Diffie-Hellman problem is presented, which can be used for the reconstruction of multiple secrets and shares can be individually verified during both share distribution and secret recovery.
Abstract: We present a threshold secret sharing scheme based on polynomial interpolation and the Diffie-Hellman problem In this scheme shares can be used for the reconstruction of multiple secrets, shareholders can dynamically join or leave without distributing new shares to the existing shareholders, and shares can be individually verified during both share distribution and secret recovery

34 citations


Book
01 Jan 1997
TL;DR: The Combinatorics of some Abstract Data Types Recent Results in the Theory or Program Flowgraphs Applications of Combinatorial Structures to Security
Abstract: The Combinatorics of some Abstract Data Types Recent Results in the Theory or Program Flowgraphs Applications of Combinatorics to Security The Regular Coloration of Graphs The Use of Combinatorial Structures in Communication Signal Design A Constructive Algorithm for Neural Network Design with Application to Channel Equalization The Weight Distribution of K M Codes Densities of Perfect Linear Complexity Profile Binary Sequences When Constraints are Easy to Satisfy A Unified Approach to Problems in Radio Channel Assignment Interconnection Networks Based on Two-dimensional de Bruijn Graphs A Graph Theoretic Solution to the Interface Equation Uniformly Optimally Reliable Networks for Vertex Failures Multi-Function Coding and Modulation for Spread Spectrum and CDMA with Inherent Security Multi-Stage Scheduling Problems with Precedence Constraints Frequency Assignment for Cellular Radio Networks

9 citations


Journal ArticleDOI
TL;DR: The relationship between key distribution and entity authentication is described, and examples of practical authentication protocols are given, together with some of the pitfalls awaiting designers of such protocols.

7 citations


Book ChapterDOI
03 Jun 1997
TL;DR: The 'Royal Holloway' (RH) key escrow scheme is described in a way which is intended to clarify and motivate its design, and the properties of this scheme and some related schemes are considered.
Abstract: The first part of this paper is devoted to explaining what key escrow is and why it exists, and attempts to put it into a historical context. The subsequent focus is primarily on key escrow schemes which will work in an international environment. The possibility of using conventional key distribution techniques to provide key escrow services in an international context is first considered, and the associated problems are explored. The 'Royal Holloway' (RH) key escrow scheme is then described in a way which is intended to clarify and motivate its design, and the properties of this scheme and some related schemes are considered.

5 citations


Journal ArticleDOI
TL;DR: In this protocol, as long as all servers do not collude to defraud the clients, either a session key is successfully established, or the protocol fails in such a way that the clients are aware that it has failed.
Abstract: A number of key distribution protocols using multiple authentication servers, where a minority of them may be untrustworthy, have recently been proposed. This paper analyses the problem of key distribution using minimally trusted multiple servers, and presents a new protocol. In this protocol, as long as all servers do not collude to defraud the clients, either a session key (not known to any server) is successfully established, or the protocol fails in such a way that the clients are aware that it has failed, i.e. the protocol works in a situation where the servers are 'minimally trusted'.

5 citations


Journal ArticleDOI
TL;DR: New constructions for de Bruijn sequences and Perfect Factors are described, all based upon the idea of constructing one sequence (or set of sequences) from another.
Abstract: In this paper we describe new constructions for de Bruijn sequences and Perfect Factors. These constructions are all based upon the idea of constructing one sequence (or set of sequences) from another. As a result of this fact, the sequences obtained from these construction methods possess simple decoding algorithms based on decoding the sequences used to construct them. Such decoding algorithms are of importance in position--location applications.

3 citations


Book ChapterDOI
11 Nov 1997
TL;DR: This paper proposes a variant of the M'Raihi scheme to prevent the bank and blinding office from impersonating the user, so that the user cannot deny it if he abuses a coin himself.
Abstract: At Asiacrypt 1996, M'Raihi presented an electronic payment scheme using a blinding office to achieve anonymity. This scheme allows both a bank and a blinding office to impersonate a user without being detected. It may result in a denial problem where the user can deny his bad behaviour by suggesting that either the bank or the blinding office did wrong. This paper proposes a variant of the M'Raihi scheme to prevent the bank and blinding office from impersonating the user, so that the user cannot deny it if he abuses a coin himself.

1 citations


Journal ArticleDOI
TL;DR: This paper presents two systolic algorithms for modular exponentiations based on a k-SR representation, which saves nearly n/4 processing elements and around n/ 4 modular multiplications, compared with the scheme in [23]
Abstract: This paper presents two systolic algorithms for modular exponentiations based on a k-SR representation. In a systolic k-SR scheme, throughput is one modular exponentiation of a message block having n digits in every clock cycle, with a latency of nearly 5n/4 cycles to output the final result. The speedup for a group of messages having /message blocks is around (5\6l +2/3n), compared to a single processor or processing element for modular multiplications. The scheme saves nearly n/4 processing elements and around n/4 modular multiplications, compared with the scheme in [23]

1 citations