ORCID Profile
0000-0002-3515-8436
Current Organisation
Birkbeck, University of London
Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the Feedback Form.
Publisher: Walter de Gruyter GmbH
Date: 2008
DOI: 10.1515/JMC.2008.004
Publisher: Springer Berlin Heidelberg
Date: 2009
Publisher: Springer Science and Business Media LLC
Date: 03-02-2007
Publisher: Springer Science and Business Media LLC
Date: 29-11-2007
Publisher: American Institute of Mathematical Sciences (AIMS)
Date: 2009
Publisher: Springer Berlin Heidelberg
Date: 2014
Publisher: Association for Computing Machinery (ACM)
Date: 08-09-2014
DOI: 10.1145/2629661
Abstract: We present a formalisation of a category of schemes that we refer to as broadcast-enhanced key predistribution schemes (BEKPSs). These schemes are suitable for networks with access to a trusted base station and an authenticated broadcast channel. We demonstrate that the access to these extra resources allows for the creation of BEKPSs with advantages over key predistribution schemes such as flexibility and more efficient revocation. There are many possible ways to implement BEKPSs, and we propose a framework for describing and analysing them. In their paper “From Key Predistribution to Key Redistribution,” Cichoń et al. [2010] propose a scheme for “redistributing” keys to a wireless sensor network using a broadcast channel after an initial key predistribution. We classify this as a BEKPS and analyse it in that context. We provide simpler proofs of some results from their paper, give a precise analysis of the resilience of their scheme, and discuss possible modifications. We then study two scenarios where BEKPSs may be particularly desirable and propose a suitable family of BEKPSs for each case. We demonstrate that they are practical and efficient to implement, and our analysis shows their effectiveness in achieving suitable trade-offs between the conflicting priorities in resource-constrained networks.
Publisher: Springer Berlin Heidelberg
Date: 2008
Publisher: Elsevier BV
Date: 05-2008
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2020
Publisher: Springer Science and Business Media LLC
Date: 09-07-2019
Publisher: Springer Science and Business Media LLC
Date: 16-09-2014
Publisher: Springer Science and Business Media LLC
Date: 15-12-2010
Publisher: Springer International Publishing
Date: 2017
Publisher: Association for Computing Machinery (ACM)
Date: 08-2010
Abstract: Recent literature contains proposals for key predistribution schemes for sensor networks in which nodes are deployed in separate groups. In this article we consider the implications of group deployment for the connectivity and resilience of a key predistribution scheme. We propose a flexible scheme, based on the structure of a resolvable transversal design. We demonstrate that this scheme permits effective trade-offs between resilience, connectivity and storage requirements within a group-deployed environment as compared with other schemes in the literature, and show that group deployment can be used to increase network connectivity, without increasing storage requirements or sacrificing resilience.
Publisher: Elsevier BV
Date: 03-2019
Publisher: IEEE
Date: 06-2017
Publisher: Walter de Gruyter GmbH
Date: 2013
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 03-2010
Publisher: Springer Berlin Heidelberg
Date: 2008
Publisher: Springer Science and Business Media LLC
Date: 31-08-2017
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 08-2010
Publisher: Springer Science and Business Media LLC
Date: 28-11-2016
Publisher: Walter de Gruyter GmbH
Date: 2008
DOI: 10.1515/JMC.2008.018
Publisher: IEEE
Date: 06-2017
Publisher: Springer Berlin Heidelberg
Date: 2009
Publisher: Elsevier BV
Date: 2018
Publisher: Elsevier BV
Date: 12-2016
Publisher: Walter de Gruyter GmbH
Date: 09-10-2015
Abstract: We study a method for key predistribution in a network of n users where pairwise keys are computed by hashing users' IDs along with secret information that has been (pre)distributed to the network users by a trusted entity. A communication graph G can be specified to indicate which pairs of users should be able to compute keys. We determine necessary and sufficient conditions for schemes of this type to be secure. We also consider the problem of minimizing the storage requirements of such a scheme we are interested in the total storage as well as the maximum storage required by any user. Minimizing the total storage is NP-hard, whereas minimizing the maximum storage required by a user can be computed in polynomial time.
Publisher: Springer Science and Business Media LLC
Date: 03-05-2015
Publisher: Springer Science and Business Media LLC
Date: 15-02-2013
Publisher: Springer Science and Business Media LLC
Date: 06-06-2012
Publisher: Walter de Gruyter GmbH
Date: 12-2018
Abstract: There has been considerable recent interest in “cloud storage” wherein a user asks a server to store a large file. One issue is whether the user can verify that the server is actually storing the file, and typically a challenge-response protocol is employed to convince the user that the file is indeed being stored correctly. The security of these schemes is phrased in terms of an extractor which will recover the file given any “proving algorithm” that has a sufficiently high success probability. This forms the basis of proof-of-retrievability (PoR) systems. In this paper, we study multiple server PoR systems. We formalize security definitions for two possible scenarios: (i) A threshold of servers succeeds with high enough probability (worst case), and (ii) the average of the success probability of all the servers is above a threshold (average case). We also motivate the study of confidentiality of the outsourced message. We give MPoR schemes which are secure under both these security definitions and provide reasonable confidentiality guarantees even when there is no restriction on the computational power of the servers. We also show how classical statistical techniques previously used by us can be extended to evaluate whether the responses of the provers are accurate enough to permit successful extraction. We also look at one specific instantiation of our construction when instantiated with the unconditionally secure version of the Shacham–Waters scheme. This scheme gives reasonable security and privacy guarantee. We show that, in the multi-server setting with computationally unbounded provers, one can overcome the limitation that the verifier needs to store as much secret information as the provers.
Location: United Kingdom of Great Britain and Northern Ireland
Location: United Kingdom of Great Britain and Northern Ireland
No related grants have been discovered for Maura Paterson.