Concept

Trusted Computing

Related publications (38)

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.

Computing in Social Networks

Rachid Guerraoui, Anne-Marie Kermarrec, Kévin Clément Huguenin, Andrei Giurgiu

This paper defines the problem of Scalable Secure Computing in a Social network: we call it the S-3 problem. In short, nodes, directly reflecting on associated users, need to compute a function f : V -> U of their inputs in a set of constant size, in a sca ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010

Fuzzy Trust Aggregation And Personalized Trust Inference In Virtual Social Networks

Mohsen Lesani

Virtual marketplaces on the Web provide people with great facilities to buy and sell goods similar to conventional markets. In traditional business, reputation is subjectively built for known persons and companies as the deals are made in the course of tim ...

2009

On Tamper-Resistance from a Theoretical Viewpoint: The Power of Seals

Serge Vaudenay

Tamper-proof devices are pretty powerful. They can be used to have better security in applications. In this work we observe that they can also be maliciously used in order to defeat some common privacy protection mechanisms. We propose the theoretical mode ...

Springer2009

On Privacy Losses in the Trusted Agent Model (Abstract)

Serge Vaudenay

Tamper-proof devices are pretty powerful. They typically make security applications simpler (provided that the tamper-proof assumption is not violated). For application requiring privacy, we observe that some properties may become harder (if possible at al ...

2009

Method of manufacturing a module of photoelectrochemical cells with long-term stability

Described is a method of manufacturing a module with long-term stability even though it contains a non-heat-resistant material, in particular a photosensitizer. Two glass plates (1, 2) are connected to each other round their edges with an edge-sealing stru ...

2007

Chloe@University: An indoor, HMD-based mobile mixed reality guide

Daniel Thalmann, Xavier Righetti, Achille Peternier, Mathieu Hopmann

This paper describes an indoors, mobile mixed reality guide system: Chloe@University. With a see-through head-mounted display (HMD) connected to a hidden small computing device, Chloe@University provides users with an efficient way of guiding in a building ...

2007

Branch-and-Price Algorithms for Vehicle Routing Problems

Matteo Salani

In this thesis we consider some routing problems and exact algorithms to solve them based on the branch-and-price framework. We consider three variants of the Vehicle Routing Problem (VRP): the Capacitated Vehicle Routing Problem (CVRP): is the basic and m ...

Università degli studi di Milano2006

Toward a secure JPEG

Touradj Ebrahimi, Frédéric Dufaux

In this paper, we propose a Secure JPEG, an open and flexible standardized framework to secure JPEG images. Its goal is to allow the efficient integration and use of security tools enabling a variety of security services such as confidentiality, integrity ...

2006

Reducing Fair Exchange to Atomic Commit

Rachid Guerraoui, Serge Vaudenay, Marko Vukolic, Gildas Avoine, Felix Gaertner

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 c ...

2005

Gracefully Degrading Fair Exchange with Security Modules

Rachid Guerraoui, Marko Vukolic, Gildas Avoine

The fair exchange problem is key to trading electronic items in systems of mutually untrusted parties. In modern variants of such systems, each party is equipped with a security module. The security modules trust each other but can only communicate by exch ...

2005