Searching for a solution: Engineering tradeoffs and the evolution of provably secure protocols

J A Clark; J L Jacob

Searching for a solution: Engineering tradeoffs and the evolution of provably secure protocols

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

Tradeoffs are an important part of engineering security. Protocol security is important. So are efficiency and cost. This paper provides an early framework for handling such aspects in a uniform way based on combinatorial optimisation techniques. BAN logic is viewed as both a specification and proof system and as a 'protocol programming language' The paper shows how evolutionary search in the form of genetic algorithms can be utilised to 'grow' correct and efficient BAN protocols and shows hour goals and assumptions can co-evolve, effectively engaging in 'specification synthesis'.

Original language	English
Title of host publication	2000 IEEE SYMPOSIUM ON SECURITY AND PRIVACY, PROCEEDINGS
Place of Publication	LOS ALAMITOS
Publisher	IEEE Computer Society
Pages	82-95
Number of pages	14
ISBN (Print)	0-7695-0665-8
Publication status	Published - 2000
Event	2000 IEEE Symposium on Security and Privacy (S - BERKELEY Duration: 14 May 2000 → 17 May 2000

Conference

Conference	2000 IEEE Symposium on Security and Privacy (S
City	BERKELEY
Period	14/05/00 → 17/05/00

Access to Document

http://computer.org/proceedings/s6p/0665/06650082abs.htm

Cite this

@inproceedings{588fd0dd75604b4c928fe0d0f3433921,

title = "Searching for a solution: Engineering tradeoffs and the evolution of provably secure protocols",

abstract = "Tradeoffs are an important part of engineering security. Protocol security is important. So are efficiency and cost. This paper provides an early framework for handling such aspects in a uniform way based on combinatorial optimisation techniques. BAN logic is viewed as both a specification and proof system and as a 'protocol programming language' The paper shows how evolutionary search in the form of genetic algorithms can be utilised to 'grow' correct and efficient BAN protocols and shows hour goals and assumptions can co-evolve, effectively engaging in 'specification synthesis'.",

author = "Clark, {J A} and Jacob, {J L}",

year = "2000",

language = "English",

isbn = "0-7695-0665-8",

pages = "82--95",

booktitle = "2000 IEEE SYMPOSIUM ON SECURITY AND PRIVACY, PROCEEDINGS",

publisher = "IEEE Computer Society",

address = "United States",

note = "2000 IEEE Symposium on Security and Privacy (S ; Conference date: 14-05-2000 Through 17-05-2000",

}

TY - GEN

T1 - Searching for a solution

T2 - 2000 IEEE Symposium on Security and Privacy (S

AU - Clark, J A

AU - Jacob, J L

PY - 2000

Y1 - 2000

N2 - Tradeoffs are an important part of engineering security. Protocol security is important. So are efficiency and cost. This paper provides an early framework for handling such aspects in a uniform way based on combinatorial optimisation techniques. BAN logic is viewed as both a specification and proof system and as a 'protocol programming language' The paper shows how evolutionary search in the form of genetic algorithms can be utilised to 'grow' correct and efficient BAN protocols and shows hour goals and assumptions can co-evolve, effectively engaging in 'specification synthesis'.

AB - Tradeoffs are an important part of engineering security. Protocol security is important. So are efficiency and cost. This paper provides an early framework for handling such aspects in a uniform way based on combinatorial optimisation techniques. BAN logic is viewed as both a specification and proof system and as a 'protocol programming language' The paper shows how evolutionary search in the form of genetic algorithms can be utilised to 'grow' correct and efficient BAN protocols and shows hour goals and assumptions can co-evolve, effectively engaging in 'specification synthesis'.

M3 - Conference contribution

SN - 0-7695-0665-8

SP - 82

EP - 95

BT - 2000 IEEE SYMPOSIUM ON SECURITY AND PRIVACY, PROCEEDINGS

PB - IEEE Computer Society

CY - LOS ALAMITOS

Y2 - 14 May 2000 through 17 May 2000

ER -