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.

• Type: Conference
• Year: 2009
• Where: EUROCRYPT
• Authors: Mihir Bellare, Dennis Hofheinz, Scott Yilek
• Keywords: Binding Commitment Schemes, Cryptography, EUROCRYPT 2009, Key Encryption Schemes, Lossy Encryption