DCR (safe-prime moduli) ⇒ Universal-2 HPS

Fully-black-box reduction · standard model · CS02

Statement

If DCR is hard for safe-prime moduli , there is a universal-2 hash proof system for a subset membership problem in whose hardness follows from DCR — CS02. The system is universal-2 up to approximation: CS02 obtain it from ideal smooth and universal-2 families by sampling keys from an efficiently sampleable key set in place of the ideal one, at negligible statistical distance, so its key approximation error is negligible but not — CS02.

Notes