DBScholar

Back to papers

Search Key Substitution in the Encipherment of B-Trees

Summary: Improves Bayer–Metzger encrypted B-trees by disguising search keys while encrypting data/tree pointers, obscuring structure. Combinatorial block-design substitutions reduce traversal decryptions and minimize secret state, with applicability beyond B-trees. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
8122
Venue
VLDB
Year
1990
Pagerank
-
Overall Rank
14,468 | 1.08%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@article{hardjono_vldb90,
        title = {{Search Key Substitution in the Encipherment of B-Trees}},
        author = {Hardjono, Thomas and Seberry, Jennifer},
        journal = {PVLDB},
        series = {{VLDB} '90},
        year = {1990}
}

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
1 1,066 On B-tree Indices for Skewed Distributions 1992 VLDB
2 13,089 New Concurrency Control Algorithms for Accessing and Compacting B-Trees 1994 VLDB
3 14,598 On B-Trees: Routing Schemes And Concurrency 1980 SIGMOD
4 9,849 B-Trees Are Back: Engineering Fast and Pageable Node Layouts 2025 SIGMOD
5 463 Concurrent Operations on B-Trees with Overtaking 1985 PODS
6 10,049 Performance Guarantees for B-trees with Different-Sized Atomic Keys 2010 PODS
7 8,974 Compact O-Complete Trees 1988 VLDB
8 9,560 Revisiting B-tree Compression: An Experimental Study 2024 SIGMOD
9 6,480 Efficient Search of Multidimensional B-Trees 1995 VLDB
10 14,599 Multi-Table Search For B-Tree Files 1979 SIGMOD