Cryptology ePrint Archive: Report 2004/053

Efficient and Universally Composable Committed Oblivious Transfer and Applications

Juan Garay and Philip MacKenzie and Ke Yang

Abstract: Committed Oblivious Transfer (COT) is a useful cryptographic primitive that combines the functionalities of bit commitment and oblivious transfer. In this paper, we introduce an extended version of COT (ECOT) which additionally allows proofs of relations among committed bits, and we construct an efficient protocol that securely realizes an ECOT functionality in the universal-composability (UC) framework in the common reference string (CRS) model. Our construction is more efficient than previous (non-UC) constructions of COT, involving only a constant number of exponentiations and communication rounds. Using the ECOT functionality as a building block, we construct efficient UC protocols for general two-party and multi-party functionalities (in the CRS model), each gate requiring a constant number of ECOT's.

Category / Keywords: public-key cryptography / oblivious transfer, bit commitment, uni

Publication Info: An extended abstract of this paper appeared in the Proceedsing of the first Theory of Cryptography Conference, 2004.

Date: received 22 Feb 2004, last revised 23 Feb 2004

Contact author: yangke at cs cmu edu

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20040223:210558 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]