Boiten, Eerke Albert (2010) Security specification: completeness, feasibility, refinement. In: Extended Abstracts Collection -- Refinement Based Methods for the Construction of Dependable Systems, Dagstuhl, Germany. (KAR id:30692)
PDF
Pre-print
Language: English |
|
Download this file (PDF/112kB) |
Preview |
Request a format suitable for use with assistive technology e.g. a screenreader | |
Official URL: http://drops.dagstuhl.de/opus/volltexte/2010/2374/ |
Abstract
The formal methods and refinement community should be able to contribute to the specification and verification of security protocols. This talk describes a few of the essential differences, or problems. First, security properties go beyond functional correctness, and are fundamentally different for different applications. Moreover, tomorrow's attacks may not be anticipated by yesterday's security properties. Second, notions of security may not be absolute: it may be good enough if guessing our secret is merely hard rather than impossible - and in some cases that may be provably the best we can get. Where does that leave us in wanting to provide security protocols ''correct by construction''?
Item Type: | Conference or workshop item (Paper) |
---|---|
Additional information: | http://drops.dagstuhl.de/opus/volltexte/2010/2374 |
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: | 21 Sep 2012 09:49 UTC |
Last Modified: | 16 Nov 2021 10:08 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/30692 (The current URI for this page, for reference purposes) |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):