Royal Holloway

Information Security Group (2009)

Liang Chen, Royal Holloway, Jason Crampton

Role-based access control and role hierarchies have been the subject of considerable research in recent years. In this paper, we consider three useful applications of a new role-based access control...

Information Security Group (2009)

Waleed A. Alrodhan, Royal Holloway, Chris J. Mitchell, Royal Holloway

Abstract—Building support for delegation services into an identity federation system enhances its flexibility and scalability. Users may need to delegate all (or a subset) of their access rights or...

Information (2009)

Jason Crampton, Royal Holloway

Workflow systems have long been of interest to computer science researchers due to their practical relevance. Supporting delegation mechanisms in workflow systems is receiving increasing research...

2 (2008)

Simon R. Blackburn, Edlyn Teske, Royal Holloway

1 Introduction The classic baby-step giant-step algorithm due to Shanks (see, for example, Cohen [1]) makes use of a time-memory trade-off to search an interval of length n for a discrete logarithm...

References (2008)

Erik D. Demaine, Gregory Gutin, Royal Holloway, U. London, Dániel Marx, Ulrike Stege, ...

session of the Seminar on Structure Theory and FPT Algorithmics for Graphs, Digraphs and

A Client-side CardSpace-Liberty Integration Architecture ABSTRACT (2008)

Waleed A. Alrodhan, Royal Holloway

Over the last few years, many identity management schemes, frameworks and system specifications have been proposed; however these various schemes and frameworks are typically not interoperable. In...

Security (2008)

