Publicly Veriiable Secret Sharing

A secret sharing scheme allows to share a secret among several participants such that only certain groups of them can recover it. Veriiable secret sharing has been proposed to achieve security against cheating participants. Its rst realization had the special property that everybody, not only the participants, can verify that the shares are correctly distributed. We will call such schemes publicly veriiable secret sharing schemes, we discuss new applications to escrow cryptosystems and to payment systems with revocable anonymity, and we present two new realizations based on ElGamal's cryptosystem.

[1]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[2]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[3]  G. R. BLAKLEY.  Safeguarding cryptographic keys , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[4]  Taher ElGamal,et al.  A public key cyryptosystem and signature scheme based on discrete logarithms , 1985 .

[5]  Silvio Micali,et al.  The knowledge complexity of interactive proof-systems , 1985, STOC '85.

[6]  Baruch Awerbuch,et al.  Verifiable secret sharing and achieving simultaneity in the presence of faults , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[7]  Amos Fiat,et al.  How to Prove Yourself: Practical Solutions to Identification and Signature Problems , 1986, CRYPTO.

[8]  Paul Feldman,et al.  A practical scheme for non-interactive verifiable secret sharing , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[9]  Jean-Jacques Quisquater,et al.  A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and Memory , 1988, EUROCRYPT.

[10]  Avi Wigderson,et al.  Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.

[11]  Torben P. Pedersen.  Distributed Provers with Applications to Undeniable Signatures , 1991, EUROCRYPT.

[12]  S. Brands.  An Efficient Off-line Electronic Cash System Based On The Representation Problem. , 1993 .

[13]  S. Micali.  Fair cryptosystems , 1994 .

[14]  Ernest F. Brickell,et al.  Trustee-based tracing extensions to anonymous cash and the making of anonymous change , 1995, SODA '95.

[15]  Jan Camenisch,et al.  Fair Blind Signatures , 1995, EUROCRYPT.

[16]  Markus Jakobsson,et al.  Revokable and versatile electronic money (extended abstract) , 1996, CCS '96.

[17]  Markus Stadler,et al.  An Eecient Fair Payment System , 1996 .