Concept

Next-generation secure computing base

Publications associées (9)

System Software Design for Undiluted Attestation

In trusted execution environments, the authenticity and security properties of a computer system are determined by examining its attestation. Reviewing the attestation should be sufficient to evaluate the system's correctness; however, this is not the case today. Proprietary system software cannot be audited for security, while existing isolation abstractions fail to capture important nuances, such as the existence of transient-execution attacks. In this thesis, we demonstrate that, through software-only c

EPFL2026

Plastic activity in nanoscratch molecular dynamics simulations of pure aluminum

Atomistic models for friction suffer from the severe length- and time-scale restrictions of molecular dynamics. Even when they yield good qualitative results, it is difficult to draw meaningful quantitative conclusions from them. In this presentation, a novel approach to quantify the scratching work and the energy associated with plastic activity is used. The approach is combined with a statistical criterion to determine the significance of simulation box size, microstructure and sliding rate effects on the

2012

Computing in Social Networks

Rachid Guerraoui

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 scalable and secure way. Scalability means that the message and computational complexity of the distributed computation is at most O(root n . polylog n). Security encompasses (1) accuracy and (2) privacy: accuracy holds when the distance from the output to th

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

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 all) to achieve when devices are maliciously used. We take the example of deniability, receipt-freeness, and anonymity. We formalize the trusted agent model which assumes tamper-proof hardware in a way which captures the notion of programmable secure hardwar

2009

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

Daniel Thalmann, Nadia Magnenat-Thalmann

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. Augmented 3D virtual character in front of a user guides him/her to destination so that he/she can just follow the virtual guide after the user gives a voice command with desired destination to it. The most suitable virtual character is selected dependin

2007

Universal multimedia access from wired and wireless systems

Touradj Ebrahimi, Yousri Abdeljaoued

Personal computing and communication devices such as computers, personal digital assistants (PDAs), and mobile phones are moving to their next generation in which the end user will be able to access a multitude of information with a single device either locally or through a network. One likely trend in future personal computing and personal communication is that there will not be a single but several equivalent devices available to users allowing access to information in various forms. Each user, depending

2001

Enforcing Service Availability in Mobile Ad-Hoc WANs

Jean-Pierre Hubaux, Levente Buttyan

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 device into a selfish one. Our solution is based on the application of a tamper resistant security module in each device and cryptographic protection of messages.

2000

Enforcing Service Availability in Mobile Ad-Hoc WANs

Jean-Pierre Hubaux, Levente Buttyan

2000

VPARK - A Windows NT software platform for a virtual networked amusement park

Daniel Thalmann, Nadia Magnenat-Thalmann

Presents the VPARK (Virtual Park) system, which includes a networked virtual environment (NVE) system called W-VLNET and an “attraction building system” that is able to create and modify the attractions used in the NVE. Both systems have been developed in the Windows NT environment. The paper outlines the techniques for communication, scene management, facial and body animation, and general user interaction modules. The use of VRML97 and MPEG-4 SHNC is overviewed for the purpose of outlining the compatabili

2000

Graph Chat

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Publications associées (9)