In this paper we propose an optimistic two-party fair exchange protocol which does not rely on a centralized trusted third party. Instead, the fairness of the protocol relies on the honesty of part of the neighbor participants. This new concept, which is based on a generic verifiable secret sharing scheme, is particularly relevant in networks where centralized authority can neither be used on-l...

In this paper, we introduce a new efficient technique allowing to render an off-line e-cash system traceable without need to a trusted party. The main idea is the use of the publicly verifiable secret sharing technique in order to revoke the anonymity of double spending users. The anonymity of honest users is still provided. Security analysis shows that the proposed technique does not undermine...

At Auscrpt’92, Harn and Yang first proposed the conception of (t, n) threshold undeniable signature, in which only subsets with at least t members can represent a group to generate, confirm or disavow a signature. Later, several schemes are proposed, but none of them is secure. So up to now, how to design a secure (t, n) threshold undeniable signature scheme is remained an open problem. In this...

A publicly verifiable secret sharing (PVSS) scheme is a verifiable secret sharing scheme with the property that the validity of the shares distributed by the dealer can be verified by any party; hence verification is not limited to the respective participants receiving the shares. We present a new construction for PVSS schemes, which compared to previous solutions by Stadler and later by Fujisa...

Abs t rac t . A publicly verifiable secret sharing (PVSS) scheme, named by Stadler in [Sta96], is a special VSS scheme in which anyone, not only the shareholders, can verify that the secret shares are correctly distributed. The property of public verifiability is what the first proposed VSS scheme [CGMA85] incorporated but later protocols [GMW87, Fe187, Ped911 failed to include. PVSS can provid...

A publicly verifiable secret sharing (PVSS) scheme, proposed by Stadler in [Sta96], is a VSS scheme in which anyone, not only the shareholders, can verify that the secret shares are correctly distributed. PVSS can play essential roles in the systems using VSS. Achieving simultaneously the following two features for PVSS is a challenging job: – Efficient non-interactive public verification. – Pr...

Secret sharing allows split control over the secret. Secret parts known as secret shares are distributed to different shareholders (locations). Secret can be recovered upon combination of sufficient number of shares. Research into theoretical foundations, development of widespread applications, as well as, new attacks resulted in great need for extra features of existing schemes. We describe ex...

When a client uses the service which is offered by cloud storage providers, he might worry about how to retrieve their original files securely. Relieving client’s storage burden and successfully retrieving data on demand are the ultimate purposes of cloud storage service. To achieve the above two aims, in this paper we propose a specific way to store and retrieve the out stored data in cloud st...

Using multiple linear of multilinear map, we propose a simple, non-interactive and effective publicly verifiable secret sharing (PVSS) scheme based on multilinear DiffieHellman assumption (MDH). Up to now, the publicly verifiable of secret sharing is still an issue. In this paper, we set the sharing secret is a multiple linear pairing, we apply the multiple linear property of multilinear map fo...