. It was claimed that unconditionally secure quantum bit commitment is impossible due to quantum-computer-assisted-entanglement-attack Recently we have shown that quantum computer-assisted-entanglement-attack can be totally foiled by entanglement and quantum computer. Here we present an alternative un-entanglement based quantum bit commitment scheme. Although the scheme is unconditionally secur...

Three perspectives on delegation in the European Union are presented in this article. The transactioncosts perspective focuses on information asymmetries between policy makers and implementers. According to the commitment perspective, policy makers delegate authority as a solution to commitment problems. The consensus-building perspective views the decision to delegate as a trade-off between de...

The main focus of this chapter is to explore the concept “organisational commitment”. The discussion includes the following aspects: theoretical background; definition of the concept; adopted model for this study, dimensions of organisational commitment; development of organisational commitment; factors affecting the employees’ commitment; the effects of commitment; and the management of organi...

I give a simple proof that it is impossible to guarantee the classicality of inputs into any mistrustful quantum cryptographic protocol. The argument illuminates the impossibility of unconditionally secure quantum implementations of essentially classical tasks such as bit commitment with a certified classical committed bit, classical oblivious transfer, and secure classical multi-party computat...

In recent years, several organizations have implemented nonmandatory information and communication systems that escape the conventional behavioral logic of understanding acceptance and usage from a normative perspective of compliance with the beliefs of others. Because voluntary systems require users’ volitional behavior, researchers have traced recent implementation failures to a lack of user ...

A new relativistic quantum protocol is proposed allowing to implement the bit commitment scheme. The protocol is based on the idea that in the relativistic case the field propagation to the region of space accessible to measurement requires, contrary to the non-relativistic case, a finite non-zero time which depends on the structure of the particular state of the field. In principle, the secret...

In order to support both traditional short transaction and long cooperative transactions, we propose a novel timestamp ordering approach. With this timestamp ordering method, short transactions can be processed in the traditional way, as if there are no cooperative transactions, therefore not be blocked by long transactions; cooperative transactions will not be aborted when there is a conflict ...

Recently, Choi et al. proposed an assumption on Mayers-Lo-Chau (MLC) no-go theorem that 8 the state of the entire quantum system is invariable to both participants before the unveiling phase. 9 This means that the theorem is only applicable to static quantum bit commitment (QBC). This 10 paper find that the assumption is unnecessary and the MLC no-go theorem can be applied to not 11 only static...

We present new constructions of non-malleable commitment schemes, in the public parameter model (where a trusted party makes parameters available to all parties), based on the discrete logarithm or RSA assumptions. The main features of our schemes are: they achieve near-optimal communication for arbitrarily-large messages and are non-interactive. Previous schemes either required (several rounds...