1. Benaloh, J. “Secret Sharing Homomorphisms: Keeping Shares of a Secret Secret.” Crypto’ 86, Santa Barbara, CA (Aug. 1986).
2. Benaloh, J. and Yung, M. “Distributing the Power of a Government to Enhance the Privacy of Voters.” Proc. 5thACM Symp. on Principles of Distributed Computing, Calgary, AB (Aug. 1986), 52–62.
3. Brassard, G. and Crepeau, C. “Zero-Knowledge Simulation of Boolean Circuits.” Crypto’ 86, Santa Barbara, CA (Aug. 1986).
4. Chaum, D. “Demonstrating that a Public Predicate can be Satisfied Without Revealing Any Information About How.” Crypto’ 86, Santa Barbara, CA (Aug. 1986).
5. Cohen, J. and Fischer, M. “A Robust and Verifiable Cryptographically Secure Election Scheme.” Proc. 26thIEEE Symp. on Foundations of Computer Science, Portland, OR (Oct. 1985), 372–382.