DBDH ⇒ Binary tree encryption (Canetti–Halevi–Katz)
Statement
If DBDH is hard in a symmetric pairing group, then there is a selective-node-secure binary tree encryption scheme in the standard model: CHK03 construct a pairing-based binary tree encryption scheme and prove it selective-node secure under DBDH — CHK03.