Boiten, Eerke Albert, Grundy, Dan (2008) Reduction and refinement. Electronic Notes in Theoretical Computer Science, 201 . pp. 31-44. ISSN 1571-0661. (doi:10.1016/j.entcs.2008.02.014) (KAR id:23963)
|
PDF
Author's Accepted Manuscript
Language: English |
|
|
Click to download this file (325kB)
|
![[thumbnail of reduce.pdf]](https://kar.kent.ac.uk/style/images/fileicons/application_pdf.png) |
|
This file may not be suitable for users of assistive technology.
Request an accessible format
|
|
| 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 |
|---|---|
| DOI/Identification number: | 10.1016/j.entcs.2008.02.014 |
| 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: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing |
| Depositing User: | Eerke Boiten |
| Date Deposited: | 29 Mar 2010 12:09 UTC |
| Last Modified: | 16 Nov 2021 10:02 UTC |
| Resource URI: | https://kar.kent.ac.uk/id/eprint/23963 (The current URI for this page, for reference purposes) |
| Boiten, Eerke Albert: |
 https://orcid.org/0000-0002-9184-8968
|
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):
Altmetric
Altmetric
