Publication

Accountable Anonymous Access to Services in Mobile Communication Systems

Related publications (32)

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.

Security Issues in Next Generation Mobile Networks: LTE and Femtocells

Jean-Pierre Hubaux, Murtuza Jadliwala, Igor Bilogrevic

Cellular mobile networks are used by more than 4 billion users worldwide. One effective way to meet the increasing demand for data rates is to deploy femtocells, which are low-power base stations that connect to the mobile operator through the subscriber's ...

2010

End-to-end adaptation scheme for ubiquitous remote experimentation

Denis Gillet, Christophe Salzmann, Philippe Müllhaupt

Remote experimentation is an effective e-learning paradigm for supporting hands-on education using laboratory equipment at distance. The current trend is to enable remote experimentation in mobile and ubiquitous learning. In such a context, the remote expe ...

2009

Consensus and collision detectors in radio networks

Seth Gilbert

We consider the fault-tolerant consensus problem in radio networks with crash-prone nodes. Specifically, we develop lower bounds and matching upper bounds for this problem in single-hop radios networks, where all nodes are located within broadcast range of ...

2008

Effect of intelligent antennas on radio system planning and on mitigation

Juliane Iten Chaves Simoes

Smart antennas have been recently applied to improve the capacity and the performance of second generation wireless mobile communication systems. In general, smart antennas reduce the effects of multipath fading and improve the signal-to-noise-plus-interfe ...

EPFL2008

An Enhanced Service Provider Communication Interface with Client Priorization

Milos Stanisavljevic, Slobodan Lukovic

With the increased dynamics of modern life, the efficiency and reliability of everyday services is emerging to be a fundamental concern. On the other hand, modern telecommunication technologies, like wireless Internet access, are penetrating all segments o ...

IEEE/WFM2008

Features extraction for low-power face verification

Patrick Stadelmann

Mobile communication devices now available on the market, such as so-called smartphones, are far more advanced than the first cellular phones that became very popular one decade ago. In addition to their historical purpose, namely enabling wireless vocal c ...

University of Neuchâtel2008

Chain-Based Anonymous Routing for Wireless Ad Hoc Networks

Reza Shokri

Wireless ad hoc networks are so vulnerable to passive attacks and eavesdropping adversaries due to their shared medium which makes network traffic easy to capture and analyze. Therefore, security and privacy protections are of extreme importance for protoc ...

IEEE2007

Life cycle assessment of mobile telephone networks, with focus on the end-of-life phase

Wolfram Scharnhorst

Mobile communication, in particular mobile telephony, is a service whose nonexistence nowadays is unimaginable. The ongoing, ever increasing penetration of mobile communication equipment, presently intensified by the transition from second generation1 to t ...

EPFL2006

What Can Be Implemented Anonymously?

Rachid Guerraoui, Eric Ruppert

Abstract. The vast majority of papers on distributed computing assume that processes are assigned unique identifiers before computation begins. But is this assumption necessary? What if processes do not have unique identifiers or do not wish to divulge the ...

2005

What Can Be Implemented Anonymously?

Rachid Guerraoui, Eric Ruppert

The vast majority of papers on distributed computing assume that processes are assigned unique identifiers before computation begins. But is this assumption necessary? What if processes do not have unique identifiers or do not wish to divulge them for reas ...

2004