Skip to main content

Reduction and refinement

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]
This file may not be suitable for users of assistive technology.
Request an accessible format
Official URL:


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: (The current URI for this page, for reference purposes)
Boiten, Eerke Albert:
  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.