Search Key Substitution in the Encipherment of B-Trees
Summary: Proposes search-key substitution in enciphered B-Trees using block designs to disguise keys while data and pointers stay encrypted, preventing tree leakage. Reduces traversal decryptions and secret-state, applicable to other layouts. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 0 of 0 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,047 | On B-tree Indices for Skewed Distributions | 1992 | VLDB | 0.00012541035 |
| 12,852 | New Concurrency Control Algorithms for Accessing and Compacting B-Trees | 1994 | VLDB | 5.1725167e-05 |
| 14,361 | On B-Trees: Routing Schemes And Concurrency | 1980 | SIGMOD | - |
| 10,380 | B-Trees Are Back: Engineering Fast and Pageable Node Layouts | 2025 | SIGMOD | 5.1725167e-05 |
| 458 | Concurrent Operations on B-Trees with Overtaking | 1985 | PODS | 0.00018183346 |
| 9,856 | Performance Guarantees for B-trees with Different-Sized Atomic Keys | 2010 | PODS | 5.2587253e-05 |
| 8,812 | Compact O-Complete Trees | 1988 | VLDB | 5.4311425e-05 |
| 9,405 | Revisiting B-tree Compression: An Experimental Study | 2024 | SIGMOD | 5.3341578e-05 |
| 6,354 | Efficient Search of Multidimensional B-Trees | 1995 | VLDB | 5.9660335e-05 |
| 14,362 | Multi-Table Search For B-Tree Files | 1979 | SIGMOD | - |