@inproceedings {DBLP:conf/cans/ArmourC21,
	title = {Partition Oracles from Weak Key Forgeries},
	journal = {Cryptology and Network Security - 20th International Conference, CANS 2021, Vienna, Austria, December 13-15, 2021, Proceedings},
	volume = {13099},
	year = {2021},
	pages = {42{\textendash}62},
	publisher = {Springer},
	doi = {10.1007/978-3-030-92548-2\_3},
	url = {https://doi.org/10.1007/978-3-030-92548-2\_3},
	author = {Armour, Marcel and Cid, Carlos},
	editor = {Conti, Mauro and Stevens, Marc and Krenn, Stephan}
}
@article {27327,
	title = {Blockchain-enabled Secure Energy Trading with Verifiable Fairness in Industrial Internet of Things},
	journal = { IEEE Transactions on Industrial Informatics},
	volume = {16},
	year = {2020},
	pages = {6564-6574},
	publisher = { IEEE},
	abstract = {Energy trading in Industrial Internet of Things (IIoT), a fundamental approach to realize Industry 4.0, plays a vital role in satisfying energy demands and optimizing system efficiency. Existing research works adopts a utility company to distribute energy to energy nodes with the help of energy brokers. Afterwards, they apply blockchain to provide transparency, immutability, and auditability of peer-to-peer (P2P) energy trading. However, their schemes are constructed on a weak security model and do not consider the cheating attack initiated by energy sellers. Such an attack refers to an energy seller refusing to transfer the negotiated energy to an energy purchaser who already paid money. In this paper, we propose FeneChain, a blockchain-based energy trading scheme to supervise and manage the energy trading process towards building a secure energy trading system and improving the energy quality for Industry 4.0. Specifically, we leverage anonymous authentication to protect user privacy, and we design a timed commitments based mechanism to guarantee the verifiable fairness during energy trading. Moreover, we utilize fine-grained access control for energy trading services. We also build a consortium blockchain among energy brokers to verify and record energy trading transactions. Finally, we formally analyze the security and privacy of FeneChain and evaluate its performance (i.e., computational costs and communication overhead) by implementing a prototype via a local Ethereum test network and Raspberry Pi.},
	keywords = {blockchain, energy trading, Industrial Internet of Things, Industry 4.0, Privacy, Security},
	doi = {https://doi.org/10.1109/TII.2020.2974537},
	author = {Li, Meng and Hu, Donghui and Lal, Chhagan and Conti, Mauro and Zhang, Zijian}
}
@article {27471,
	title = {LEChain: A blockchain-based lawful evidence management scheme for digital forensics},
	journal = {Journal of Future Generation Computer Systems},
	volume = {115},
	year = {2020},
	pages = {406-420},
	publisher = {Elsevier},
	abstract = {Lawful evidence management in digital forensics is of paramount importance in police investigations because such evidence is used to convict suspects of crimes. Existing studies have adopted cloud computing to collect evidence and then leveraged blockchain to support the transparency, immutability, and auditability of the evidence. Unfortunately, such studies only rely on a weak security model and do not cover the entire life cycle of the evidence or address the key privacy issues, i.e., witness privacy in evidence collection and juror privacy in court trials. In this work, we propose LEChain, a blockchainbased lawful evidence management scheme to supervise the entire evidence flow and all of the court data (e.g., votes and trial results), extending from evidence collection and access during the police investigation to jury voting in the court trials. Specifically, we utilize short randomizable signatures to anonymously authenticate witnesses{\textquoteright} identities to protect the witness privacy. Then, we leverage fine-grained access control based on ciphertext-policy attribute-based encryption for evidence access. Next, we design a secure voting method to protect juror privacy. In addition, we build a consortium blockchain to record evidence transactions. Finally, we formally analyze the security and privacy of LEChain and evaluate its computational costs and communication overhead by implementing a prototype based on a local Ethereum test network.},
	keywords = {blockchain, Chain of custody, Digital forensics, Lawful evidence, Privacy, Security},
	doi = {https://doi.org/10.1016/j.future.2020.09.038},
	author = {Li, Meng and Lal, Chhagan and Conti, Mauro and Hua, Donghui}
}
@article {27364,
	title = {LiDL: Localization with early detection of sybil and wormhole attacks in IoT Networks},
	journal = {Computers and Security, Elsevier},
	volume = {94},
	year = {2020},
	publisher = {Elsevier},
	abstract = {The Internet of Things (IoT) is recognized as a disruptive innovation that has been led by industry leaders and researchers. IoT promises to improve our daily life based on smart objects interacting with each other, and that can be connected to the Internet. Building a security framework into this new paradigm is a significant technical challenge today. It is mainly due to the low-cost and resource-constrained nature of IoT devices. In most of the IoT application scenarios, the routing is done by the de-facto standard protocol called routing protocol for low power and lossy networks (RPL). The use of RPL is suitable due to its energy-efficient schemes, availability of secure and multiple communication modes, and adaptivity to work in various IoT network scenarios. Hence, many researchers are now focusing on RPL related security issues. To this end, our work provides a concise description of two major threats to RPL called sybil and wormhole attacks. Moreover, we propose two solutions to detect these attacks in RPL-based IoT networks. Specifically, our proposed techniques exploit the concept of Highest Rank Common Ancestor (HRCA) to find a common ancestor with the highest rank among all the ancestors that a pair of nodes have in the target network tree. Our two detection algorithms not only detect an ongoing attack but also localizes the position of the adversary in the network. Thus, it makes the mitigation process lightweight and fast. We implement the two approaches in Cooja, the Contiki network emulator. The results obtained from our experiments demonstrate the feasibility of the proposals concerning true positive rate, detection time, packet loss ratio, memory consumption, and network overhead. Our techniques show promising to cover more complex scenarios in the future.},
	keywords = {6LoWPAN, Internet of things, IPv6, RPL, Security, Sybil attack, Wormhole attack},
	issn = {0167-4048},
	doi = {https://doi.org/10.1016/j.cose.2020.101849},
	author = {Kaliyar, Pallavi and Ben Jaballah, Wafa and Conti, Mauro and Lal, Chhagan}
}
@article {27376,
	title = {NC based DAS-NDN: Network Coding for robust Dynamic Adaptive Streaming over NDN},
	journal = {Computer Networks},
	volume = {174},
	year = {2020},
	publisher = {Elsevier},
	abstract = {Over the last few years, the dramatic growth in video demand has inspired the service providers (e.g., Netflix and YouTube) to swing towards HTTP based Dynamic Adaptive Streaming (DASH). However, sustaining the adequate bandwidth claims over this rapid growth in multimedia content becomes a significant challenge for network operators. Considering the effectiveness of the next generation future Internet architecture, i.e., Name Data Networking (NDN), recently DASH over NDN is implemented. The fundamental characteristics of NDN, such as efficient content distribution and low bandwidth requirements, significantly increase the bandwidth utilization, which ensures the smooth delivery of multimedia content. However, we discovered that the above characteristics of NDN also opens the door for new vulnerabilities.
In this paper, first we propose a new attack termed as {\textquotedblleft}Bitrate Oscillation Attack{\textquotedblright} (BOA), which disrupt the functionality of DASH protocol over NDN by exploiting its two key features called in-network caching and interest aggregation. In particular, BOA forces the DASH streaming system running at the honest client to oscillate in various video resolutions with high frequency and amplitude, within a single video session. Second, to mitigate the BOA, we design and implement a proactive countermeasure called {\textquotedblleft}NC based DAS-NDN{\textquotedblright}. Our solution efficiently enables the network coding to DAS multimedia content and within NDN architecture. Thus, without any coordination between the network nodes reduces bitrate oscillations in the presence of BOA and NDN{\textquoteright}s inherent content source variations. The performance evaluation performed on different target scenarios proves the effectiveness of our proposed attack, and the results also show the correctness of our proposed corresponding countermeasure. In particular, the result analysis shows that BOA increases the annoyance factor in spatial dimension of end-user, and our countermeasure greatly reduces the adverse effects of BOA and also make DAS friendly to NDN{\textquoteright}s inherent},
	keywords = {Adaptive multimedia streaming, Bit rate oscillations, DASH, Name Data Networking, Network Coding},
	issn = {1389-1286},
	doi = {https://doi.org/10.1016/j.comnet.2020.107222},
	author = {Hassan, Muhammad and Conti, Mauro and Lal, Chhagan}
}
@article {27437,
	title = {Privacy-preserving Navigation Supporting Similar Queries in Vehicular Networks},
	journal = {IEEE Transactions on Dependable and Secure Computing},
	year = {2020},
	publisher = { IEEE},
	abstract = {Traffic-sensitive navigation systems in vehicular networks help drivers avoid traffic jams by providing several realtime navigation routes. However, drivers still encounter privacy concerns because their sensitive locations, i.e., their start point and endpoint, are submitted to an honest-but-curious navigation service provider (NSP). Previous privacy-preserving studies exhibit serious deficiencies under similar queries: if a driver makes several similar queries, i.e., periodically makes requests for the same start point and endpoint to the NSP, these requests will eventually reveal the areas of the two points as well as the route. In this paper, we present a novel privacy-preserving navigation scheme PiSim, which supports similar queries in navigation services. Intuitively, we transform the typical navigation approach into a traffic congestion querying approach. Instead of sending two locations to the NSP and awaiting a navigation route, drivers query the traffic congestion along the navigation route. Specifically, PiSim is characterized by extending anonymous authentication, facilitating privacy-preserving multi-keyword fuzzy search, and constructing weighted proximity graphs. Our scheme protects location privacy and route privacy, and defends against multiple requesting, spurious reporting, and collusion attacks from malicious drivers. Finally, a detailed analysis confirms the privacy and security properties of PiSim. Extensive experiments are conducted to demonstrate the feasibility, performance, and privacy protection level.},
	keywords = {Location Privacy, Navigation Services, Privacy Measurement, Similar Queries, Vehicular Networks},
	doi = {https://doi.org/10.1109/TDSC.2020.3017534},
	author = {Li, Meng and Chen, Yifei and Zheng, Shuli and Hu, Donghui and Lal, Chhagan and Conti, Mauro}
}
@article {27326,
	title = {The Road Ahead for Networking: A Survey on ICN-IP Coexistence Solutions},
	journal = {IEEE Communications Surveys and Tutorials},
	volume = {22},
	number = {2104-2129},
	year = {2020},
	publisher = { IEEE},
	abstract = {In recent years, the usage model of the Internet has changed, pushing researchers towards the design of the ICN paradigm as a possible replacement of the existing architecture. Even though both Academia and Industry have investigated the feasibility and effectiveness of ICN, achieving the complete replacement of the IP is a challenging task: (i) the process involves multiple parties, such as ISPs, that need to coordinate among each other; (ii) it requires an indefinite amount of time to update hardware and software of network components; and (iii) it is a high risk goal that might introduce unexpected complications. Thus, the process of replacing the current Internet will inevitably lead towards a period of coexistence between the old and the new architectures. Given the urgency of the problem, this transition phase will happen very soon and people should address it in a smooth way. Some research groups have already addressed the coexistence by designing their own architectures, but none of those is the final solution to move towards the future Internet considering the unaltered state of the networking. To design such architecture, the research community needs now a comprehensive overview of the existing solutions that have so far addressed the coexistence. The purpose of this paper is to reach this goal by providing the first comprehensive survey and classification of the coexistence architectures according to their features (i.e., deployment approach, deployment scenarios, addressed coexistence requirements and additional architecture or technology used) and evaluation parameters (i.e., challenges emerging during the deployment and the runtime behaviour of an architecture). We believe that this paper will finally fill the gap required for moving towards the design of the final coexistence architecture.},
	keywords = {Coexistence Solutions, Future Internet Architectures, Information-Centric Networking, Internet Protocol, Secure Transition},
	doi = {https://doi.org/10.1109/COMST.2020.2994526},
	author = {Conti, Mauro and Gangwal, Ankit and Hassan, Muhammad and Lal, Chhagan and Losiouk, Eleonora}
}
@article {27363,
	title = {A robust multicast communication protocol for Low power and Lossy networks},
	journal = {Journal of Network and Computer Applications},
	volume = {164},
	year = {2020},
	publisher = {Elsevier},
	abstract = {Routing Protocol for low power and Lossy networks (RPL) is a standardized routing protocol for low power and lossy networks (LLNs) such as the Internet of Things (IoT). RPL was designed to be a simple (but efficient) and practical networking protocol to perform routing in IoT networks that consists of resource constrained devices. These tiny intercommunicating devices are currently in use in a large array of IoT application services (e.g., eHealth, smart agriculture, smart grids, and home automation). However, the lack of scalability and the low data communication reliability due to faulty links or malicious nodes, still remains significant challenges in the broader adoption of RPL in LLNs. In this paper, we propose RECOUP, a robust multicast communication routing protocol for Low power and Lossy Networks. RECOUP efficiently uses a low-overhead cluster-based multicast routing technique on top of the RPL protocol. RECOUP increases the probability of message delivery to the intended destination(s), irrespective of the network size and faults (such as broken links or non-responsive nodes), and in the presence of misbehaving nodes. An implementation of RECOUP is realized in Contiki. Our results show the effectiveness of RECOUP over state-of-art protocols concerning packet delivery ratio to 25\%, end-to-end delay down to 100 ms, and low radio transmissions required for per packet delivery to 6 mJ. Moreover, it minimizes the impact of various topologies (i.e., rank and sybil) and data communication (i.e., blackhole, wormhole, and jamming) attacks that targets an IoT networking infrastructure.},
	keywords = {6LoWPAN, Communication security, Internet of things, IPv6, LLNs, Multicast routing, RPL},
	issn = {1084-8045},
	doi = {https://doi.org/10.1016/j.jnca.2020.102675},
	author = {Conti, Mauro and Kaliyar, Pallavi and Lal, Chhagan}
}
