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.
This paper outlines an original Computational Grid deployment protocol which is entirely based on Java, leveraging the portability of this language for distributing customized computations throughout large-scale heterogeneous networks. It describes practic ...
The rapid growth of WiFi over the past two years reveals the willingness of the Wireless Internet Service Providers (WISPs) to develop this technology and the interest of the users in this new service. However, the lack of unified roaming slows down the de ...
This invention discloses new methods, security devices and apparatuses for authenticating documents and valuable articles which may be applied to any support, including transparent synthetic materials and traditional opaque materials such as paper. The inv ...
In 2002, Murphy and Robshaw introduced an extension BES of AES and argued this could compromise the security of AES. We introduce here two block-ciphers CES and big-BES that are some extensions of the AES and BES respectively in the spirit of Hensel liftin ...
The node assembly has a central unit (7) with surface portions rounded at a center of merged curve. Each unit (6) e.g. bar has an end inserted to the central unit by a compression on a point of each unit to form a ball and socket joint. A security device i ...
To be efficient, data protection algorithms should generally exploit the properties of the media information in the transform domain. In this paper, we will advocate the use of non-linear image approximations using highly redundant dictionaries, for securi ...
We present a new undeniable signature scheme which is based on the computation of characters. Our signature scheme offers the advantage of having an arbitrarily short signature. Its asymptotic complexity is attractive: the asymptotic complexity of all algo ...
The fair exchange problem is key to trading electronic items in systems of mutually untrusted parties.We consider modern variants of such systems where each party is equipped with a tamper proof security module. The security modules trust each other but ca ...
Books, videos, music, still images and any other type of media information, share a number of features that enable their migration from traditional delivery technologies to an all-electronic delivery model. They can easily be digitized, stored, compressed ...
We introduce a new computational problem related to the interpolation of group homomorphisms which generalizes many famous cryptographic problems including discrete logarithm, Diffie-Hellman, and RSA. As an application, we propose a generic undeniable sign ...
