Assumptions: The Trojan Horses of Secure Protocols
Secure protocols rely on a number of assumptions about the environment which, once made, free the designer from thinking about the complexity of what surrounds the execution context.
Henceforth, the designer forgets about the environment and moves on proving her algorithm correct, given the assumptions. When assumptions do not represent with sufficient accuracy the environment they are supposed to depict, they may become the door to successful attacks on an otherwise mathematically correct algorithm. Moreover, this can happen as unwitting to systems as a Trojan Horse’s action.
We wish to discuss the theoretical underpinnings of those problems and evaluate some recent research results that demonstrate a few of those limitations in actual secure protocols.
KeywordsSecret Sharing Secure Protocol Trojan Horse Successful Attack Execution Context
Unable to display preview. Download preview PDF.
- 2.Meyer, F., Pradhan, D.: Consensus with dual failure modes. In: Proceedings of the 17th IEEE International Symposium on Fault-Tolerant Computing, pp. 214–222. IEEE Computer Society Press, Los Alamitos (1987)Google Scholar
- 4.Christian, F., Fetzer, C.: The timed asynchronous system model. In: Proceedings of the 28th IEEE International Symposium on Fault-Tolerant Computing, pp. 140–149. IEEE Computer Society Press, Los Alamitos (1998)Google Scholar
- 6.Sousa, P., Neves, N.F., Verissimo, P.: How resilient are distributed f fault/intrusion-tolerant systems? In: Proceedings of the Int. Conference on Dependable Systems and Networks, pp. 98–107 (2005)Google Scholar
- 8.Sousa, P., Neves, N.F., Verissimo, P.: Hidden problems of asynchronous proactive recovery. In: Third Workshop on Hot Topics in System Dependability (Hot Dep’07) (2007)Google Scholar
- 9.Verissimo, P., Casimiro, A.: The Timely Computing Base model and architecture. Transactions on Computers — Special Issue on Asynchronous Real-Time Systems 51(8) (August 2002) A preliminary version of this document appeared as Technical Report DI/FCUL TR 99-2, Department of Computer Science, University of Lisboa (April 1999)Google Scholar
- 10.Verissimo, P.: Travelling through wormholes: a new look at distributed systems models. SIGACTN: SIGACT News (ACM Special Interest Group on Automata and Computability Theory) 37(1) (Whole Number 138) (2006)Google Scholar