Demo Data from VLDB 2026 / reviewers in the wild / expert
Apurva Kumar
dblp:33/2051
· DBLP profile ↗
11ranked-venue papers
7as first author
1since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 2 · 1 since 2021Security and privacy · 2 · 2 first-authorSoftware engineering, systems software and programming languages · 2 · 2 first-authorDatabases, data management, data science and information retrieval · 2 · 2 first-authorSystems, architecture and hardware · 1 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1
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 architecture, parallel and distributed computing, and storage systems
2 papers |
Distributed systems · 81% Embedded and real-time systems · 15% Memory systems · 4% | |
| Databases, data mining, and information retrieval
2 papers |
Data integration and cleaning · 100% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Distributed systems › replication
filter-based replication |
0.1 | 2 | 2007 | Efficient Filter Based Replication for LDAP Directories · ICDE 2007 Filter Based Directory Replication and Caching: Algorithms and Performance · ICDE 2005 |
Distributed systems
replication |
0.1 | 2 | 2007 | Efficient Filter Based Replication for LDAP Directories · ICDE 2007 Filter Based Directory Replication and Caching: Algorithms and Performance · ICDE 2005 |
Distributed systems › replication
partial replication |
0.1 | 1 | 2007 | Efficient Filter Based Replication for LDAP Directories · ICDE 2007 |
Embedded and real-time systems
synchronization protocols |
0.1 | 1 | 2007 | Efficient Filter Based Replication for LDAP Directories · ICDE 2007 |
Distributed systems › replication › data replication
replicated directory |
0.1 | 1 | 2005 | Filter Based Directory Replication and Caching: Algorithms and Performance · ICDE 2005 |
Memory systems
cache |
0.0 | 1 | 2005 | Filter Based Directory Replication and Caching: Algorithms and Performance · ICDE 2005 |
Methods — techniques the papers use, named apart from their topics
performance evaluation · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Replacing OTN Core Networks with Packet Networks: Demonstration of 100Gb/s OTU4s over 400Gb/s Private Line Emulation (PLE) in Packet NetworksabstractWe demonstrate, for the first time, 100Gb/s OTU4 over 400GE PLE (Private Line Emulation) across a packet network with OTN like service over a packet backbone. With the decrease of interest in OTN and emergence of IP over DWDM, PLE is an attractive proposal in the IETF for provisioning leased-lines (which continue to be high-margin services for providers). PLE involves the mapping of high-speed OTN services (OTU4 typically, but also OTU2) on to packets and use a smart signaling infrastructure of the packet switched network to provision pseudo-wires. We developed PLE hardware and interfaces it with IP routers to create 100Gb/s OTU4 over 400Gb/s Ethernet. We showed deterministic latency and low jitter in addition to significant network-wide power saving (up to 50%). Results also conform to the requirements of traditional circuit (OTN) communication. Mika Silvola, Ravi Singla, Lars Pedersen, Ashwin Gumaste, Walid Wakim, Rajan Rao, Dan Nielsen, Dean Humphreys, Angelito Fortes, Léon Zheng, Apurva Kumar, Chuck Tato |
GLOBECOM | 12 |
| 2018 | Double-Blind Consent-Driven Data Sharing on BlockchainabstractBlockchains are designed for trustworthy and transparent execution of transactions involving multiple parties. An important class of applications requires data to be shared selectively among mutually anonymous transacting peers while retaining the tamper-resistant evidentiary and validation features of a blockchain. KYC validations of corporate customers by banks is one example, where both banks and customers benefit from sharing process and data on a blockchain network. However, sharing of confidential KYC data must be authorized by customers, and a bank-customer relationship must be kept secret from other banks in the network. In this paper, we describe the design and implementation of a smart contract for consent-driven and double-blind data sharing on the Hyperledger Fabric blockchain platform. We show how a KYC application was built around this model to address the needs of the banks while meeting regulatory requirements. Kumar Bhaskaran, Peter Ilfrich, Dain Liffman, Christian Vecchiola, Praveen Jayachandran, Apurva Kumar, Fabian Lim, Karthik Nandakumar, Zhengquan Qin, Venkatraman Ramakrishna, Ernie G. S. Teo, Chun Hui Suen |
IC2E | 6 |
| 2014 | A Lightweight Formal Approach for Analyzing Security of Web Protocols
Apurva Kumar |
RAID | 1 |
| 2012 | Using automated model analysis for reasoning about security of web protocolsabstractInteroperable identity and trust management infrastructure plays an important role in enabling integrations in cloud computing environments. In the past decade or so, several web-based workflows have emerged as de-facto standards for user identity and resource access across enterprises. Establishing correctness of such web protocols is of immense importance to a large number of common business transactions on the web. In this paper, we propose a framework for analyzing security in web protocols. A novel aspect of our proposal is bringing together two contrasting styles used for security protocol analysis. We use the inference construction style, in which the well-known BAN logic has been extended to reason about web protocols, in conjunction with, an attack construction style that performs SAT based model-checking to rule out certain active attacks. The result is an analysis method that shares simplicity and intuitive appeal of belief logics, at the same time covers a wider range of protocols, along with an ability to automatically find attacks. To illustrate effectiveness, case study of a leading web identity and access management protocol is presented, where application of our analysis method results in a previously unreported attack being identified. Apurva Kumar |
ACSAC | 1 |
| 2012 | Privacy Preserving Social Mobile Applications
Venkatraman Ramakrishna, Apurva Kumar, Sougata Mukherjea |
MobiQuitous | 2 |
| 2011 | Model Driven Security Analysis of IDaaS Protocols
Apurva Kumar |
ICSOC | 1 |
| 2008 | Integrated Security Context Management of Web Components and Services in Federated Identity Environments
Apurva Kumar |
ICSOC | 1 |
| 2007 | Efficient Filter Based Replication for LDAP DirectoriesabstractIn this paper, we consider issues arising in partial replication of directories and motivate the need for filter based techniques which replicate query results rather than subtrees. A filter based replication model and a lightweight filter synchronization protocol are proposed. An efficient means of implementing the protocol based on the concepts of `change state' is described. A real enterprise directory and a real workload have been used for performance evaluation. Apurva Kumar |
ICDE | 1 |
| 2005 | Filter Based Directory Replication: Algorithms and PerformanceabstractDirectories have become an important component of the enterprise security and identity management middleware. This paper describes a novel filter based replication model for lightweight directory access protocol (LDAP) directories. Instead of replicating entire subtrees from a directory information tree (DIT), only entries matching a filter specification are replicated. Efficient algorithms for selecting such filters, keeping them synchronized with the master copy and for using them to answer directory queries have been proposed. Advantages of the filter based replication framework over existing subtree based mechanisms have been demonstrated for a real enterprise directory using real workloads Apurva Kumar |
ICDCS | 1 |
| 2005 | Filter Based Directory Replication and Caching: Algorithms and PerformanceabstractThis paper describes a novel filter based replication model for lightweight directory access protocol (LDAP) directories. Instead of replicating entire subtrees from the directory information tree (DIT), only entries matching a filter specification are replicated Advantages of the filter based replication framework over existing subtree based mechanisms have been demonstrated for a real enterprise directory using real workloads. Apurva Kumar |
ICDE | 1 |
| 2001 | MAC scheduling policies with reduced power consumption and bounded packet delays for centrally controlled TDD wireless networksabstractIn networks with mobile nodes, power consumption is an important constraint due to the limited battery power available at the mobile nodes. Reduction of power consumption in mobile devices can be achieved by keeping these devices in a low power (standby) mode during periods of inactivity. This may, however, result in increased end-to-end delays leading to violation of the quality of service (QoS) parameters. We propose medium access control (MAC) scheduling policies for centrally controlled TDD wireless systems. The proposed policies reduce the power consumption of mobile devices by putting them into low power mode intelligently, using probabilistic estimates of inactivity based on the previous traffic arrival pattern. The policies ensure that the QoS parameters such as end-to-end packet delays are not violated. Indraneel Chakraborty, Abhishek Kashyap, Apurva Kumar, Anupam Rastogi, Huzur Saran, Rajeev Shorey |
ICC | 3 |