Somewhat Non-Committing Encryption and Efficient Adaptively Secure Oblivious Transfer

Free registration required

Executive Summary

Designing efficient cryptographic protocols tolerating adaptive adversaries, who are able to corrupt parties on the fly as the computation proceeds, has been an elusive task. Indeed, thus far no efficient protocols achieve adaptive security for general multi-party computation, or even for many specific two-party tasks such as Oblivious Transfer (OT). In fact, it is difficult and expensive to achieve adaptive security even for the task of secure communication, which is arguably the most basic task in cryptography. In this paper the authors make progress in this area. First, they introduce a new notion called semi-adaptive security which is slightly stronger than static security but significantly weaker than fully adaptive security.

  • Format: PDF
  • Size: 917.1 KB