Publicly verifiable secret sharing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1070, Issue , 1996, Pages 190-199

  Stadler, Markus ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ELGAMAL; NEW APPLICATIONS; PAYMENT SYSTEMS; PUBLICLY VERIFIABLE SECRET SHARING; REVOCABLE ANONYMITY; SECRET SHARING SCHEMES; SPECIAL PROPERTIES; VERIFIABLE SECRET SHARING;

CRYPTOGRAPHY;

EID: 84947917119     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68339-9_17     Document Type: Conference Paper

References (21)

1. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for noncryptographic fault-tolerant distributed computation. In20th Annual Symposium on the Theory of Computing (STOC), pages 1-10, 1988.
2. B. Blakley. Safeguarding cryptographic keys. InProceedings of the National Computer Conference 1979, volume 48 ofAmerican Federation of Information Processing Societies Proceedings, pages 313-317, 1979.
3. S Brands. An efficient off-line electronic cash system based on the representation problem. Technical Report CS-R9323, CWI, Amsterdam, 1993.
4. G. Brassard, D. Chaum, and C. Crépeau. Minimum disclosure proofs of knowledge.Journal of Computer and System, Sciences, 37(2):156-189, Oct. 1988.
5. E. Brickell, P. Gemmell, and D. Kravitz. Trustee-based tracing extensions to anonymous cash and the making of anonymous change. InProceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 457-466. ACM, 1995.
6. J. Camenisch, J.-M. Piveteau, and M. Stadler. An Efficient Fair Payment System. To appear inProc. 3rd ACM Conference on Computer and Communications Security, 1996.
7. B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch. Verifiable secret sharing and achieving simultaneity in the presence of faults. InProceedings of the 26th IEEE Symposium on the Foundations of Computer Science (FOCS), pages 383-395, 1985.
8. W. Diffie and M. Heilman. New directions in cryptography.IEEE Transactions on Information Theory, IT-22(6):644-654, November 1976.
9. T. ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms.IEEE Transactions on Information Theory, IT-31(4):469 472, July 1985.
10. U. Feige, A. Fiat, and A. Shamir. Zero-knowledge proofs of identity.Journal of Cryptology, 1:77-94, 1988.
11. P. Feldman. A practical scheme for non-interactive verifiable secret sharing. InProceedings of the 28th IEEE Symposium on Foundations of Computer Science (FOCS), pages 427-437, 1987.
12. A. Fiat and A. Shamir. How to prove yourself: Practical solution to identification and signature problems. InAdvances in Cryptology-CRYPTO'86, volume 263 ofLecture Notes in Computer Science, pages 186-194. Springer-Verlag, 1987.
13. S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof-systems. InProc. 17th ACM Symposium on Theory of Computing (STOC), pages 291-304, 1985.
14. L. Guillou and J.-J. Quisquater. A practical zero-knowledge protocol fitted to security microprocessor minimizing both transmission and memory. InAdvances in Cryptology - EUROCRYPT'88, volume 330 ofLecture Notes in Computer Science, pages 123-128. Springer-Verlag, 1988.
15. M. Jakobsson and M. Yung. Revokable and Versatile Electronic Money. To appear inProc. 3rd ACM Conference on Computer and Communications Security, 1996.
16. S. Micali. Fair cryptosystems. Technical Report TR-579.b, MIT, November 1993.
17. NIST. Clipper chip technology, 30 April 1993.
18. T. Pedersen. Distributed provers with applications to undeniable signatures. InAdvances in Cryptology - EUROCRYPT'91, volume 547 ofLecture Notes in Computer Science, pages 221-242. Springer-Verlag, 1992.
19. C. Schnorr. Efficient identification and signature for smart cards. InAdvances in Cryptology-CRYPTO'89, volume 435 ofLecture Notes in Computer Science, pages 239-252. Springer-Verlag, 1990.
20. A. Shamir. How to share a secret.Communications of the ACM, 22(11):612 613, 1979.
21. M. Stadler, J.-M. Piveteau, and J. Camenisch. Fair blind signatures. InAdvances in Cryptology-EUROCRYPT'95, volume 921 ofLecture Notes in Computer Science, pages 209-219. Springer-Verlag, 1995.