S. Raj Anand, Rama Chaithanya Tanguturi, D S Soundarrajan
The latest trend in the research filed implies the importance of data security in wireless sensor networks. There are various approaches identified for securing the data by using trust wide security such as cryptographic systems and routing protocols. However, these approaches are very critical to identify the optimal path in the network and attacks by unauthorized node cannot be prevented. In this paper, a new algorithm for combining the AODV (Ad Hoc On-Demand Distance Vector) routing protocol and particle swarm optimization (PSO) is implemented to produce trustable routing in every location through block chain. The possible routing procedure will enhance the routing nodes to acquire routing information among all the nodes but will never allow the node to capture the information. The routing protocol on the blockchain is used to utilize the path efficiently without deviation caused by other anchor nodes. It also identifies the congestion in the entire path of the particular network and avoids tampering of information between the nodes. The blockchain enabled with PSO algorithm and AODV routing protocol provides the simulation results about the efficient packet delivery system. The Security has been performed in every node used to identify the best route for producing the efficient throughput and quality of services.
Due to the mobility of nodes, lack of infrastructure and limited computing and storage resources in mobile ad hoc networks (MANETs), this scheme uses the self-certification public key, combined with the interactive zero-knowledge proof and KEA+ key exchange method in the GPS identity authentication protocol, uses four interactions to complete the two-way identity authentication and key exchange of both parties, and which security is analyzed subsequently. The scheme effectively reduces the leakage of the claimant's secret knowledge in the identity authentication process, and enhances the reliability of the identity authentication and key exchange process.
A trusted routing scheme is very important to ensure the routing security and efficiency of wireless sensor networks (WSNs). There are a lot of studies on improving the trustworthiness between routing nodes, using cryptographic systems, trust management, or centralized routing decisions, etc. However, most of the routing schemes are difficult to achieve in actual situations as it is difficult to dynamically identify the untrusted behaviors of routing nodes. Meanwhile, there is still no effective way to prevent malicious node attacks. In view of these problems, this paper proposes a trusted routing scheme using blockchain and reinforcement learning to improve the routing security and efficiency for WSNs. The feasible routing scheme is given for obtaining routing information of routing nodes on the blockchain, which makes the routing information traceable and impossible to tamper with. The reinforcement learning model is used to help routing nodes dynamically select more trusted and efficient routing links. From the experimental results, we can find that even in the routing environment with 50% malicious nodes, our routing scheme still has a good delay performance compared with other routing algorithms. The performance indicators such as energy consumption and throughput also show that our scheme is feasible and effective.
In this research paper, blockchain-based trust management model is proposed to enhance trust relationship among beacon nodes and to eradicate malicious nodes in Wireless Sensor Networks (WSNs). This composite trust evaluation involves behavioral-based trust as well as data-based trust. Various metrics such as closeness, honesty, intimacy and frequency of interaction are taken into account to compute behavioral-based trust of beacon nodes. Further, the composite (behavior and data) trust value of each beacon nodes is broadcast to Base Stations (BS) to generate a blockchain of trust values. Subsequently, the management model discards the beacon node with least trust value and that ensures reliability and consistency of localization in WSNs. The simulated results of the proposed algorithm are compared with the existing ones in terms of detection accuracy, False Positive Rate (FPR) and False Negative Rate (FNR) and Average Energy Consumption (AEC).
The rapid development of the Internet of Things (IoT) and the explosive growth of valuable data produced by user equipment have led to strong demand for access control, especially hierarchical access control, which is performed from a group communication perspective. However, the key management strategies for such a future Internet are based mostly on a trusted third party that requires full trust of the key generation center (KGC) or central authority (CA). Recent studies indicate that centralized cloud centers will be unlikely to deliver satisfactory services to customers because we place too much trust in third parties; therefore, these centers do not apply to user privacy-oriented scenarios. This paper addresses these issues by proposing a novel blockchain-based distributed key management architecture (BDKMA) with fog computing to reduce latency and multiblockchains operated in the cloud to achieve cross-domain access. The proposed scheme utilizes blockchain technology to satisfy the decentralization, fine-grained auditability, high scalability, and extensibility requirements, as well as the privacy-preserving principles for hierarchical access control in IoT. We designed system operations methods and introduced different authorization assignment modes and group access patterns to reinforce the extensibility. We evaluated the performance of our proposed architecture and compared it with existing models using various performance measures. The simulation results show that the multiblockchain structure substantially improves system performance, and the scalability is excellent as the network size increases. Furthermore, dynamic transaction collection time adjustment enables the performance and system capacity to be optimized for various environments.
The Internet of Things (IoT) has been widely used because of its high efficiency and real-time collaboration. A wireless sensor network is the core technology to support the operation of the IoT, and the security problem is becoming more and more serious. Aiming at the problem that the existing malicious node detection methods in wireless sensor networks cannot be guaranteed by fairness and traceability of detection process, we present a blockchain trust model (BTM) for malicious node detection in wireless sensor networks. First, it gives the whole framework of the trust model. Then, it constructs the blockchain data structure which is used to detect malicious nodes. Finally, it realizes the detection of malicious nodes in 3D space by using the blockchain smart contract and the WSNs' quadrilateral measurement localization method, and the voting consensus results are recorded in the blockchain distributed. The simulation results show that the model can effectively detect malicious nodes in WSNs, and it can also ensure the traceability of the detection process.
Space situation awareness (SSA) includes tracking of active and inactive resident space objects and assessing the space environment through sensor data collection and processing. To enhance SSA, the dynamic data-driven application systems framework couples online data with offline models to enhance performance by using feedback control, sensor management, and communications reliability. For information management, there is a need for identity authentication and access control (AC) to ensure the integrity of exchanged data as well as to grant authorized entities access right to data and services. Due to decentralization and heterogeneity of SSA systems, it is challenging to build an efficient centralized AC system, which can either be a performance bottleneck or the single point of failure. Inspired by the blockchain and smart contract technology, we introduce blockchain-enabled, decentralized, capability-based access control (BlendCAC), a decentralized authentication, and capability-based AC mechanism to enable effective protection for devices, services, and information in SSA networks. To achieve secure identity authentication, the BlendCAC leverages the blockchain to create virtual trust zones, in which distributed components can identify and update each other in a trustless network environment. A robust identity-based capability token management strategy is proposed, which takes advantage of the smart contract for registration, propagation, and revocation of the access authorization. A proof-of-concept prototype has been implemented on both resources-constrained devices (i.e., Raspberry Pi nodes emulating satellites with sensor observations) and more powerful computing devices (i.e., laptops emulating a ground network) and is tested on a private Ethereum blockchain network. The experimental results demonstrate the feasibility of the BlendCAC scheme to offer a decentralized, scalable, lightweight, and fine-grained AC solution for space system toward SSA.
In this paper, we propose IoTChain, a combination of the OSCAR architecture [1] and the ACE authorization framework [2] to provide an E2E solution for the secure authorized access to IoT resources. IoTChain consists of two components, an authorization blockchain based on the ACE framework and the OSCAR object security model, extended with a group key scheme. The blockchain provides a flexible and trustless way to handle authorization while OSCAR uses the public ledger to set up multicast groups for authorized clients. To evaluate the feasibility of our architecture, we have implemented the authorization blockchain on top of a private Ethereum network. We report on several experiments that assess the performance of different architecture components.
In this paper, we propose BAN-GZKP that optimizes the best to date secure lightweight and energy efficient authentication scheme, BANZKP, designed for WBAN networks. BANZKP is vulnerable to several security attacks such as the replay attack, DDoS attacks at sink and redundancy information crack. Also BANZKP needs an end-to-end authentication which is not compliant with the human body postural mobility. Our scheme, BAN-GZKP, improves both the security and postural mobility resilience of BANZKP. In order to fix the security vulnerabilities of BANZKP, BAN-GZKP uses a novel random key allocation. Moreover, BAN-GZKP uses a hop-by-hop authentication scheme which makes it tolerant to postural mobility. We further prove the reliability of our scheme to various attacks including those to which BANZKP is vulnerable. Furthermore, via extensive simulations we prove that our scheme, BAN-GZKP, outperforms BANZKP in terms of reliability to human body postural mobility for various network parameters (end-to-end delay, number of packets exchanged in the network, number of transmissions). We compared both schemes using representative convergecast strategies with various transmission rates and human postural mobility. When our BAN-GZKP scheme is used the percentage of packets received increases by 34.06%, the end-to-end-delay reduces by 36.02% and the number of transmissions reduces by 8.75% with respect to the case when BANZKP is used. Moreover, BAN-GZKP uses only a three-phase authentication which is optimal in the class of ZKP protocols. Finally, it is important to mention that BAN-GZKP has no additional cost in terms memory, computational complexity or energy consumption compared to BANZKP.
Nesrine Khernane, Maria Potop-Butucaru, Claude Chaudet
Advances in wearable and implementable of wireless sensors have enable the development of tiny and intelligent sensors called body sensors. Monitoring the vital body parameters in real-time using wireless body area network (WBAN) has shown great potential in improving healthcare quality not only for patients but also for medical staff. However, security and privacy are still an important issue in WBANs especially in multi-hop architectures. Considering the constraints of the body sensors (namely energy, memory, computational power, etc.). In this paper, we propose and present the design and the evaluation of a secure lightweight and energy efficient authentication scheme BANZKP based on an efficient cryptographic protocol, Zero Knowledge Proof (ZKP) and a commitment scheme. ZKP is used to confirm the identify of the sensor nodes, with small computational requirement, which is favorable for body sensors given their limited resources, while the commitment scheme is used to deal with replay attacks and hence the injection attacks by committing a message and revealing the key later. BANZKP reduces the memory requirement by 56,13% compared to TinyZKP [10], the comparable alternative so far for Body Area Networks. Also, the simulation results demonstrate that our proposed scheme is 17 and 5 times more efficient in term of execution time, and uses 94.11% and 80% less energy compared to TinyZKP and W-ECDSA [16], respectively.
Nesrine Khernane, Maria Potop-Butucaru, Claude Chaudet
-Wireless body area network(WBAN) has shown great potential in improving\nhealthcare quality not only for patients but also for medical staff. However,\nsecurity and privacy are still an important issue in WBANs especially in\nmulti-hop architectures. In this paper, we propose and present the design and\nthe evaluation of a secure lightweight and energy efficient authentication\nscheme BANZKP based on an efficient cryptographic protocol, Zero Knowledge\nProof (ZKP) and a commitment scheme. ZKP is used to confirm the identify of the\nsensor nodes, with small computational requirement, which is favorable for body\nsensors given their limited resources, while the commitment scheme is used to\ndeal with replay attacks and hence the injection attacks by committing a\nmessage and revealing the key later. Our scheme reduces the memory requirement\nby 56.13 % compared to TinyZKP [13], the comparable alternative so far for Body\nArea Networks, and uses 10 % less energy.\n
Francisco Martรญn-Fernรกndez, Pino CaballeroโGil, Cรกndido CaballeroโGil
This paper describes the design and analysis of a new scheme for the authenticated exchange of confidential information in insecure environments within the Internet of Things, which allows a receiver of a message to authenticate the sender and compute a secret key shared with it. The proposal is based on the concept of a non-interactive zero-knowledge proof, so that in a single communication, relevant data may be inferred to verify the legitimacy of the sender. Besides, the new scheme uses the idea under the Diffie-Hellman protocol for the establishment of a shared secret key. The proposal has been fully developed for platforms built on the Android Open Source Project, so it can be used in any device or sensor with this operating system. This work provides a performance study of the implementation and a comparison between its promising results and others obtained with similar schemes.
Abstract This paper considers security analysis of the YAK, a public keyโbased authenticated key agreement protocol. The YAK protocol is a variant of the twoโpass HMQV protocol but uses zeroโknowledge proofs for proving knowledge of ephemeral values. In this paper, we show that the YAK protocol lacks joint key control and perfect forward secrecy attributes and is vulnerable to some attacks including unknown keyโshare and keyโreplication attacks. This invalidates the semantic security of the protocol in several security models. There are also other considerations regarding the impersonation and small subgroup attacks. Copyright ยฉ 2015 John Wiley & Sons, Ltd.
๋ณธ ๋ ผ๋ฌธ์์๋ ๋ฏธ๋ฆฌ ์๋ ค์ง ์์์ ๋คํญ์๊ณผ ์ํธํ๋ ๋คํญ์์ ๊ณฑ์ ์ ์ํํ ํ, ํด๋น ๊ณฑ์ ์ด ์ ๋นํ๊ฒ ์ํ๋์์์ ๋ณด์ด๊ธฐ ์ํด ์ฆ๋ช ์ (Prover)์ ๊ฒ์ฆ์ (Verifier)๊ฐ์ ๋คํญ์ ์๋ฑ์ฑ ์์ง์์ฆ๋ช (Zero-knowledge Proof) ํ๋กํ ์ฝ์ ์ผ๋ฐํํ ์ ์๋ ๋ฐฉ๋ฒ์ ๋ค๋ฃฌ๋ค. ์ด๋ฅผ ์ํ์ฌ ๋คํญ์์ ์๋ฑ์ฑ์ ์ฆ๋ช ํ๋ ์ผ๋ฐํ๋ ํ๋กํ ์ฝ์ ์ ์ํ๊ณ ๋๋ค์ค๋ผํด (Random Oracle) ๋ชจ๋ธ์์ ์์ ์ฑ์ ์ฆ๋ช ํ๋ค. ์ด๋ฌํ ๊ธฐ๋ฒ์ ์์ ํ ์งํฉ์ฐ์ฐ ๊ธฐ๋ฒ์ ํฌํจํ์ฌ ๋คํญ์์ ๊ธฐ๋ฐํ ๋ค์๊ฐ ์ฐ์ฐ๊ธฐ๋ฒ (Secure Multi-party Computation)์ ์ ์ฉ๋ ์ ์๋ค. In this paper, we are interested in a generalization of zero-knowledge interactive protocols between prover and verifier, especially to show that the product of an encrypted polynomial and a random polynomial, but published by a secure commitment scheme was correctly computed by the prover. To this end, we provide a generalized protocol for proving that the resulting polynomial is correctly computed by an encrypted polynomial and another committed polynomial. Further we show that the protocol is also secure in the random oracle model. We expect that our generalized protocol can play a role of building blocks in implementing secure multi-party computation including private set operations.
Today's Internet is full of applications by which users share potentially private information with each other. Recently, the privacy concerns of users are rising and users gradually become more suspicious with respect to the use of their (personal) information. In this thesis, we aim at bringing secure multi-party computation closer to common Internet users. The main goal is to design and implement privacy-preserving reconciliation-based applications for multiple users which are secure against passive and active attackers. Additionally, our solutions should be efficient enough to be practical and usable enough even for non-technical users.As a main contribution in theory, we present different privacy-preserving multi-party reconciliation protocols based on an additively homomorphic cryptosystem that are secure against passive attackers (semi-honest model). We also propose reconciliation protocols that are secure against active attackers (malicious model) by applying zero-knowledge proof techniques. The stronger security model comes at the price of efficiency. As a prerequisite, we develop several novel cryptographic tools in the areas of privacy-preserving set operations and zero-knowledge proofs of knowledge. We also analyze to what extent fully homomorphic cryptosystems can be used for multi-party privacy-preserving reconciliation protocols. As a main contribution in practice, we introduce SMC-MuSe, a framework for Secure Multi-Party Computation on MultiSets. SMC-MuSe is a carefully designed framework for secure multi-party computation including an implementation of different cryptographic components, a support infrastructure, multi-party privacy-preserving reconciliation protocols, and two user-friendly applications for the desktop and mobile environment. We also evaluate the efficiency of the SMC-MuSe framework. In particular, we measure the computation and communication overhead of all implemented components within the SMC-MuSe framework. As a third line of work, we propose different application scenarios in the areas of event scheduling, e-voting, and electronic auctions for reconciliation protocols. We examine the practicability of one particular user-friendly application of SMC-MuSe by conducting a user study on our Android application Prefer. The user study shows that Prefer is a useful and very interesting application for today's smartphone users. Finally, we show the potential of reconciliation protocols for common Internet users by conducting a user study on privacy-preserving reconciliation in the Internet. The user study shows that our reconciliation protocols are useful in different application scenarios for common Internet users.
A Mobile Ad-hoc Network (MANET) is a group of wireless mobile nodes that dynamically form a network without any pre-established infrastructure or centralized administration, Soewito (2014). Some network hops may be needed to send a packet from one node to another node in the MANET. To do the communication between the nodes, a route has to be selected in the network, therefore it need a routing protocol that manage selection of the route. Selection route in mobile ad-hoc network is not easy because nodes always move so that the topology of network always changed every time. This is a big issue in selection route in mobile ad-hoc network because the route can be broken anytime. Moreover, MANET is more vulnerable than other wireless communication types because every mobile node serves as both the host and the router and forwards packets on behalf of each other. This study presents the analyzing and evaluation several routing algorithms and a novel scheme to build an authentication system by adding the modified zero knowledge proof algorithm to each mobile node in MANET.
Abstract. In this work, we first formalize the notion of dynamic group signatures with distributed traceability, where the capability to trace signatures is distributed among nmanagers without requiring any interaction. This ensures that only the participation of all tracing managers permits tracing a signature, which reduces the trust placed in a single tracing manager. The threshold variant follows easily from our definitions and constructions. Our model offers strong security requirements. Our second contribution is a generic construction for the notion which has a concurrent join protocol, meets strong security requirements, and offers efficient traceability, i.e. without requiring tracing managers to produce expensive zero-knowledge proofs for tracing correctness. To dispense with the expensive zero-knowledge proofs required in the tracing, we deploy a distributed tag-based encryption with public verifiability. Finally, we provide some concrete instantiations, which, to the best of our knowledge, are the first efficient provably secure realizations in the standard model simultaneously offering all the aforementioned properties. To realize our constructions efficiently, we construct an efficient distributed (and threshold) tag-based encryption scheme that works in the efficient Type-III asymmetric bilinear groups. Our distributed tag-based encryption scheme yields short ciphertexts (only 1280 bits at 128-bit security), and is secure under an existing variant of the standard decisional linear assumption. Our tag-based encryption scheme is of independent interest and is useful for many applications beyond the scope of this paper. As a special case of our distributed tag-based encryption scheme, we get an efficient tag-based encryption scheme in Type-III asymmetric bilinear groups that is secure in the standard model.
Abstract. We construct a 3-move public coin special honest verifier zero-knowledge proof, a so-called Sigma-protocol, for a list of commitments having at least one commit-ment that opens to 0. It is not required for the prover to know openings of the other commitments. The proof system is efficient, in particular in terms of communication requiring only the transmission of a logarithmic number of commitments. We use our proof system to instantiate both ring signatures and zerocoin, a novel mech-anism for bitcoin privacy. We use our Sigma-protocol as a (linkable) ad-hoc group identi-fication scheme where the users have public keys that are commitments and demonstrate knowledge of an opening for one of the commitments to unlinkably identify themselves (once) as belonging to the group. Applying the Fiat-Shamir transform on the group identification scheme gives rise to ring signatures, applying it to the linkable group iden-tification scheme gives rise to zerocoin. Our ring signatures are very small compared to other ring signature schemes and we only assume the users โ secret keys to be the discrete logarithms of single group elements so the setup is quite realistic. Similarly, compared with the original zerocoin protocol we rely on a weak cryptographic assumption and do not require a trusted setup. A third application of our Sigma protocol is an efficient proof of membership of a secret committed value u belonging to a public list L = {ฮป1,..., ฮปN}.
The main aim of cryptography is to provide the frameworks and solutions for information security. The fundamental weapons to protect information are interactions and private randomness. Since the breakthrough result, zero-knowledge proof system, by Goldwasser, Micali, and Rackoff in mid 80s, the cryptography community has endeavored to propose the new notions of information security and the relative solutions which more closely reflect the modern computing environment. Concurrent security first introduced by Dwork, Naor, and Sahai was suggested to capture the information security in the modern internet environment. That is, the adversary may interact with a honest parties in many concurrent executions of a protocol where the messages are scheduled in any adversarial way.Resettable security was first introduced by Canetti, Goldreich, Goldwasser, and Micali, which models the security issues in which parties have a limited source of private randomness. In other words, an adversary might interact with honest parties in many executions of a protocol while the honest parties are only allowed to use the polynomially bounded number of (hard-wired) randomness.An important question is: "How much efficient protocol can we construct to achieve the above security in terms of round complexity?" Unfortunately, it has been showed that the best possible round complexity for such protocols is poly-logarithmic in the security parameter based on black-box simulation without help of external set-up assumptions. Thus, the question is now to minimize the round complexity of protocols with a minimal set-up assumption.In this thesis, we positively answer the above question with help of set-up assumptions. Specifically, we consider two set-up assumptions, the Bare Public Key (BPK) model and the Cross-Domain (CD) model. The BPK model was first introduced by Canetti, Goldreich, Goldwasser, and Micali. In the BPK model, each party is required to register their public keys before the start of interacting with each other. The CD model is a newly proposed model in this work. In the CD model, we have domains which models key certification authorities in the real world and each party belongs to one of the domains.In the BPK model, we show a constructions of constant-round simultaneously resettable zero-knowledge argument of knowledge with a standard cryptographic assumptions. As a main building block for this result, we show a construction of constant-round simultaneously resettable witness-indistinguishable argument of knowledge.In the CD model, we show a construction of constant-round concurrently secure multi-party computation protocol with the fixed number of domains. On the other hand, we prove that if the number of domains is not fixed, such a constant-round protocol does not exist.
Pervasive computing is an exciting and blooming research field, in which innovative techniques and applications are continuously emerging and aim to provide ambient and personalized services to users with high quality. Ad hoc networks are wireless, self-organizing systems formed by co-operating nodes within communication range of each other that form temporary networks. Their topology is dynamic, decentralized, ever changing and the nodes may move around arbitrarily. The last few years have witnessed a wealth of research ideas on ad hoc networking that are moving rapidly into implemented standards. Technology under development for ad hoc networks and pervasive computing is making important steps toward this end goal possible. However, the security concerns remain a serious impediment to widespread adoption. The underlying radio communication medium for wireless network provides serious exposure to attacks against wireless networks. Wireless ad hoc networks usually cannot depend on traditional infrastructure found in enterprise environments such as dependable power sources, high bandwidth, continuous connectivity, common network services, well-known membership, static configuration, system administration, and physical security. Finally, throw in malicious adversaries with Byzantine collusion threats and you have a very interesting and challenging problem. Without adequate security, enterprises will not be able to profit from the use of wireless ad hoc networks and pervasive computing environment, defense organizations might be unable to guarantee the safety of their personnel in battlefield scenarios, and wireless ad hoc networks and pervasive computing will remain on the drawing board even if the other problems associated with them are solved. This special issue is focused on various aspects of security in ad hoc networks and pervasive computing research and development to report both in-depth research and applications-oriented works. The special issue is intended to foster state-of-the-art research in the area of security in ad hoc networks and pervasive computing. The aim of this special issue is to present a collection of high quality research papers that report the latest research advances in security of ad hoc. In this special issue, we selected seven papers, which can demonstrate advanced works in this field. A detailed overview of the selected works is given below. The first paper, An RC4-Based Lightweight Protocol for Secure Data Transmission on Resource-Constrained Devices, presents a simple, lightweight, but robust security protocol based on the backward property of RC4 stream cipher. The proposed protocol provides data confidentiality, data authentication, data integrity, and data freshness with low overhead and simple operation, allows packets be received in an arbitrary order, achieves semantic security, and does not require frequent key renew. The second paper, PAPA-UIC: A Design Approach and a Framework for Secure Mobile Ad-hoc Networks, proposes a new design approach and a framework for securing a practical type of MANETs. The framework is named PAPA-UIC. The paper proposes a secure routing protocol and solutions to general problems of identity-based cryptography. The routing protocol has several improvements over existing ones. The third paper, RFIDGuard: A Lightweight Privacy and Authentication Protocol for Passive RFID Tags, introduces a protocol which requires little computation and achieves both privacy and authentication simultaneously. The lightweight and secure nature of the RFIDGuard protocol make it particularly suitable for supply chain management. The fourth paper, Using Hidden Markov Model to Detect Rogue Access Points, proposes a statistical based approach to detect rogue access points using a Hidden Markov Model, which is applied to passively measure packet-header data collected at a gateway router. The main idea is to process the sequence of packet traces in order to distinguish the normal packets from the abnormal ones. The approach is scalable and non-intrusive, requiring little deployment cost and effort, and is easy to manage and maintain. The fifth paper, Defending Sybil Attacks Based on Neighboring Relations in Wireless Sensor Networks, develops a mechanism to protect a WSN from Sybil attacks without using any authentication-based method. Furthermore, the detection approach requires no specialized hardware or support devices. The feature that a malicious node creates many fake identities is exploited to distinguish legitimate nodes from Sybil/malicious nodes. Since all of the fake identities forged by the same malicious node are associated with the same physical device, they will have the same legitimate neighbors. Therefore, by collecting the neighboring information of the suspected victim of the Sybil attacks, the legitimate nodes which are the neighbors of the malicious nodes can be determined. In contrast to existing protection schemes, this approach has no requirement for shared keys, secret information, or special hardware support. The sixth paper, An Autonomous Attestation Token to Secure Mobile Agents in Disaster Response, introduces the Autonomous Attestation Token (AAT), a hardware token for mobile computing devices that is capable of guaranteeing the trusted state of a limited set of devices without relying on a networked service. The paper proposes a Local Attestation protocol with user interaction that in conjunction with the AAT prevents unauthorized access to an emergency mobile agent platform. In addition, the paper sketches a possible solution which integrates trusted computing to leverage ad hoc networks and peer-to-peer systems to provide a robust communication platform. The seventh paper, Building Advanced Applications with the Belgian eID, introduces the Belgian Electronic Identity Card. The card enables Belgian citizens to digitally prove their identity and to sign electronic documents. This paper presents two reusable extensions to the Belgian eID technology that opens up new opportunities for application developers. First, a secure and ubiquitously accessible remote storage service is presented. Second, it is shown how the eID card can be used to issue new certificates. The feasibility and reusability of both extensions are validated through the development of several applications in different domains. In conclusion, this issue of Security in Ad hoc offers a groundbreaking view into the recent advances in secure ad hoc networks. This issue offers both academic and industry appeal the former as a basis toward future research directions, and the latter toward viable commercial applications. Finally, we would like to express our gratitude to the Editor-in-Chief, Professor HsiaoHwa Chen for his advice, patience, and encouragements since the beginning until the final stage. Special thanks go to Michelle in Wiley during the production. We thank all anonymous reviewers who spent much of their precious time reviewing all the papers. Their timely reviews and comments greatly helped us select the best papers in this special issue. We also thank all authors who have submitted their papers for consideration for this issue. We hope you will enjoy reading the great selection of papers in this issue.
A sensor network typically refers to a collection of sensor nodes equipped with sensing, communication and processing capabilities. It brings an opportunity to solve many difficult problems including real time monitoring, tracking, and controlling. While the applications of sensor networking become many and varied, security has always been one of the major concerns in real deployments. In this dissertation, we design physical primitives for secure communication in wireless sensor networks, and develop a wireless security framework to provide conventional security services. We investigate the feasibility of achieving perfect secrecy and information authenticity without shared secrets via two physical primitives: (i) cooperative jamming primitive, where we introduce a secure coding problem in which not only the sender but also the receiver participates in the coding. In essence, the receiverโs role is to selectively jam the senderโs transmission at the level of bits, bytes, or packets. We then design a class of secure codes, called โdialog codesโ, for diverse channel models and receiver models. (ii) spatial verification primitive, where we exploit the spatial signature induced by the radio communications of a node on its neighboring nodes, and design a spatial primitive that robustly and efficiently validates the authenticity of the source of messages. To address trust initialization, we propose a zero knowledge proof alternative that allows bootstrapping trust among individuals in a distributed way.