1. N. Alon, Z. Galil, and M. Yung. Efficient dynamic-resharing “verifiable secret sharing” against mobile adversary. In P. G. Spirakis, editor, Algorithms–ESA '95, Third Annual European Symposium, Proceedings (Lecture Notes in Computer Science 979) 523–537. Springer-Verlag, 1995. Corfu, Greece, September 25–27.
2. F. Bao, R. Deng, Y. Han, and A. Jeng. Design and analysis of two basic protocols for use in ttp-based key escrow. In V. Varadharajan, J. Pieprzyk, and Y. Mu, editors, Information Security and Privacy, Second Australian Conference, ACIS-P '97, (Lecture Notes in Computer Science 1270), pp. 261–270. Springer-Verlag, 1997. Sydney, NSW, Australia, July 7–9.
3. A. Beimel, M. Burmester, Y. Desmedt, and E. Kushilevitz. Computing functions of a shared secret. Manuscript, 1995.
4. M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson. Multi-prover interactive proofs: How to remove intractability assumptions. In Proceedings of the twentieth annual ACM Symp. Theory of Computing, STOC, pp. 113–131, May 2–4, 1988.
5. J. C. Benaloh. Secret sharing homomorphisms: Keeping shares of a secret secret. In A. Odlyzko, editor, Advances in Cryptology, Proc. of Crypto '86 (Lecture Notes in Computer Science 263), pp. 251–260. Springer-Verlag, 1987. Santa Barbara, California, U.S.A., August 11–15.