Sciweavers

Share
EUROCRYPT
2009
Springer

Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening

10 years 11 months ago
Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
The existence of encryption and commitment schemes secure under selective opening attack (SOA) has remained open despite considerable interest and attention. We provide the rst public key encryption schemes secure against sender corruptions in this setting. The underlying tool is lossy encryption. We then show that no non-interactive or perfectly binding commitment schemes can be proven secure with blackbox reductions to standard computational assumptions, but any statistically hiding commitment scheme is secure. Our work thus shows that the situation for encryption schemes is very dierent from the one for commitment schemes.
Mihir Bellare, Dennis Hofheinz, Scott Yilek
Added 24 Nov 2009
Updated 24 Nov 2009
Type Conference
Year 2009
Where EUROCRYPT
Authors Mihir Bellare, Dennis Hofheinz, Scott Yilek
Comments (0)
books