Ed Younis 1. Give an example of a computation or algorithm that, if ran inside the enclave, the controlled-channel attack could not extract any meaningful pattern that leaks about sensitive data. Code without input-dependent execution will not be invaded by this attack. A very simple example is a function which returns the input multiplied by a hardcoded fixed value. There are no data accesses dependent on the input and there are no control transfers dependent on the input. Additionally, the pages accessed are always the exact same. No information can be gained by examining page faults.