Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Nalin Subramanian

dblp:79/2610 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
0since 2021 · last 2009
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Human-computer interaction and ubiquitous computing · 3 · 2 first-authorComputer networks · 2 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
3 papers
Privacy and data protection · 33% Cyber-physical and IoT security · 29% Cryptographic protocols and secure computation · 25%
Computer networks
3 papers
Internet of things and sensor networks · 100%

Topics — the 8 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cyber-physical and IoT security
wireless sensor network security
0.222009
ElliPS: A Privacy Preserving Scheme for Sensor Data Storage and Query · INFOCOM 2009
Securing Distributed Data Storage and Retrieval in Sensor Networks · PerCom 2007
Privacy and data protection
query privacy
0.112009
ElliPS: A Privacy Preserving Scheme for Sensor Data Storage and Query · INFOCOM 2009
Privacy and data protection › privacy-preserving sensing
sensor data privacy
0.112009
ElliPS: A Privacy Preserving Scheme for Sensor Data Storage and Query · INFOCOM 2009
Internet of things and sensor networks › sensor network security
message authentication
0.112008
Lightweight and Compromise-Resilient Message Authentication in Sensor Networks · INFOCOM 2008
Internet of things and sensor networks
wireless sensor network
0.112008
Lightweight and Compromise-Resilient Message Authentication in Sensor Networks · INFOCOM 2008
Authentication and access control › user authentication
lightweight authentication
0.112008
Lightweight and Compromise-Resilient Message Authentication in Sensor Networks · INFOCOM 2008
Cryptographic protocols and secure computation
secure distributed storage
0.112007
Securing Distributed Data Storage and Retrieval in Sensor Networks · PerCom 2007
Internet of things and sensor networks › sensor data management
sensor data storage
0.012009
ElliPS: A Privacy Preserving Scheme for Sensor Data Storage and Query · INFOCOM 2009

Methods — techniques the papers use, named apart from their topics

simulation · 0.2elliptic curve cryptography · 0.2perturbed polynomial-based technique · 0.2security analysis · 0.1TOSSIM simulation · 0.1
YearPublicationVenuePosition
2009 ElliPS: A Privacy Preserving Scheme for Sensor Data Storage and Query
abstract
With in-network sensor data storage and query, storage nodes are responsible for storing the data collected by sensor nodes and answering queries from users. Thus, without proper protection for data types and user queries, compromise of storage nodes and/or sensor nodes may reveal sensitive information about the sensed environment as well as users' private interests and query patterns. In this paper, we explore trade-offs between privacy, computation overhead, communication overhead, network flexibility and network complexity, and propose ElliPS (Elliptic curve based Privacy Scheme) to provide joint protection on data type privacy and query privacy in the presence of sensor node compromise, storage node compromise, or under collusive attacks by compromised sensor nodes and storage nodes together. Extensive analysis and simulation are conducted to verify the security properties and efficiency of the proposed scheme.
Nalin Subramanian, Ka Yang, Wensheng Zhang 0001, Daji Qiao
INFOCOM1
2009 EagleVision: A pervasive mobile device protection system
abstract
Mobile devices like laptops, iPhones and PDAs are highly susceptible to theft in public places like airport terminal, library and cafe. Moreover, the exposure of sensitive data stored in the mobile device could be more damaging than the loss of device itself. In this work, we propose and implement a
Ka Yang, Nalin Subramanian, Daji Qiao, Wensheng Zhang 0001
MobiQuitous2
2008 Lightweight and Compromise-Resilient Message Authentication in Sensor Networks
abstract
Numerous authentication schemes have been proposed in the past for protecting communication authenticity and integrity in wireless sensor networks. Most of them however have following limitations: high computation or communication overhead, no resilience to a large number of node compromises, delayed authentication, lack of scalability, etc. To address these issues, we propose in this paper a novel message authentication approach which adopts a perturbed polynomial-based technique to simultaneously accomplish the goals of lightweight, resilience to a large number of node compromises, immediate authentication, scalability, and non-repudiation. Extensive analysis and experiments have also been conducted to evaluate the scheme in terms of security properties and system overhead.
Wensheng Zhang 0001, Nalin Subramanian, Grace Guiling Wang
INFOCOM2
2007 Securing Distributed Data Storage and Retrieval in Sensor Networks
abstract
Sensor networks have been an attractive platform for pervasive computing and communication. Due to the lack of physical protection, however, sensor networks are vulnerable to attacks if deployed in hostile environments. When a sensor network is under attack, the most fundamental concern is that information communicated or stored in the network remains safe. The past research has focused on securing information in communication, but how to secure information in storage has been generally overlooked. Meanwhile, distributed data storage and retrieval have become popular for efficient data management in sensor networks, which renders the absence of schemes for securing stored information to be a more severe problem. Hence, we propose in this paper three schemes to deal with the problem. All the schemes have the following properties: (i) only authorized entities can access data stored in the sensor network; (ii) the schemes are resilient to a large number of sensor node compromises. The second and the third schemes do not involve any centralized entity except for a few initialization or renewal operations, and thus support secure, distributed data storage and retrieval. The third scheme further provides high scalability and flexibility, and hence is most suitable in real applications. The effectiveness and efficiency of the proposed schemes have also been verified through extensive analysis and TOSSIM-based simulations
Nalin Subramanian, Chanjun Yang, Wensheng Zhang 0001
PerCom1
2007 Securing distributed data storage and retrieval in sensor networks
Nalin Subramanian, Chanjun Yang, Wensheng Zhang 0001
Pervasive Mob. Comput.1