Evaluation of Anonymized ONS Queries

Electronic Product Code (EPC) is the basis of a pervasive infrastructure for the automatic identification of objects on supply chain applications (e.g., pharmaceutical or military applications). This infrastructure relies on the use of the (1) Radio Frequency Identification (RFID) technology to tag objects in motion and (2) distributed services providing information about objects via the Internet. A lookup service, called the Object Name Service (ONS) and based on the use of the Domain Name System (DNS), can be publicly accessed by EPC applications looking for information associated with tagged objects. Privacy issues may affect corporate infrastructures based on EPC technologies if their lookup service is not properly protected. A possible solution to mitigate these issues is the use of online anonymity. We present an evaluation experiment that compares the of use of Tor (The second generation Onion Router) on a global ONS/DNS setup, with respect to benefits, limitations, and latency.Comment: 14 page

Revisiting the Performance of the Modular Clock Algorithm for Distributed Blind Rendezvous in Cognitive Radio Networks

Abstract. We reexamine the modular clock algorithm for distributed blind rendezvous in cognitive radio networks. It proceeds in rounds. Each round consists of scanning twice a block of generated channels. The modular clock algorithm inspired the creation of the jump-stay ren-dezvous algorithm. It augments the modular clock with a stay-on-one-channel pattern. This enhancement guarantees rendezvous in one round. We make the observation that as the number of channels increases, the significance of the stay-on-one-channel pattern decreases. We revisit the performance analysis of the two-user symmetric case of the modular clock algorithm. We compare its performance with a random and the jump-stay rendezvous algorithms. Let m be the number of channels. Let p be the smallest prime number greater than m. The expected time-to-rendezvous of the random and jump-stay algorithms are m and p, respectively. Theis et al.’s analysis of the modular clock algorithm con-cludes a maximum expected time-to-rendezvous slightly larger than 2p time slots. Our analysis shows that the expected time-to-rendezvous of the modular clock algorithm is no more than 3p/4 time slots.

Analysis of threats to the security of EPC networks

Detectingand respondingto security and privacythreats to ElectronicProductCode(EPC)andRadioFrequencyIDen- tification (RFID) technologies are becoming major con- cerns of information security researchers. However, and before going further in these activities,an evaluationof the threats in terms of importance must be done. We present such an evaluation. Our analysis of the threats is based on a methodology proposed by the European Telecommunica- tions Standards Institute (ETSI). According to this method- ology, we rank the threats to EPCnetworksin order of rele- vance. Thisassesmentisintendedtoprioritizethreatsforfu- ture research on appropriate countermeasure mechanisms

Analysis of threats to the security of EPC networks

Detectingand respondingto security and privacythreats to ElectronicProductCode(EPC)andRadioFrequencyIDen- tification (RFID) technologies are becoming major con- cerns of information security researchers. However, and before going further in these activities,an evaluationof the threats in terms of importance must be done. We present such an evaluation. Our analysis of the threats is based on a methodology proposed by the European Telecommunica- tions Standards Institute (ETSI). According to this method- ology, we rank the threats to EPCnetworksin order of rele- vance. Thisassesmentisintendedtoprioritizethreatsforfu- ture research on appropriate countermeasure mechanisms