Verifiable secret sharing and achieving simultaneity in the presence of faults
- 1 January 1985
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 383-395
- https://doi.org/10.1109/sfcs.1985.64
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- The Bit Security of Modular Squaring given Partial Factorization of the ModulosPublished by Springer Science and Business Media LLC ,2000
- A randomized protocol for signing contractsCommunications of the ACM, 1985
- The knowledge complexity of interactive proof-systemsPublished by Association for Computing Machinery (ACM) ,1985
- Probabilistic encryptionJournal of Computer and System Sciences, 1984
- Coin flipping by telephone a protocol for solving impossible problemsACM SIGACT News, 1983
- Theory and application of trapdoor functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- How to share a secretCommunications of the ACM, 1979
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978