Efficient and adaptively secure cryptographic primitives---designing for composability

Date of Completion

January 2010

Keywords

Engineering, Computer|Computer Science

Degree

Ph.D.

Abstract

We study efficient protocol constructions against adaptive corruption in the universal composition framework. For standard cryptographic tasks, we propose a new framework to design efficiently two-party secure function evaluation protocols, and then apply it to oblivious transfer and obtain the first practical such constructions. Regarding reactive cryptographic tasks, we present a framework for designing blind signatures, and construct the first practical protocols for this task. ^

Share

COinS