Demo Data from VLDB 2026 / reviewers in the wild / expert
Shamiek Mangipudi
dblp:354/1403
· DBLP profile ↗
2ranked-venue papers
2as first author
2since 2021 · last 2025
0000-0002-9510-7665ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 first-author · 1 since 2021
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
1 paper |
Systems and software security · 67% Privacy and data protection · 33% | |
| Software engineering, system software, and programming languages
1 paper |
Programming languages and type systems · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Distributed systems · 100% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Privacy and data protection
confidentiality protection |
0.7 | 1 | 2023 | Generalized Policy-Based Noninterference for Efficient Confidentiality-Preservation · Proc. ACM Program. Lang. 2023 |
Systems and software security
information flow control |
0.7 | 1 | 2023 | Generalized Policy-Based Noninterference for Efficient Confidentiality-Preservation · Proc. ACM Program. Lang. 2023 |
Systems and software security › information flow control
noninterference |
0.7 | 1 | 2023 | Generalized Policy-Based Noninterference for Efficient Confidentiality-Preservation · Proc. ACM Program. Lang. 2023 |
Programming languages and type systems › type systems
security type systems |
0.7 | 1 | 2023 | Generalized Policy-Based Noninterference for Efficient Confidentiality-Preservation · Proc. ACM Program. Lang. 2023 |
Programming languages and type systems
type systems |
0.7 | 1 | 2023 | Generalized Policy-Based Noninterference for Efficient Confidentiality-Preservation · Proc. ACM Program. Lang. 2023 |
Distributed systems › distributed data processing
distributed data analytics |
0.2 | 1 | 2023 | Generalized Policy-Based Noninterference for Efficient Confidentiality-Preservation · Proc. ACM Program. Lang. 2023 |
Methods — techniques the papers use, named apart from their topics
type system · 2.0trusted execution environment · 2.0security policies · 2.0noninterference · 2.0homomorphic encryption · 2.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Confidential Analytics with ScyllaabstractWhile security concerns of data at rest and in transit have been addressed over the years using standard cryptographic measures, those surrounding data in use have garnered significant attention in recent times. In response, various trusted execution environments (TEEs) have been proposed and are on offer from leading public cloud providers. With development and re-programming efforts, availability, threat models, pricing, performance, etc., differing between various TEEs themselves and also with viable alternatives such as software solutions like partially homomorphic encryption (PHE) to protect data in use, it is imperative to have a system that is independent of these several varying dimensions while also efficiently achieving end-to-end confidentiality guarantees on data processing. Shamiek Mangipudi, Pavel Chuprikov, Gerald Prendi, Patrick Eugster |
SoCC | 1 |
| 2023 | Generalized Policy-Based Noninterference for Efficient Confidentiality-PreservationabstractAs more organizations are leveraging third-party cloud and edge data centers to process data efficiently, the issue of preserving data confidentiality becomes increasingly important. In response, numerous security mechanisms have been introduced and promoted in recent years including software-based ones such as homomorphic encryption, as well as hardware-based ones such as Intel SGX and AMD SEV. However these mechanisms vary in their security properties, performance characteristics, availability, and application modalities, making it hard for programmers to judiciously choose and correctly employ the right one for a given data query. This paper presents a mechanism-independent approach to distributed confidentiality-preserving data analytics. Our approach hinges on a core programming language which abstracts the intricacies of individual security mechanisms. Data is labeled using custom confidentiality levels arranged along a lattice in order to capture its exact confidentiality constraints. High-level mappings between available mechanisms and these labels are captured through a novel expressive form of security policy. Confidentiality is guaranteed through a type system based on a novel formulation of noninterference, generalized to support our security policy definition. Queries written in a largely security-agnostic subset of our language are transformed to the full language to automatically use mechanisms in an efficient, possibly combined manner, while provably preserving confidentiality in data queries end-to-end. We prototype our approach as an extension to the popular Apache Spark analytics engine, demonstrating the significant versatility and performance benefits of our approach over single hardwired mechanisms --- including in existing systems --- without compromising on confidentiality. Shamiek Mangipudi, Pavel Chuprikov, Patrick Eugster, Malte Viering, Savvas Savvides |
Proc. ACM Program. Lang. | 1 |