Secure Commitment Against A Powerful Adversary

abstract Rafail Ostrovskyy Ramarathnam Venkatesanz Moti Yungx Secure commitment is a primitive enabling information hiding, which is one of the most basic tools in cryptography. Speci cally, it is a two-party partial-information game between a committer" and a receiver", in which a secure envelope is rst implemented and later opened. The committer has a bit in mind which he commits to by putting it in a secure envelope". The receiver cannot guess what the value is until the opening stage and the committer can not change his mind once committed. In this paper, we investigate the feasibility of bit commitment when one of the participants either committer or receiver has an unfair computational advantage. That is, we consider commitment to a strong receiver with a To appear in Symposium on Theoretical Aspects of Computer Science STACS 92, February 13-15, Paris, France. y MIT Laboratory for Computer Science, 545 TechnologySquare, CambridgeMA 02139,USA. Supported by IBM Grad...

• Type: Conference
• Year: 1992
• Where: STACS
• Authors: Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung
• Keywords: Committer, STACS 1992, Strong Committer, Strong Receiver, Theoretical Computer Science