Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
In this article we offer guidelines for the determination of key sizes for symmetric cryptosystems, RSA, and discrete logarithm-based cryptosystems both over finite fields and over groups of elliptic curves over prime fields. Our recommendations are based ...
This article is concerned with protecting service control against interruption attacks. It investigates threats to service control in the Telecommunications Information Networking Architecture. Traditional security services protect message flows, but not s ...
In this paper, we address the problem of service availability in mobile ad-hoc WANs. We present a secure mechanism to stimulate end users to keep their devices turned on, to refrain from overloading the network, and to thwart tampering aimed at converting ...
DES and triple-DES are two well-known and popular encryption algorithms, but they both have the same drawback : their block size is limited to 64 bits. While the cryptographic community is working hard to select and evaluate candidates and finalists for th ...
Contrary to the common belief that mobility makes security more difficult to achieve, we show that node mobility can, in fact, be useful to provide security in ad hoc networks. We propose a technique in which security associations between nodes are establi ...
The spi calculus is an extension of the pi calculus with cryptographic primitives, designed for the verification of cryptographic protocols. Due to the extension, the naive adaptation of labeled bisimulations for the pi calculus is too strong to be useful ...
In this paper, we address the problem of service availability in mobile ad-hoc WANs. We present a secure mechanism to stimulate end users to keep their devices turned on, to refrain from overloading the network, and to thwart tampering aimed at converting ...
The Telecommunications Information Networking Architecture (TINA) provides the architectural basis for the realization of telecommunications services as distributed applications. In particular application of distributed systems, new security problems arise ...
This document describes an implementation of secure communication for distributed applications in Ada 95. It explains the basics of cryptography and introduces the problem of key exchange. After a brief description of distributed systems in Ada 95, the mod ...
An essential function for achieving security in computer networks is reliable authentication of communicating parties and network components. Such authentication typically relies on exchanges of cryptographic messages between the involved parties, which in ...
