Concept

Computer security

Related publications (318)

Graph Chatbot

Chat with Graph Search

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.

JAGR: an autonomous self-recovering application server

George Candea

This paper demonstrates that the dependability of generic, evolving J2EE applications can be enhanced through a combination of a few recovery-oriented techniques. Our goal is to reduce downtime by automatically and efficiently recovering from a broad class ...

2003

Beyond "Web of Trust": Enabling P2P E-commerce

Karl Aberer, Manfred Hauswirth, Anwitaman Datta

The huge success of eBay has proven the demand for customer-to-customer (C2C) electronic commerce. eBay is a centralized infrastructure with all its scalability problems (network bandwidth, server load, availability, etc.). In this paper we argue that C2C ...

2003

An authentication scheme based on roots of sparse polynomials

Mohammad Amin Shokrollahi

We describe an authentication scheme whose security is based on the hardness of finding roots of systems of sparse polynomial equations in many variables and of high degree. One of the new ideas is the use of many keys. In one authentication session, a sma ...

2003

Cooperation in Multi-hop Cellular Networks

Jean-Pierre Hubaux, Naouel Ben Salem, Levente Buttyan

Naouel Ben Salem, Levente Buttyan, Jean-Pierre Hubaux and Markus Jakobsson abstract: In multi-hop cellular networks, the existence of a communication link between the mobile station and the base station is not required: a mobile station that has no direct ...

2003

BISS: Building Secure Routing out of an Incomplete Set of Security Associations

Jean-Pierre Hubaux, Srdan Capkun

We investigate secure routing in ad hoc networks in which security associations exist only between a subset of all pairs of nodes. We focus on source routing protocols. We show that to establish secure routes, it is in general not necessary that security a ...

2003

The Security of DSA and ECDSA

Serge Vaudenay

DSA and ECDSA are well established standards for digital signature based on the discrete logarithm problem. In this paper we survey known properties, certification issues regarding the public parameters, and security proofs. ECDSA also includes a standard ...

2003

Secure JPEG 2000 - JPSEC

Touradj Ebrahimi, Raphaël Grosbois

The Joint Photographic Experts Group (JPEG) has recently rolled out a new still image coding standard called JPEG 2000. This standard integrates an efficient image compression scheme with functionalities required by multimedia applications, such as progres ...

2003

Securing JPEG 2000 compressed images

Touradj Ebrahimi, Frédéric Dufaux

The Joint Photographic Experts Group (JPEG) has recently rolled out a new still image coding standard called JPEG 2000. This standard integrates an efficient image compression scheme along with functionalities required by multimedia applications, such as p ...

2003

Small Worlds in Security Systems: an Analysis of the PGP Certificate Graph

Jean-Pierre Hubaux, Levente Buttyan, Srdan Capkun

We propose a new approach to securing computer networks. With this approach, we achieve security in a fully self-organized manner; by this we mean that to secure a computer network, a security system does not require any kind of certification authority or ...

2002

Small Worlds in Security Systems: an Analysis of the PGP Certificate Graph

Jean-Pierre Hubaux, Levente Buttyan, Srdan Capkun

We propose a new approach to securing self-organized mobile ad hoc networks. In this approach, security is achieved in a fully self-organized manner ...

2002