Secure Commitment Against A Powerful Adversary - A security primitive based on average intractability (Extended Abstract) (1992)
| Citations: | 13 - 5 self |
BibTeX
@MISC{Ostrovsky92securecommitment,
author = {Rafail Ostrovsky and Ramarathnam Venkatesan and Moti Yung},
title = {Secure Commitment Against A Powerful Adversary - A security primitive based on average intractability (Extended Abstract)},
year = {1992}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Secure commitment is a primitive enabling information hiding, which is one of the most basic tools in cryptography. Specifically, it is a two-party partial-information game between a "committer" and a "receiver", in which a secure envelope is first 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 Technology Square, Cambridge MA 02139, USA. Supported by IBM Graduate Fellowship. Part of this work done while at IBM T.J. W...
