Mayers, Lo and Chau proved unconditionally secure quantum bit commitment is impossible. It is shown that their proof is valid only for a particular model of quantum bit commitment encoding, in general it does not hold good. A different model of unconditionally secure quantum bit commitment both entanglement and disentanglement-based is presented. Even cheating can be legally proved with some le...

Stereo matching, i.e., the matching by the visual system of corresponding parts of the images seen by the two eyes, is inherently a 2D problem. To gain insights into how this operation is carried out by the visual system, we measured, in human subjects, the reflexive vergence eye movements elicited by the sudden presentation of stereo plaids. We found compelling evidence that the 2D pattern dis...

In this note we simplify the Cramer, Franklin, Schoenmaker and Yung internet voting protocol to the booth setting. In it, objects of the form g 0g x1 1 · · · g xl l (mod q) are used to define an unconditionally hiding commitment scheme. Because of their homomorphic properties they are particularly suited for voting protocols with unconditional privacy. In fact, we show that almost all existing ...

Even though Zero-knowledge has existed for more than 30 years, few generic constructions for Zero-knowledge exist. In this paper we present a new kind of commitment scheme on which we build a novel and efficient Zero-knowledge protocol for circuit satisfiability.

For the efficient and informative coordination of multiple agents, a time-bounded agent negotiation framework is proposed utilizing time-based commitment scheme. By attaching the commitment duration to agent messages, the traditional Contract Net Protocol is extended to a time-bounded environment, thereby giving rise to a Time-Bounded Negotiation Framework (TBNF). The proposed negotiation frame...

A practical efficient receiver deniable encryption scheme based on BCP commitment scheme and idea of Klonowski et al. is proposed in the paper. The analysis of the proposed schemes is also presented.

The desire to obtain an unconditionally secure bit commitment protocol in quantum cryptography was expressed for the rst time thirteen years ago. Bit commitment is suucient in quantum cryptography to realize a variety of applications with unconditional security. In 1993, a quantum bit commitment protocol was proposed together with a security proof. However, a basic aw in the protocol was discov...

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 noninteractive. Previous schemes either required (several rounds ...

Prior approaches [15, 14] to building collusion-free protocols require exotic channels. By taking a conceptually new approach, we are able to use a more digitally-friendly communication channel to construct protocols that achieve a stronger collusion-free property. We consider a communication channel which can filter and rerandomize message traffic. We then provide a new security definition tha...

We show that a language in NP has a zero-knowledge protocol if and only if the language has an “instance-dependent” commitment scheme. An instance-dependent commitment schemes for a given language is a commitment scheme that can depend on an instance of the language, and where the hiding and binding properties are required to hold only on the YES and NO instances of the language, respectively. ...