Concept

Secure copy protocol

Related publications (54)

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.

Brief Note on Secured P-Grid (Version-1)

This document talks briefly about making the current P- Grid implementation secure. We realize the following two requirements which we feel are essential for making communication on P-Grid the most secure one. ...

2007

Hash-and-Sign with Weak Hashing Made Secure

Serge Vaudenay, Sylvain Pasini

Digital signatures are often proven to be secure in the random oracle model while hash functions deviate more and more from this idealization. Liskov proposed to model a weak hash function by a random oracle together with another oracle allowing to break s ...

Springer2007

Efficient and Robust Secure Aggregation for Sensor Networks

Karl Aberer, Jean-Pierre Hubaux, Panagiotis Papadimitratos, Marcin Poturalski, Parisa Haghani

Wireless Sensor Networks (WSNs) rely on in-network aggregation for efficiency, however, this comes at a price: A single adversary can severely influence the outcome by contributing an arbitrary partial aggregate value. Secure in-network aggregation can det ...

2007

How to specify and how to prove correctness of secure routing protocols for MANET

Jean-Pierre Hubaux, Panagiotis Papadimitratos

Secure routing protocols for mobile ad hoc networks have been developed recently, yet, it has been unclear what are the properties they achieve, as a formal analysis of these protocols is mostly lacking. In this paper we are concerned with this problem, ho ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2006

How to Specify and How to Prove Correctness of Secure Routing Protocols for MANET

Jean-Pierre Hubaux, Panagiotis Papadimitratos

2006

How to specify and how to prove correctness of secure routing protocols for MANET

Jean-Pierre Hubaux, Panagiotis Papadimitratos

Secure routing protocols for mobile ad hoc networks have been developed recently yet, it has been unclear what are the properties they achieve, as a formal analysis of these protocols is mostly lacking. In this paper we are concerned with this problem, how ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2006

Mobility Helps Peer-to-Peer Security

Jean-Pierre Hubaux, Levente Buttyan, Srdan Capkun

We propose a straightforward technique to provide peer-to-peer security in mobile networks. We show that far from being a hurdle, mobility can be exploited to set up security associations among users. We leverage on the temporary vicinity of users, during ...

2006

Secure Data Communication in Mobile Ad Hoc Networks

Panagiotis Papadimitratos

We address the problem of secure and fault-tolerant communication in the presence of adversaries across a multihop wireless network with frequently changing topology. To effectively cope with arbitrary malicious disruption of data transmissions, we propose ...

2006

Secure Ad Hoc Networking

Panagiotis Papadimitratos

The ad hoc networking technology can enable novel civilian and military applications. However, ad hoc networking protocols are vulnerable to a wide range of attacks. The design of defense mechanisms is a challenging problem, especially in comparison to sec ...

2006

On Selfish Behavior in CSMA/CA Networks

Jean-Pierre Hubaux, Imad Aad, Mario Cagalj

CSMA/CA protocols rely on the random deferment of packet transmissions. Like most other protocols, CSMA/CA was designed with the assumption that the nodes would play by the rules. This can be dangerous, since the nodes themselves control their random defer ...

2005