Publications associées à Toward Quantifying System Manageability

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.

Circular Security Reconsidered

Serge Vaudenay, Fatma Betül Durak

The notion of circular security of pseudorandom functions (PRF) was introduced in Distance Bounding Protocols. So far, only a construction based on a random oracle model was proposed. Circular security stands between two new notions which we call Key Depen ...

Springer International Publishing2016

Validation of an Automatic Metric for the Accuracy of Pronoun Translation (APT)

Andrei Popescu-Belis, Lesly Sadiht Miculicich Werlen

In this paper, we define and assess a reference-based metric to evaluate the accuracy of pronoun translation (APT). The metric automatically aligns a candidate and a reference translation using GIZA++ augmented with specific heuristics, and then counts the ...

Idiap2016

High System-Code Security with Low Overhead

George Candea, Johannes Kinder, Volodymyr Kuznetsov, Jonas Benedict Wagner

Security vulnerabilities plague modern systems because writing secure systems code is hard. Promising approaches can retrofit security automatically via runtime checks that implement the desired security policy; these checks guard critical operations, like ...

2015

Online Authenticated-Encryption and its Nonce-Reuse Misuse-Resistance

Damian Vizár, Reza Reyhanitabar

A definition of online authenticated-encryption (OAE), call it OAE1, was given by Fleischmann, Forler, and Lucks (2012). It has become a popular definitional target because, despite allowing encryption to be online, security is supposed to be maintained ev ...

Springer2015

Game Theory Meets Network Security and Privacy

Jean-Pierre Hubaux

This survey provides a structured and comprehensive overview of research on security and privacy in computer and communication networks that use game-theoretic approaches. We present a selected set of works to highlight the application of game theory in ad ...

Assoc Computing Machinery2013

Secure & Lightweight Distance-Bounding

Serge Vaudenay, Aikaterini Mitrokotsa

Distance-bounding is a practical solution to be used in security-sensitive contexts, mainly to prevent relay attacks. The main challenge when designing such protocols is maintaining their inexpensive cryptographic nature, whilst being able to protect again ...

2013

On the Performance of Secure Vehicular Communication Systems

Jean-Pierre Hubaux, Panagiotis Papadimitratos

Vehicular communication (VC) systems are being developed primarily to enhance transportation safety and efficiency. Vehicle-to-vehicle communication, in particular, frequent cooperative awareness messages or safety beacons, has been considered over the pas ...

2011

Interpreting Hash Function Security Proofs

Juraj Sarinay

We provide a concrete security treatment of several "provably secure" hash functions. Interpreting arguments behind MQ-HASH, FSB, SWIFFTX and VSH we identify similar lines of reasoning. We aim to formulate the main security claims in a language closer to t ...

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

Toward Quantifying System Manageability

Graph Chatbot

Chattez avec Graph Search

Circular Security Reconsidered

Validation of an Automatic Metric for the Accuracy of Pronoun Translation (APT)

High System-Code Security with Low Overhead

Online Authenticated-Encryption and its Nonce-Reuse Misuse-Resistance

Game Theory Meets Network Security and Privacy

Secure & Lightweight Distance-Bounding

Game Theory Meets Network Security and Privacy

On the Performance of Secure Vehicular Communication Systems

Interpreting Hash Function Security Proofs

Anonymous roaming in universal mobile telecommunication system mobile networks

Game Theory Meets Network Security and Privacy

High System-Code Security with Low Overhead

Validation of an Automatic Metric for the Accuracy of Pronoun Translation (APT)

Interpreting Hash Function Security Proofs

Circular Security Reconsidered

Game Theory Meets Network Security and Privacy

Online Authenticated-Encryption and its Nonce-Reuse Misuse-Resistance

Secure & Lightweight Distance-Bounding

On the Performance of Secure Vehicular Communication Systems

Anonymous roaming in universal mobile telecommunication system mobile networks