Litmus: Towards a Practical Database Management System with Verifiable ACID Properties and Transaction Correctness
Yu Xia, Xiangyao Yu, Matthew Butrovich, Andrew Pavlo, Srinivas Devadas
Abstract
Existing secure database management systems (DBMSs) focus on security and privacy of data but overlook semantic properties, such as the correctness and ACID properties of transactions. Enforcing these properties is crucial to the functionality of applications. If these guarantees do not hold, catastrophic losses could result.
To address this issue, we present Litmus, a DBMS that can provide verifiable proofs of transaction correctness and semantic properties including atomicity and serializability. Litmus features a co-design of both the database and the cryptographic parts. We evaluate a proofof-concept prototype of Litmus on the YCSB and TPC-C benchmarks and show that under reasonable cryptographic assumptions it can process more than 17,000 transactions per second (txn/s) verifiably.
Our result shows a promising practical direction considering that PayPal runs on average 115 txn/s and VISA 2000-4000 txn/s. The proof is about 30kB per verification batch and verifies with a constant time of 300 seconds. Litmus can extend to verify consistency as well.
• Security and privacy → Database and storage security; • Theory of computation → Theory of database privacy and security.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 878f0381-c535-40cd-a0de-d081fc54dba3Cited by top-tier papers5
- Accelerating Zero-Knowledge Proofs Through Hardware-Algorithm Co-DesignNikola Samardzic, Simon Langowski, Srinivas Devadas, Daniel SánchezMICRO 2024 · 24 citations
- VeriBench: Analyzing the Performance of Database Systems with VerifiabilityCong Yue, Meihui Zhang, Changhao Zhu, Gang Chen et al.VLDB 2023 · 6 citations
- Finding Logic Bugs in Spatial Database Engines via Affine Equivalent InputsWenjing Deng, Qiuyang Mang, Chengyu Zhang, Manuel RiggerSIGMOD 2025 · 3 citations
- Checking Observational Correctness of Database SystemsLauren Pick, Amanda Xu, Ankush Desai, Sanjit A. Seshia et al.OOPSLA 2025 · 2 citations
- NeurBench: A Benchmark Suite for Learned Database Components with Drift Modeling: [Experiments & Analysis]Zhanhao Zhao, Haotian Gao, Naili Xing, Lingze Zeng et al.SIGMOD 2026
Builds on6
- Sanctum: Minimal Hardware Extensions for Strong Software IsolationVictor Costan, Ilia A. Lebedev, Srinivas DevadasUSENIX Security 2016 · 649 citations
- Doubly-Efficient zkSNARKs Without Trusted SetupRiad S. Wahby, Ioanna Tzialla, Abhi Shelat, Justin Thaler et al.S&P 2018 · 356 citations
- Elle: Inferring Isolation Anomalies from Experimental ObservationsPeter Alvaro, Kyle KingsburyVLDB 2021 · 88 citations
- Cobra: Making Transactional Key-Value Stores Verifiably SerializableCheng Tan, Changgeng Zhao, Shuai Mu, Michael WalfishOSDI 2020 · 61 citations
- Proving as fast as computing: succinct arguments with constant prover overheadNoga Ron-Zewi, Ron D. RothblumSTOC 2022 · 23 citations
Related papers
- VeriTxn: Verifiable Transactions for Cloud-Native Databases with Storage DisaggregationZhanhao Zhao, Hexiang Pan, Gang Chen, Xiaoyong Du et al.SIGMOD 2024 · 8 citations
- GlassDB: An Efficient Verifiable Ledger Database System Through TransparencyCong Yue, Tien Tuan Anh Dinh, Zhongle Xie, Meihui Zhang et al.VLDB 2023 · 26 citations
- qedb: Expressive and Modular Verifiable Databases (without SNARKs)Vincenzo Botta, Simone Bottoni, Matteo Campanelli, Emanuele Ragnoli et al.CCS 2026 · 3 citations
- Differentially Testing Database Transactions for Fun and ProfitZiyu Cui, Wensheng Dou, Qianwang Dai, Jiansen Song et al.ASE 2022 · 22 citations
- VeriDB: An SGX-based Verifiable DatabaseWenchao Zhou, Yifan Cai, Yanqing Peng, Sheng Wang et al.SIGMOD 2021 · 52 citations
