The existence of encryption and commitment schemes secure under selective opening attack (SOA) has remained open despite considerable interest and attention. We provide the first 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 different from the one for commitment schemes. © International Association for Cryptologic Research 2009.
CITATION STYLE
Bellare, M., Hofheinz, D., & Yilek, S. (2009). Possibility and impossibility results for encryption and commitment secure under selective opening. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5479 LNCS, pp. 1–35). https://doi.org/10.1007/978-3-642-01001-9_1
Mendeley helps you to discover research relevant for your work.