Computational Security Sample Clauses

Computational Security. This chapter introduces basic concepts needed for our studies of compu- tationally secure key agreement. It also contains an example of a simple black-box reduction. Section 5.1 explains the computational models we use in this part of the thesis. In particular, we define circuits, oracle circuits, and oracle algo- rithms. We also give two basic theorems about these concepts we need later (we count the number of predicates which can be computed by cir- cuits of fixed size and we show that circuits can simulate Turing ma- chines). Section 5.2 contains an example of a computational security proof. We use this example to explain the basic concept of a black-box security proof and illustrate the difference between uniform and non-uniform security.