DCR (safe-prime moduli) ⇒ Universal-2 HPS
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
- Composed with Universal-2 HPS ⇒ CCA-secure PKE this is DCR (safe-prime moduli) ⇒ CCA-secure PKE; the DCR- and QR-based schemes of CS02 remain IND-CCA2-secure when the modulus is not a product of safe primes — HK12.
- CS02 build a universal-2 hash proof system from quadratic residuosity in the same way — CS02.