Boiten, Eerke and Grundy, Dan (2008) Reduction and refinement. Electronic Notes in Theoretical Computer Science, 201C . pp. 31-44. ISSN 1571-0661.
| The full text of this publication is not available from this repository. (Contact us about this Publication) | |
| Official URL http://dx.doi.org/10.1016/j.entcs.2008.02.014 |
Abstract
In this paper we explore the relation between refinement and reduction, especially as it is used in the context of cryptography. We show how refinement is a special case of reduction, and more interestingly, how reduction is an instance of a novel generalisation, ''refinement with context''.
| Item Type: | Article |
|---|---|
| Additional information: | Proceedings of the BCS-FACS Refinement Workshop, Oxford, 2007. doi 10.1016/j.entcs.2008.02.014 |
| Uncontrolled keywords: | refinement, reduction, cryptography, complexity, IO-refinement |
| Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
| Divisions: | Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group |
| Depositing User: | Mark Wheadon |
| Date Deposited: | 29 Mar 2010 12:09 |
| Last Modified: | 29 Mar 2010 12:09 |
| Resource URI: | http://kar.kent.ac.uk/id/eprint/23963 (The current URI for this page, for reference purposes) |
- Depositors only (login required):
