Cryptology City

Cryptology City
Home

❯

Reductions

❯

DBDH ⇒ Binary tree encryption (Canetti–Halevi–Katz)

Nov 21, 2026

DBDH ⇒ Binary tree encryption (Canetti–Halevi–Katz)

Fully-black-box reduction · standard model · CHK03

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.


Graph View

  • DBDH ⇒ Binary tree encryption (Canetti–Halevi–Katz)
  • Statement

Backlinks

  • Bilinear map assumptions
  • Hierarchical identity-based encryption
  • DBDH ⇒ Forward-secure PKE (Canetti–Halevi–Katz)

Created with Quartz v4.5.2 © 2026

  • GitHub
  • Bluesky