Article thumbnail

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

By Hong-Sheng Zhou

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.

Topics: Engineering, Computer|Computer Science
Publisher: OpenCommons@UConn
Year: 2010
OAI identifier: oai:opencommons.uconn.edu:dissertations-5248
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://gateway.proquest.com/op... (external link)
  • https://opencommons.uconn.edu/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.