BACKGROUND The findings of a repressed expression of emotions in cancer patients contributed to the hypothesis developed by Lydia Temoshok of a type C personality ('cancer-prone'). To the Authors' knowledge, the associations between the 'cancer-prone personality' characteristics in commitment test and the risk of breast cancer (BC) have rarely been considered together in a prospective study. ...

various studies have been conducted to study the relationship between job involvement and organizational citizenship behavior but a very little work have been done to study the impact of both job involvement and organizational commitment on “organizational citizenship behavior”. thus the purpose of the study is to find out the relationship between job involvement, organizational commitment and ...

We consider non-cooperative environments in which two players have the power to commit but cannot sign binding agreements. We show that by committing to a set of actions rather than to a single action, players can implement a wide range of action profiles. We give a complete characterization of implementable profiles and provide a simple method to find them. Profiles implementable by bilateral ...

We often use the term ‘commitment’ to make claims of apparent normative import. An ontologically scrupulous philosopher says that she cannot accept a certain principle because it would commit her to abstracta. A conscientious friend says that he’d like to make your party but feels bound by a prior commitment. A campaigning politician says that she’s the only candidate who’s really committed to ...

The relativistic quantum protocols realizing the bit commitment and distant coin tossing schemes are proposed. The protocols are based on the fact that the non-stationary orthogonal extended quantum states cannot be reliably distinguished if they are not fully accessible for the measurement. As the states propagate from the domain controlled by one of the user to the domain accessible for the m...

We explicitly show the upper bound on the round complexity for perfectly concealing bit commitment schemes based on the general computational assumption. The best known scheme in the literature is the one-way permutation based scheme due to Naor, Ostrovsky, Venkatesan and Yung and its round complexity is O(n). We consider a naive parallel version of their scheme of the multiplicity logn and obt...

Commitment schemes are arguably among the most important and useful primitives in cryptography. According to the computational power of receivers, commitments can be classified into three possible types: computational hiding commitments, statistically hiding commitments and perfect computational commitments. The fist commitment with constant rounds had been constructed from any one-way function...

In this work, we present a generic yet practical transformation from any public-coin honest-verifier zero-knowledge (HVZK) protocols to normal zero-knowledge (ZK) arguments. By “generic”, we mean that the transformation is applicable to any public-coin HVZK protocol under any one-way function (OWF) admitting Σ-protocols. By “practical” we mean that the transformation does not go through general...