Demo Data from EDBT 2026 / reviewers in the wild / expert
Sriram Nandha Premnath
dblp:97/7551
· DBLP profile ↗
5ranked-venue papers
4as first author
0since 2021 · last 2014
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 5 · 4 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.
| Computer networks
3 papers |
Physical-layer communications · 46% Wireless networking · 43% Wireless sensing and localization · 7% | |
| Network and information security
2 papers |
Cryptographic protocols and secure computation · 50% Cryptographic primitives and cryptanalysis · 50% |
Topics — the 12 heaviest of 12, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic protocols and secure computation › key exchange
secret key generation |
0.3 | 2 | 2013 | Secret Key Extraction from Wireless Signal Strength in Real Environments · IEEE Trans. Mob. Comput. 2013 On the effectiveness of secret key extraction from wireless signal strength in real environments · MobiCom 2009 |
Wireless networking › medium access control
distributed MAC protocol |
0.2 | 1 | 2013 | Beyond OFDM: Best-Effort Dynamic Spectrum Access Using Filterbank Multicarrier · IEEE/ACM Trans. Netw. 2013 |
Wireless networking › cognitive radio › spectrum access
dynamic spectrum access |
0.2 | 1 | 2013 | Beyond OFDM: Best-Effort Dynamic Spectrum Access Using Filterbank Multicarrier · IEEE/ACM Trans. Netw. 2013 |
Physical-layer communications › modulation › multicarrier modulation
filter bank multicarrier |
0.2 | 1 | 2013 | Beyond OFDM: Best-Effort Dynamic Spectrum Access Using Filterbank Multicarrier · IEEE/ACM Trans. Netw. 2013 |
Wireless networking
medium access control |
0.2 | 1 | 2013 | Beyond OFDM: Best-Effort Dynamic Spectrum Access Using Filterbank Multicarrier · IEEE/ACM Trans. Netw. 2013 |
Physical-layer communications › modulation
multicarrier modulation |
0.2 | 1 | 2013 | Beyond OFDM: Best-Effort Dynamic Spectrum Access Using Filterbank Multicarrier · IEEE/ACM Trans. Netw. 2013 |
Physical-layer communications
physical layer security |
0.2 | 1 | 2013 | Secret Key Extraction from Wireless Signal Strength in Real Environments · IEEE Trans. Mob. Comput. 2013 |
Cryptographic primitives and cryptanalysis
key generation |
0.2 | 1 | 2013 | Secret Key Extraction from Wireless Signal Strength in Real Environments · IEEE Trans. Mob. Comput. 2013 |
Cryptographic primitives and cryptanalysis › key generation
physical-layer key generation |
0.1 | 1 | 2009 | On the effectiveness of secret key extraction from wireless signal strength in real environments · MobiCom 2009 |
Wireless sensing and localization
received signal strength |
0.1 | 2 | 2013 | Secret Key Extraction from Wireless Signal Strength in Real Environments · IEEE Trans. Mob. Comput. 2013 On the effectiveness of secret key extraction from wireless signal strength in real environments · MobiCom 2009 |
Vehicular, aerial and satellite networks
vehicular networks |
0.0 | 1 | 2013 | Beyond OFDM: Best-Effort Dynamic Spectrum Access Using Filterbank Multicarrier · IEEE/ACM Trans. Netw. 2013 |
Physical-layer communications › wireless channel
wireless channel characteristics |
0.0 | 1 | 2009 | On the effectiveness of secret key extraction from wireless signal strength in real environments · MobiCom 2009 |
Methods — techniques the papers use, named apart from their topics
privacy amplification · 0.5information reconciliation · 0.5adaptive lossy quantizer · 0.3adaptive lossy quantization · 0.2software-defined radio · 0.2simulation · 0.2NIST randomness tests · 0.2NIST randomness test · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2014 | Secret key extraction using Bluetooth wireless signal strength measurementsabstractBluetooth has found widespread adoption in phones, wireless headsets, stethoscopes, glucose monitors, and oximeters for communication of, at times, very critical information. However, the link keys and encryption keys in Bluetooth are ultimately generated from a short 4 digit PIN, which can be cracked off-line. We develop an alternative for secure communication between Bluetooth devices using the symmetric wireless channel characteristics. Existing approaches to secret key extraction primarily use measurements from a fixed, single channel (e.g., a 20 MHz WiFi channel); however in the presence of heavy WiFi traffic, the packet exchange rate in such approaches can reduce as much as 200 x. We build and evaluate a new method, which is robust to heavy WiFi traffic, using a very wide bandwidth (B >> 20 MHz) in conjunction with random frequency hopping. We implement our secret key extraction on two Google Nexus One smartphones and conduct numerous experiments in indoor-hallway and outdoor settings. Using extensive real-world measurements, we show that outdoor settings are best suited for secret key extraction using Bluetooth. We also show that even in the absence of heavy WiFi traffic, the performance of secret key generation using Bluetooth is comparable to that of WiFi while using much lower transmit power. Sriram Nandha Premnath, Prarthana Lakshmane Gowda, Sneha Kumar Kasera, Neal Patwari, Robert Ricci |
SECON | 1 |
| 2014 | Efficient High-Rate Secret Key Extraction in Wireless Sensor Networks Using CollaborationabstractSecret key establishment is a fundamental requirement for private communication between two entities. In this article, we propose and evaluate a new approach for secret key extraction where multiple sensors collaborate in exchanging probe packets and collecting channel measurements. Essentially, measurements from multiple channels have a substantially higher differential entropy compared to the measurements from a single channel, thereby resulting in more randomness in the information source for key extraction, and this in turn produces stronger secret keys. We also explore the fundamental trade-off between the quadratic increase in the number of measurements of the channels due to multiple nodes per group versus a linear reduction in the sampling rate and a linear increase in the time gap between bidirectional measurements. To experimentally evaluate collaborative secret key extraction in wireless sensor networks, we first build a simple yet flexible testbed with multiple TelosB sensor nodes. Next, we perform large-scale experiments with different configurations of collaboration. Our experiments show that in comparison to the 1 × 1 configuration, collaboration among sensor nodes significantly increases the secret bit extraction per second, per probe, as well as per millijoule of transmission energy. In addition, we show that the collaborating nodes can improve the performance further when they exploit both space and frequency diversities. Sriram Nandha Premnath, Jessica Croft, Neal Patwari, Sneha Kumar Kasera |
ACM Trans. Sens. Networks | 1 |
| 2013 | Secret Key Extraction from Wireless Signal Strength in Real EnvironmentsabstractWe evaluate the effectiveness of secret key extraction, for private communication between two wireless devices, from the received signal strength (RSS) variations on the wireless channel between the two devices. We use real world measurements of RSS in a variety of environments and settings. The results from our experiments with 802.11-based laptops show that in certain environments, due to lack of variations in the wireless channel, the extracted bits have very low entropy making these bits unsuitable for a secret key, an adversary can cause predictable key generation in these static environments, and in dynamic scenarios where the two devices are mobile, and/or where there is a significant movement in the environment, high entropy bits are obtained fairly quickly. Building on the strengths of existing secret key extraction approaches, we develop an environment adaptive secret key generation scheme that uses an adaptive lossy quantizer in conjunction with Cascade-based information reconciliation and privacy amplification. Our measurements show that our scheme, in comparison to the existing ones that we evaluate, performs the best in terms of generating high entropy bits at a high bit rate. The secret key bit streams generated by our scheme also pass the randomness tests of the NIST test suite that we conduct. We also build and evaluate the performance of secret key extraction using small, low-power, hand-held devices-Google Nexus One phones-that are equipped 802.11 wireless network cards. Last, we evaluate secret key extraction in a multiple input multiple output (MIMO)-like sensor network testbed that we create using multiple TelosB sensor nodes. We find that our MIMO-like sensor environment produces prohibitively high bit mismatch, which we address using an iterative distillation stage that we add to the key extraction process. Ultimately, we show that the secret key generation rate is increased when multiple sensors are involved in the key extraction process. Sriram Nandha Premnath, Suman Jana, Jessica Croft, Prarthana Lakshmane Gowda, Mike Clark, Sneha Kumar Kasera, Neal Patwari, Srikanth V. Krishnamurthy |
IEEE Trans. Mob. Comput. | 1 |
| 2013 | Beyond OFDM: Best-Effort Dynamic Spectrum Access Using Filterbank MulticarrierabstractOrthogonal frequency division multiplexing (OFDM), widely recommended for sharing the spectrum among different nodes in a dynamic spectrum access network, imposes tight timing and frequency synchronization requirements. We examine the use of filterbank multicarrier (FBMC), a somewhat lesser known and understood alternative, for dynamic spectrum access. FBMC promises very low out-of-band energy of each subcarrier signal when compared to OFDM. In order to fully understand and evaluate the promise of FBMC, we first examine the use of special pulse-shaping filters of the FBMC PHY layer in reliably transmitting data packets at a very high rate. Next, to understand the impact of FBMC beyond the PHY layer, we devise a distributed and adaptive medium access control (MAC) protocol that coordinates data packet traffic among the different nodes in the network in a best-effort manner. Using extensive simulations, we show that FBMC consistently achieves at least an order of magnitude performance improvement over OFDM in several aspects including packet transmission delays, channel access delays, and effective data transmission rate available to each node in static, indoor settings. Using measurements of power spectral density and high data rate transmissions from a transceiver that we build using our National Instruments hardware platform, we show that while FBMC can decode/distinguish all the received symbols without any errors, OFDM cannot. Finally, we also examine the use of FBMC in a vehicular network setup. We find that FBMC achieves an order of magnitude performance improvement over large distances in this setup as well. Furthermore, in the case of multihop vehicular networks, FBMC can achieve about 20 × smaller end-to-end data packet delivery delays and relatively low packet drop probabilities. In summary, FBMC offers a much higher performing alternative to OFDM for networks that dynamically share the spectrum among multiple nodes. Sriram Nandha Premnath, Daryl Leon Wasden, Sneha Kumar Kasera, Neal Patwari, Behrouz Farhang-Boroujeny |
IEEE/ACM Trans. Netw. | 1 |
| 2009 | On the effectiveness of secret key extraction from wireless signal strength in real environmentsabstractWe evaluate the effectiveness of secret key extraction, for private communication between two wireless devices, from the received signal strength (RSS) variations on the wireless channel between the two devices. We use real world measurements of RSS in a variety of environments and settings. Our experimental results show that (i) in certain environments, due to lack of variations in the wireless channel, the extracted bits have very low entropy making these bits unsuitable for a secret key, (ii) an adversary can cause predictable key generation in these static environments, and (iii) in dynamic scenarios where the two devices are mobile, and/or where there is a significant movement in the environment, high entropy bits are obtained fairly quickly. Building on the strengths of existing secret key extraction approaches, we develop an environment adaptive secret key generation scheme that uses an adaptive lossy quantizer in conjunction with Cascade-based information reconciliation [7] and privacy amplification [14]. Our measurements show that our scheme, in comparison to the existing ones that we evaluate, performs the best in terms of generating high entropy bits at a high bit rate. The secret key bit streams generated by our scheme also pass the randomness tests of the NIST test suite [21] that we conduct. Suman Jana, Sriram Nandha Premnath, Mike Clark, Sneha Kumar Kasera, Neal Patwari, Srikanth V. Krishnamurthy |
MobiCom | 2 |