Peter Windirsch (tno, Participant(s) Vodafone, Royal Holloway, Devrient Siemens Ag, Workpackage Wp

Version 1.0 Total number of pages 23 The objective of this report is to identify standards and industry bodies as well as other projects which may work in technical fields related to SHAMAN and...

Avoiding Key Redistribution in Key Assignment Schemes (2008)

Harry Rowe, Jason Crampton, Royal Holloway

Abstract. A key assignment scheme is a model for enforcing an information flow policy using cryptographic techniques. Such schemes have been widely studied in recent years. Each security label is...

Information Security Acknowledgements (2008)

Amit D. Lakhani, G. Paterson, Royal Holloway, Amit D. Lakhani

The dissertation on deception techniques using honeypots has given me a wealth of information about the topic and security as a whole. In this regard, I would like to extend my gratitude to all those...

Coercive Subtyping in Lambda-Free Logical Frameworks (2008)

Robin Adams, Royal Holloway

Abstract. Coercive subtyping is a powerful approach to subtyping in dependent type theories, but its theoretical properties are often difficult to prove. Lambda-free logical frameworks such as TF...

COMPARATIVE ANALYSIS OF MULTIPLE MUSICAL PERFORMANCES (2008)

Royal Holloway

A technique for comparing numerous performances of an identical selection of music is described. The basic methodology is to split a one-dimensional sequence into all possible sequential...

LERSSE (2008)

Jason Crampton, Wing Leung, Royal Holloway, Konstantin Beznosov

We introduce the concept, model, and policy-specific algorithms for inferring new access control decisions from previous ones. Our secondary and approximate authorization model (SAAM) defines the...

John Shawe-Taylor (2008)

Royal Holloway, A Framework, Structural Risk Minimisation, Peter L. Bartlett

The paper introduces a framework for studying structural risk minimisation. The model views structural risk minimisation in a PAC context. It then considers the more general case when the hierarchy...

Application of Support Vector Machines to Fault Diagnosis and Automated Repair (2008)

C. Saunders, A. Gammerman, Royal Holloway

In this paper we consider the benefits of applying modern machine learning techniques to the problem of Fault Diagnosis and Automated Repair. In the modern manufacturing environment, many aspects of...

References (2008)

Erik D. Demaine, Gregory Gutin, Royal Holloway, U. London, Dániel Marx, Ulrike Stege, ...

session of the Seminar on Structure Theory and FPT Algorithmics for Graphs, Digraphs and

Access Control in a Distributed Object Environment Using XML and Roles ABSTRACT (2008)

Jason Crampton, Hemanth Khambhammettu, Royal Holloway, Egham Tw Ex

We discuss the design of an integrated security architecture for authorization and au-thentication in a distributed object environment. Our architecture will have four main components: an...

Centre for the History and Analysis of Recorded Music (2008)

Royal Holloway

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial...

The Use of Commodity Products in the ATLAS Level-2 Trigger (2008)

Royal Holloway

The ATLAS level-2 trigger has to offer an event rate reduction of approximately 1 in 100, from an input rate of up to 100 kHz. Studies indicate that using geometrical guidance from the level-1...

Information Security Group (2008)

S. Murphy, M. B. Paterson, Royal Holloway

Abstract. This paper considers the geometric properties of the Relinearisation algorithm and of the XL algorithm used in cryptology for equation solving. We give a formal description of each...

Signal Processing Group, Physics Department, (2008)

G. J. Scruby, S. J. Flockton, Royal Holloway, Egham Surrey, Tw Ex England

“Blind ” signal processing techniques have attracted a great deal of interest from the signal processing community in recent years. The term “blind ” refers to the fact that very little...

Information Security Group (2008)

Shenglan Hu, Chris J. Mitchell, Royal Holloway

zero configuration in a ubiquitous computing environment

How to Verify Dynamic Properties of Information Systems (2008)

Neil Evans, Helen Treharne, Regine Laleau, Marc Frappier, Royal Holloway, Departement Informatique

EB is an established formal technique, based on process algebra, for specifying Information Systems (IS) that have both complex state and event based features; as yet, EB has no tool support. Another...

Challenges for Trusted Computing (2008)

S. Balfe, E. Gallery, C. J. Mitchell, K. G. Paterson, Royal Holloway

This article identifies and discusses some of the key challenges that need to be addressed if the vision of Trusted Computing is to become reality. Topics addressed include issues with setting up and...

Information Security Group, (2008)

Shane Balfe, Eimear Gallery, Chris J. Mitchell, Kenneth G. Paterson, Royal Holloway

A trusted platform refers to a platform of the type championed by the Trusted Computing Group (TCG). That is, a trusted platform is “one which will behave in a particular manner for a specific...

Stoke Gifford (2008)

Liqun Chen, Chris J. Mitchell, Royal Holloway

Parsing ambiguities in authentication and key

bristol.ac.uk (2007)

Donghui Wu, Kristin P. Bennett, Nello Cristianini, John Shawe-taylor, Royal Holloway

The problem of controlling the capacity of decision trees is considered for the case where the decision nodes implement linear threshold functions. In addition to the standard early stopping and...

Shared Generation of Shared RSA Keys 1 (2007)

Simon Blackburn, Simon Blake-wilson, Certicom Corp, Mike Burmester, Steven Galbraith, Royal Holloway, ...

Research performed as an EPSRC CASE student at Royal Holloway sponsored by Racal Airtech. The paper considers the problem of distributed key generation for shared-control RSA schemes. In particular:...

and (2007)

Royal Holloway

Recent work in the theory of prediction with expert advice has shown that there exists an intrinsic measure of the difficulty of prediction of data sequences; this measure, which is a generalization...

and (2007)

V. V. V'yugin, Royal Holloway, Surrey Tw Ex, Surrey Tw Ex

One of the most efficient way of improving the performance of learning algorithms is "snooping", i.e. using some information about the data to be predicted for choosing the...

Signal Processing Group, Physics Department, (2007)

G. J. Scruby, S. J. Flockton, Royal Holloway, Egham Surrey, Tw Ex England

"Blind " signal processing techniques have attracted a great deal of interest from the signal processing community in recent years. The term "blind " refers to the...

THE APPLICATION OF GENETIC ALGORITHMS TO FEATURE RECOGNITION AND OBJECT COUNTING (2007)

Royal Holloway, M S White, E R Davies, S J Flockton

1. Introduction Even for the human, visual perception is a complex task, demanding vast resources of prior knowledge and involving the combined computational power of some 10 10

Application of Support Vector Machines to Fault Diagnosis and Automated Repair (2007)

Saunders Gammerman Royal, C. Saunders, A. Gammerman, Royal Holloway, Egham Surrey, H. Brown, ...

In this paper we consider the benefits of applying modern machine learning techniques to the problem of Fault Diagnosis and Automated Repair. In the modern manufacturing environment, many aspects of...

A Comment on "Bound for Linear Complexity of BBS Sequences" (2007)

Sean Murphy Information, Sean Murphy, Royal Holloway

Montoya Vitini et al gave a lower bound for the linear complexity of Blum--Blum--Shubb sequences. We show this result is incorrect. The lower bound for the linear complexity of Blum--Blum--Shubb...

SafeFM (DTI Project 9013) (2007)

Task Deliverable, H Treharne, M Bingham, Royal Holloway

Machine Notation, supported by the B-Toolkit. These specifications are built up piece by piece and may contain a number of complex interactions that can be difficult to navigate through. An...

A failures semantics for ET-LOTOS (2007)

Steve Schneider, Royal Holloway, Jeremy Bryans, Jim Davies

A denotational semantics is presented for ET-LOTOS [LeL94] in the style of semantics for timed CSP, in terms of timed failures with additional information about internal events. This semantics is...

MEASURES OF DYNAMICAL COMPLEXITY (2007)

Andrei N. Soklakov, Andrei N. Soklakov, Royal Holloway, Royal Holloway

The aim of the thesis is to dene, develop, and consider applications of dierent measures of dynamical complexity, i.e. the measures that would quantify complexity of system dynamics. These measures...

Breaking the Simple Authenticated Key Agreement (SAKA) protocol (2007)

Chris J. Mitchell, Royal Holloway

An active attack against a key agreement protocol based on a shared password is described 1. If poorly chosen, as passwords often are, the password can be compromised by a simple brute force search. 1

The programming language Gamma was originally introduced by Banatre and (2007)

S. J. Gay, Royal Holloway, C. L. Hankin

We take a systematic approach to the construction of a program logic for Gamma, by applying Abramsky's domain theory in logical form to a denotational semantics of the language. Starting from a...

A Comment on "Property of finite fields and its Cryptographic application" (2007)

Murphy And Mitchell, S. Murphy, C. J. Mitchell, Royal Holloway

The "new" property of finite fields given by Wei Baodian et al. is a well-known fundamental result in finite field theory.

Securing a Unix Server (2007)

Msc Thesis In, Royal Holloway, Kapetanakis Ioannis

The aim of this project is concentrated on producing a helpful guide on how to protect and secure a networked Unix server. It can be used as a security manual by System Administrators. It covers...

E, (2007)

Andrei N. Soklakov, Royal Holloway

Figure 1: Dyne measurements in cavity QED. The cavity resonant frequency is ωc and the cavity field decay rate is κ. The cavity is driven by an external laser field of frequency ω0 and strength E....

A Security Model for Anonymous Credential Systems (2007)

Andreas Pashalidis, Chris J. Mitchell, Royal Holloway

This paper proposes a formal model of the Bellare-Rogaway type [Bellare and Rogaway, 1994] that enables one to prove the security of an anonymous credential system in a complexity theoretic...

Tripartite Authenticated Key Agreement Protocols from Pairings (2007)

Kenneth G. Paterson, Royal Holloway

Joux's protocol [29] is a one round, tripartite key agreement protocol that is more bandwidth-e#cient than any previous three-party key agreement protocol. But it is insecure, su#ering from a...

Performance study of a COTS Distributed DBMS adapted for multilevel (2007)

Moses Garuba, Royal Holloway

Multilevel secure database management system (MLS/DBMS) products no longer enjoy direct commercial-off-the-shelf (COTS) support. Meanwhile, existing users of these MLS/DBMS products continue to rely...

Declaration (2007)

Anand S. Gajparia, Royal Holloway, Anand S. Gajparia, Anand Gajparia

These doctoral studies were conducted under the supervision of Chris J. Mitchell and Peter Wild. The work presented in this thesis is the result of original research carried out by myself, in...

An application-oriented framework for wireless sensor network key establishment (2007)

Keith M. Martin, Maura Paterson, Royal Holloway

The term wireless sensor network is applied broadly to a range of significantly different networking environments. On the other hand there exists a substantial body of research on key establishment...

On a Possible Privacy Flaw in Direct Anonymous Attestation (DAA) (2007)

Adrian Leung, Liqun Chen, Chris J. Mitchell, Royal Holloway

A possible privacy flaw in the TCG implementation of the Direct Anonymous Attestation (DAA) protocol has recently been discovered by Rudolph. This flaw allows a DAA Issuer to covertly include...

A Geometric View of Cryptographic Equation Solving (2007)

Sean Murphy, Maura Paterson, Royal Holloway

This paper considers the geometric properties of the Relinearisation algorithm and of the XL algorithm used in cryptology for equation solving. We give a formal description of each algorithm in terms...

Information Security Group, (2007)

Shane Balfe, Eimear Gallery, Chris J. Mitchell, Kenneth G. Paterson, Royal Holloway

Trusted Computing technology has been put forward as a potentially revolutionary addition to the field of information security. In this chapter we examine how Trusted Computing may be used to defend...

Parameterized Algorithms for Directed Maximum Leaf Problems (2007)

Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh, Royal Holloway

D is an out-tree if T is an oriented tree with only one vertex s of in-degree zero (called the root). The vertices of

Better Algorithms and Bounds for Directed Maximum Leaf Problems (2007)

Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh, Royal Holloway

Abstract. The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this paper, we...

SECURE CRYPTOGRAPHIC ALGORITHM IMPLEMENTATION ON EMBEDDED PLATFORMS (2006)

Michael Tunstall, Royal Holloway, Michael Tunstall, Michael Tunstall

These doctoral studies were conducted under the supervision of Prof. Chris Mitchell. The equipment for all of the experiments detailed in this thesis was provided in situ by Gemalto (formerly Gemplus...

Declaration (2006)

Caroline J. Kudla, Royal Holloway, Caroline J. Kudla, Caroline J. Kudla

These doctoral studies were conducted under the supervision of Kenneth G. Paterson. The work presented in this thesis is the result of original research carried out by myself, in collaboration with...

Declaration (2006)

Hoon Wei Lim, Royal Holloway, Hoon Wei Lim, Hoon Wei Lim

These doctoral studies were conducted under the supervision of Prof. Kenneth G.

Thisworkwouldnothavebeenpossiblewithoutthesupportofmanymentors,both (2006)

Anna M. Johnston, Royal Holloway

thankstomyfellowstudentsRoger,Laurence,Thomas,Colin,Maura,Illanaand colleaguesatSandiaNationalLaboratories1:BruceHendrickson,CindyPhillips, Su�Jeongforkeepingmesane....

CRYPTANALYSIS OF A HOMOMORPHIC PUBLIC-KEY (2006)

Public-key Cryptosystem, Su-jeong Choi, Royal Holloway, Su-jeong Choi

The aims of this research are to give a precise description of a new homomorphic public-key encryption scheme proposed by Grigoriev and Ponomarenko [7] in 2004 and to break Grigoriev and Ponomarenko...

SECURE CRYPTOGRAPHIC ALGORITHM IMPLEMENTATION ON EMBEDDED PLATFORMS (2006)

Michael Tunstall, Royal Holloway, Michael Tunstall

These doctoral studies were conducted under the supervision of Prof. Chris Mitchell. The equipment for all of the experiments detailed in this thesis was provided in situ by Gemalto (formerly Gemplus...

On key assignment for hierarchical access control (2006)

Jason Crampton, Keith Martin, Peter Wild, Royal Holloway

A key assignment scheme is a cryptographic technique for implementing an information flow policy, sometimes known as hierarchical access control. All the research to date on key assignment schemes...

Proposal of the Next Incarnation of Accelerator Test Facility at KEK for the International Linear Collider (2005)

Araki, S., Hayano, H., Higashi, Y., Honda, Y., Kanazawa, K., Kubo, K., ...

To reach design luminosity, the International Linear Collider (ILC) must be able to create and reliably maintain nanometer size beams. The ATF damping ring is the unique facility where ILC emittances...

Proposal of the Next Incarnation of Accelerator Test Facility at KEK for the International Linear Collider (2005)

Araki, S., Hayano, H., Higashi, Y., Honda, Y., Kanazawa, K., Kubo, K., ...

To reach design luminosity, the International Linear Collider (ILC) must be able to create and reliably maintain nanometer size beams. The ATF damping ring is the unique facility where ILC emittances...

Proposal of the Next Incarnation of Accelerator Test Facility at KEK for the International Linear Collider (2005)

Araki, S., Hayano, H., Higashi, Y., Honda, Y., Kanazawa, K., Kubo, K., ...

To reach design luminosity, the International Linear Collider (ILC) must be able to create and reliably maintain nanometer size beams. The ATF damping ring is the unique facility where ILC emittances...

Proposal of the Next Incarnation of Accelerator Test Facility at KEK for the International Linear Collider (2005)

Araki, S., Hayano, H., Higashi, Y., Honda, Y., Kanazawa, K., Kubo, K., ...

To reach design luminosity, the International Linear Collider (ILC) must be able to create and reliably maintain nanometer size beams. The ATF damping ring is the unique facility where ILC emittances...

Proposal of the Next Incarnation of Accelerator Test Facility at KEK for the International Linear Collider (2005)

Araki, S., Hayano, H., Higashi, Y., Honda, Y., Kanazawa, K., Kubo, K., ...

To reach design luminosity, the International Linear Collider (ILC) must be able to create and reliably maintain nanometer size beams. The ATF damping ring is the unique facility where ILC emittances...

A unified theory of structural tractability for constraint satisfaction and spread cut decomposition (2005)

David Cohen, Royal Holloway

In this paper we introduce a generic form of structural decomposition for the constraint satisfaction problem, which we call a guarded decomposition. We show that many existing decomposition methods...

DYNAMIC FRAMEPROOF CODES (2005)

Maura Paterson, Royal Holloway, Maura Beth Paterson, Royal Holloway

There are many schemes in the literature for protecting digital data from piracy by the use of digital fingerprinting, such as frameproof codes, which prevent traitorous users from colluding to frame...

Understanding and developing role-based administrative models (2005)

Jason Crampton, Royal Holloway

Access control data structures generally need to evolve over time in order to reflect changes to security policy and personnel. An administrative model defines the rules that control the state...

Information (2005)

Joshua Wright, Carlos Cid, Royal Holloway

In this paper the authors examine the mechanism used in Oracle databases for protecting users ' passwords. We review the algorithm used for generating password hashes, and show that the current...

Security of the Lin-Lai smart card based user authentication scheme (2005)

Chris J. Mitchell, Qiang Tang, Royal Holloway

The remote user authentication scheme of Lin and Lai, that uses a smart card and a fingerprint measurement, is reviewed and shown to possess significant security issues. 1

Timestamps and authentication protocols (2005)

Chris J. Mitchell, Royal Holloway

Timestamp-based authentication and key establishment protocols have received a number of criticisms, despite their potential efficiency advantages. The purpose of this paper is to propose a novel...

Projective Aspects of the AES Inversion (2005)

Wen-ai Jackson, Sean Murphy, Royal Holloway, Wen-ai Jackson, S. Murphy, Royal Holloway

Abstract. We consider the nonlinear function used in the Advanced Encryption Standard (AES). This nonlinear function is essentially inversion in the finite field GF(2 8), which is most naturally...

Error Oracle Attacks on CBC Mode: Is There a Future for CBC Mode Encryption? (2005)

Chris J. Mitchell, Royal Holloway

This paper is primarily concerned with the CBC block cipher mode. The impact on the usability of this mode of recently proposed padding oracle attacks, together with other related attacks described...

Interdomain User Authentication and Privacy (2005)

Andreas Pashalidis, Royal Holloway

This thesis looks at the issue of interdomain user authentication, i.e. user authentication in systems that extend over more than one administrative domain. It is divided into three parts. After a...

On the Satisfiability of Constraints in Workflow Systems (2004)

Jason Crampton, Royal Holloway

The specification and enforcement of authorization policies such as separation of duty and binding of duty in workflow systems is an important area of current research in computer security. We...

Declaration (2004)

Mansour Al-meaither, Royal Holloway

Secure electronic payments for Islamic finance by Mansour Al-Meaither Thesis submitted to the University of London

Declaration (2004)

Royal Holloway, Prof Chris Mitchell

These doctoral studies were conducted under the supervision of Dr. Kenneth G.

A Security Model for Anonymous Credential Systems (2004)

Andreas Pashalidis, Chris J. Mitchell, Royal Holloway

This paper proposes a formal model of the Bellare-Rogaway type [1] that enables one to prove the security of an anonymous credential system in a complexity theoretic framework.

Comments on a Cryptographic Key Assignment (2004)

Scheme Qiang Tang, Qiang Tang, Chris J. Mitchell, Royal Holloway

In this paper we analyse the security of a cryptographic key assignment scheme, recently proposed by Huang and Chang, that is designed to provide time-constrained hierarchical access control. We show...

Information Security Group (2004)

Qiang Tang, Chris J. Mitchell, Royal Holloway

Comments on two anonymous conference key distribution systems

Some observations on the Bit-Search Generator (2004)

Chris J. Mitchell, Royal Holloway

In this short note an alternative definition of the Bit-Search Generator (BSG) is provided. This leads to a discussion of both the security of the BSG and ways in which it might be modified to either...

On the Satisfiability of Constraints in Workflow Systems (2004)

Jason Crampton, Royal Holloway

The specification and enforcement of authorization policies such as separation of duty and binding of duty in workflow systems is an important area of current research in computer security. We...

Lexique 2: A new French lexical database (2004)

Boris New, Christophe Pallier, Marc Brysbaert, Ludovic Ferr, Royal Holloway, U Service, ...

In this paper, we present a new lexical database for French: Lexique. In addition to classical word information such as gender, number, and grammatical category, Lexique also includes a series of...

On the security of XCBC, TMAC and OMAC (2003)

Chris J. Mitchell, Royal Holloway

The security provided by the XCBC, TMAC and OMAC schemes is analysed and compared with other MAC schemes. The results imply that there is relatively little to be gained practically through the...

Enhancing ecommerce security using GSM authentication (2003)

Vorapranee Khu-smith, Chris J. Mitchell, Royal Holloway

Today, e-commerce transactions are typically protected using SSL/TLS. However, there are risks in such use of SSL/TLS, notably threats arising from the fact that information is stored in clear at the...

Single sign-on using trusted platforms (2003)

Andreas Pashalidis, Chris J. Mitchell, Royal Holloway

Network users today have to remember one username/password pair for every service they are registered with. One solution to the security and usability implications of this situation is Single...

The stability of kernel principal components analysis and its relation to the process eigenspectrum (2003)

The Process Eigenspectrum, John Shawe-taylor, Royal Holloway

In this paper we analyze the relationships between the eigenvalues of the mm Gram matrix K for a kernel k(; ) corresponding to a sample x 1; : : : ; xm drawn from a density p(x) and the eigenvalues...

On Recursive Parametric Estimation Theory Teo Sharia (2003)

Teo Sharia, Royal Holloway

The classical non-recursive methods to estimate unknown parameters of the model, such as the maximum likelihood method, the method of least squares etc. eventually require maximization procedures....

Certificateless Public Key Cryptography (2003)

Kenneth G. Paterson, Royal Holloway

This paper introduces the concept of certificateless public key cryptography (CL-PKC).

Online Classification on a Budget (2003)

Koby Crammer, Jaz Kandola, Royal Holloway, Yoram Singer

Online algorithms for classification often require vast amounts of memory and computation time when employed in conjunction with kernel functions. In this paper we describe and analyze a simple...

On the security (2002)

Chris Mitchell, Participant(s) Vodafone, Royal Holloway, Siemens Atea, Workpackage Wp, Est Person Months

Initial report on PKI requirements for heterogeneous roaming and distributed terminals SHA/DOC/RHUL/WP3/D04/1.0

On the theory of point weight designs (2002)

Alexander W. Dent, Royal Holloway

A point-weight incidence structure is a structure of blocks and points where each point is associated with a positive integer weight. A point-weight design is a point-weight incidence structure where...

A Security Architecture for Agent-Based Mobile Systems (2002)

N. Borselius, N. Hur, M. Kaprynski, C. J. Mitchell, Royal Holloway

Future mobile systems are expected to exploit the flexibility of agent-based software in a variety of ways. This will include agents providing both middleware and application-level functionality....

Essential Algebraic Structure within the AES (2002)

S. Murphy, Royal Holloway

One difficulty in the cryptanalysis of the Advanced Encryption Standard AES is the tension between operations in the two fields ) and GF (2). This paper outlines a new approach that avoids this...

The security of the GSM air interface protocol (2001)

Chris J. Mitchell, Royal Holloway

This paper describes the level of security oered by the GSM air interface protocol 1. All known attacks against this protocol are described, and their feasibility is assessed. Consideration of the...

analysis and applications of cryptographic techniques (2001)

Royal Holloway, Chan Yeob Yeun, Chan Yeob Yeun

Cryptographic techniques, such as encipherment, digital signatures, key manage-ment and secret sharing schemes, are important building blocks in the implemen-tation of all security services. In this...

On the theory of Point Weight Designs (2001)

Alexander W. Dent, Royal Holloway

A point-weight incidence structure is a structure of blocks and points where each point is associated with a positive integer weight. A point-weight design is a point-weight incidence structure where...

Remarks on the security of the Alpha1 stream cipher (2001)

Chris J. Mitchell, Royal Holloway

A preliminary analysis of the Alpha1 stream cipher is given. Some undesirable properties are identified.

Sparsity vs. Large Margins for Linear Classifiers (2000)

Ralf Herbrich Statistics, Ralf Herbrich, Thore Graepel, John Shawe-taylor, Royal Holloway

We provide small sample size bounds on the generalisation error of linear classifiers that take advantage of large observed margins on the training set and sparsity in the data dependent expansion...

Generalisation Error Bounds for Sparse Linear Classifiers (2000)

Thore Graepel, Ralf Herbrich, John Shawe-taylor, Royal Holloway

We provide small sample size bounds on the generalisation error of linear classifiers that are sparse in their dual representation given by the expansion coefficients of the weight vector in terms of...

Sparsity vs. Large Margins for Linear Classifiers (2000)

Ralf Herbrich, Thore Graepel, John Shawe-taylor, Royal Holloway

We provide small sample size bounds on the generalisation error of linear classifiers that take advantage of large observed margins on the training set and sparsity in the data dependent expansion...

Generalisation Error Bounds for Sparse Linear Classifiers (2000)

Thore Graepel Statistics, Thore Graepel, Ralf Herbrich, John Shawe-taylor, Royal Holloway

We provide small sample size bounds on the generalisation error of linear classifiers that are sparse in their dual representation given by the expansion coefficients of the weight vector in terms of...

Support Vector Density Estimation (1999)

J. Weston, A. Gammerman, M. O. Stitson, V. Vapnik, V. Vovk, C. Watkins, ...

> (x); (1.1) 1. `(x) = ( 1; x ? 0 0; otherwise Generic author design sample pages 1999/07/12 15:50 2 Support Vector Density Estimation where instead of knowing the distribution function F (x) we...

Support vector machine reference manual (1998)

C. Saunders, M. O. Stitson, J. Weston, Royal Holloway, L. Bottou, B. Scholkopf, ...

The Support Vector Machine (SVM) is a new type of learning machine. The SVM is a general architecture that can be applied to pattern recognition, regression estimation and other problems. The...

Robust Bounds on Generalization from the Margin Distribution (1998)

John Shawe-taylor, Royal Holloway, Nello Cristianini

A number of results have bounded generalization of a classifier in terms of its margin on the training points. There has been some debate about whether the minimum margin is the best measure of the...

Support Vector Machine - Reference Manual (1998)

C. Saunders, M. O. Stitson, J. Weston, Royal Holloway, L. Bottou, B. Schölkopf, ...

this document will describe these programs. To find out more about SVMs, see the bibliography. We will not describe how SVMs work here.

Support Vector Machine - Reference Manual (1998)

C. Saunders, M. O. Stitson, J. Weston, Royal Holloway, L. Bottou, B. Scholkopf, ...

this document will describe these programs. To find out more about SVMs, see the bibliography. We will not describe how SVMs work here.

Robust Bounds on Generalization from the Margin Distribution (1998)

John Shawe-taylor, Royal Holloway, Nello Cristianini

A number of results have bounded generalization of a classifier in terms of its margin on the training points. There has been some debate about whether the minimum margin is the best measure of the...

Margin Distribution Bounds on Generalization (1998)

John Shawe-taylor, Royal Holloway, Nello Cristianini

A number of results have bounded generalization of a classifier in terms of its margin on the training points. There has been some debate about whether the minimum margin is the best measure of the...

Information Security Group (1998)

Sean Murphy, Royal Holloway

Montoya Vitini et al gave alower bound for the linear complexity of Blum{Blum{Shubb sequences. We show this result is incorrect. The lower bound for the linear complexity of Blum{Blum{Shubb sequences...

Some recent research aspects of threshold cryptography (1997)

Yvo Desmedt, Royal Holloway

Abstract. In the traditional scenario in cryptography there is one sender, one receiver and an active or passive eavesdropper who is an opponent. Depending from the application the sender or the...

Prequential Probability: Principles and Properties (1997)

A. P. Dawid, V. G. Vovk, Royal Holloway

this paper we first illustrate the above considerations for a variety of appealling criteria, and then, in an attempt to understand this behaviour, introduce a new game-theoretic framework for...

The discovery of algorithmic probability (1997)

Ray J. Solomonoff, Royal Holloway

This paper will describe a voyage of discovery — the discovery of Algorithmic Probability. But before I describe that voyage —a few words about motivation. Motivation in science is roughly of two...

The discovery of algorithmic probability (1997)

Ray J. Solomonoff, Royal Holloway

This paper will describe a voyage of discovery — the discovery of Algorithmic Probability. But before I describe that voyage —a few words about motivation. Motivation in science is roughly of two...

Structural Risk Minimization over Data-Dependent Hierarchies (1996)

John Shawe-taylor, Royal Holloway, Peter L. Bartlett, Robert C. Williamson, Martin Anthony

The paper introduces some generalizations of Vapnik's method of structural risk minimisation (SRM). As well as making explicit some of the details on SRM, it provides a result that allows one to...

A Framework for Structural Risk Minimisation (1996)

John Shawe-taylor, Royal Holloway, Peter L. Bartlett, Systems Engineering Dept, Robert C. Williamson, Engineering Dept, ...

The paper introduces a framework for studying structural risk minimisation. The model views structural risk minimisation in a PAC context. It then considers the more general case when the hierarchy...

Computation with Clifford valued Feed-Forward Networks (1996)

Justin Pearson, Royal Holloway, D. L. Bisset

Recent research has focused on feed-forward networks with complex weights and activation values such as [GK92, Hir92b, Hir92a, Hir93]. This paper extends this formalism to feed-forward networks with...

Modelling security properties with CSP (1996)

Steve Schneider, Royal Holloway

Security properties such as confidentiality and authenticity may be considered in terms of the flow of messages within a network. To the extent that this characterisation is justified, the use of a...

Using CSP for protocol analysis: the Needham-Schroeder Public-Key Protocol (1996)

Steve Schneider, Royal Holloway

This paper presents a general approach for analysis and verification of authentication properties in CSP. It is illustrated by an examination of the Needham-Schroeder Public-Key protocol. The paper...

A Proposed Architecture for Trusted Third Party Services (1996)

Nigel Jefferies, Chris Mitchell, Michael Walker, Royal Holloway, Egham Hill

In this paper we propose a novel solution to the problem of providing trusted third party services, such as the management of cryptographic keys for end-to-end encryption, in a way that meets legal...

Machine Learning: Progress and Prospects (1996)

Alexander Gammerman, Royal Holloway

ay). Or it may be that, like almost everything else in Western civilisation and culture, the origin of these ideas lies in the Mediterranean? After all, it was Aristotle who said that "we learn...

Requirements, Traceability and Formal Software Development or a Further Analysis of Requirements Traceability (1996)

Justin K. Pearson, Royal Holloway

This paper is concerned with the interaction between formal software development and the issue of requirements traceability. The paper offers an analysis of the requirements traceability problem (see...

A Framework for Structural Risk Minimisation (1996)

John Shawe-taylor, Royal Holloway, Peter L. Bartlett, Robert C. Williamson, Martin Anthony

The paper introduces a framework for studying structural risk minimisation. The model views structural risk minimisation in a PAC context. It then considers the more general case when the hierarchy...

The Royal Holloway TTP-based key escrow scheme (1996)

Chris J. Mitchell, Royal Holloway

In this paper we describe the Royal Holloway key escrow scheme, which provides a solution to the problem of managing cryptographic keys for end-to-end encryption in a way that meets legal...

Security properties and CSP (1995)

Steve Schneider, Royal Holloway

Security properties such as confidentiality and authenticity may be considered in terms of the flow of messages within a network. To the extent that this characterisation is justified, the use of a...

Royal Holloway The Courtyard (1995)

Sean Murphy, Fred Piper, Michael Walker, Peter Wild, Royal Holloway, Sean Murphy, ...

In this paper, we give a general framework for the analysis of block ciphers using the statistical technique of likelihood estimation. We show how various recent successful cryptanalyses of block...

The application of genetic algorithms to infinite impulse response adaptive filters (1993)

Stuart J Flockton, Michael S White, Royal Holloway, Tw Ex

Adaptive infinite impulse response filters require the exploration of a multimodal error surface. We describe the use of genetic algorithms for this particular problem and demonstrate that our...

Pairs And Triplets Of Des S-Boxes (1993)

Donald Davies, Sean Murphy, Royal Holloway, Bedford New College

This paper describes an investigation of a potential weakness in DES which leads to a statistical property observable in plaintextciphertext pairs and dependent on the key. However, the number of...