Publications related to Point-to-Point Protocol

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.

Dissent: Accountable Group Anonymity

Bryan Alexander Ford, Henry Nathaniel Corrigan-Gibbs

Users often wish to participate in online groups anonymously, but misbehaving users may abuse this anonymity to disrupt the group. Messaging protocols such as Mix-nets and DC-nets leave online groups vulnerable to denial-of-service and Sybil attacks, while ...

2010

Distributed Agreement with Optimal Communication Complexity

Seth Gilbert

We consider the problem of fault-tolerant agreement in a crash-prone synchronous system. We present a new randomized consensus algorithm that achieves optimal communication efficiency, using only O(n) bits of communication, and terminates in (almost optima ...

Siam, 3600 Univ City Science Center, Philadelphia, Pa 19104-2688 Usa2010

Production and titration of lentiviral vectors

Didier Trono, Isabelle Barde

Lentiviral vectors have emerged over the last decade as powerful, reliable, and safe tools for stable gene transfer in a wide variety of mammalian cells. Unlike other vectors derived from oncoretroviruses, they allow for stable gene delivery into most nond ...

John Wiley & Sons2010

Smashing SQUASH-0

Serge Vaudenay, Khaled Ouafi

At the RFID Security Workshop 2007, Adi Shamir presented a new challenge-response protocol well suited for RFIDs, although based on the Rabin public-key cryptosystem. This protocol, which we call SQUASH-0, was using a linear mixing function which was subse ...

Springer2009

Decentralized Polling with Respectable Participants

Rachid Guerraoui, Anne-Marie Kermarrec, Kévin Clément Huguenin, Maxime Monod

We consider the polling problem in a social network where participants care about their reputation: they do not want their vote to be disclosed nor their misbehaving, if any, to be publicly exposed. Assuming this reputation concern, we show that a simple s ...

2009

SenseCode: Network Coding for Reliable Sensor Networks

Christina Fragouli, Lorenzo Keller, Emre Atsan

Designing a communication protocol for sensor networks often involves obtaining the "right" trade-off between energy efficiency and reliability. In this paper, we show that network coding provides a means to elegantly balance these two goals. We present th ...

2009

Potentials of Opportunistic Routing in Energy-Constrained Wireless Sensor Networks

Martin Vetterli, François Ingelrest

The low quality of wireless links leads to perpetual packet losses. While an acknowledgment mechanism is generally used to cope with these losses, multiple retransmissions nevertheless occur. Opportunistic routing limits these retransmissions by taking adv ...

Springer Berlin / Heidelberg2009

Analysis and Optimization of Cryptographically Generated Addresses

Jean-Pierre Hubaux, Joppe Willem Bos, Onur Özen

The need for nodes to be able to generate their own address and verify those from others, without relying on a global trusted authority, is a well-known problem in networking. One popular technique for solving this problem is to use self-certifying address ...

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

Point-to-Point Protocol

Graph Chatbot

Chat with Graph Search

Dissent: Accountable Group Anonymity

Reid et al.'s distance bounding protocol and mafia fraud attacks over noisy channels

Distributed Agreement with Optimal Communication Complexity

Production and titration of lentiviral vectors

A New Message Recognition Protocol with Self-recoverability for Ad Hoc Pervasive Networks

Smashing SQUASH-0

Decentralized Polling with Respectable Participants

SenseCode: Network Coding for Reliable Sensor Networks

Potentials of Opportunistic Routing in Energy-Constrained Wireless Sensor Networks

Analysis and Optimization of Cryptographically Generated Addresses

Reid et al.'s distance bounding protocol and mafia fraud attacks over noisy channels

SenseCode: Network Coding for Reliable Sensor Networks

Dissent: Accountable Group Anonymity

Distributed Agreement with Optimal Communication Complexity

Production and titration of lentiviral vectors

Analysis and Optimization of Cryptographically Generated Addresses

A New Message Recognition Protocol with Self-recoverability for Ad Hoc Pervasive Networks

Potentials of Opportunistic Routing in Energy-Constrained Wireless Sensor Networks

Smashing SQUASH-0

Decentralized Polling with Respectable Participants