6 Conclusions
The method of cryptographic capsules, especially (but not exclusively) when combined with residue classes, seems to be a powerful tool with many applications. This simple tool makes possible several protocols which would be impractical or completely impossible without them. In addition, several previously published protocols can be significantly simplified by the use of capsules.
It is believed that capsules may have many applications which go well beyond those described here, and they may become a standard tool in the design of interactive protocols.
This work was supported in part by the National Security Agency under Grant MDA904-84-H-0004.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Benaloh, J. “Secret Sharing Homomorphisms: Keeping Shares of a Secret Secret.” Crypto’ 86, Santa Barbara, CA (Aug. 1986).
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.
Brassard, G. and Crepeau, C. “Zero-Knowledge Simulation of Boolean Circuits.” Crypto’ 86, Santa Barbara, CA (Aug. 1986).
Chaum, D. “Demonstrating that a Public Predicate can be Satisfied Without Revealing Any Information About How.” Crypto’ 86, Santa Barbara, CA (Aug. 1986).
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.
Cohen, J. “Improving Privacy in Cryptographic Elections.” TR-454, Yale University, Department of Computer Science, New Haven, CT (Feb. 1986).
Fischer, M., Micali, S., and Rackoff, C. “A Secure Protocol for the Oblivious Transfer.” Presented at Eurocrypt84, Paris, France (Apr. 1984). (Not in proceedings.)
Galil, Z., Haber, S., and Yung, M. “A Private Interactive Test of a Boolean Predicate and Minimum-Knowledge Public-Key Cryptosystems.” Proc. 26thIEEE Symp. on Foundations of Computer Science, Portland, OR (Oct. 1985), 372–382.
Goldwasser, S. and Micali, S. “Probabilistic Encryption.” J. Comput. System Sci. 28,2 (Apr. 1984), 270–299.
Goldwasser, S., Micali, S., and Rackoff, C. “The Knowledge of Complexity of Interactive Proof-Systems.” Proc. 17thACM Symp. on Theory of Computing, Providence, RI (May 1985), 291–304.
Goldreich, O., Micali, S., and Wigderson, A. “Proofs that Yield Nothing But their Validity and a Methodology of Cryptographic Protocol Design.” Proc. 27thIEEE Symp. on Foundations of Computer Science, Toronto, ON (Oct. 1986), 174–187.
Yao, A. “Theory and Applications of Trapdoor Functions.” Proc. 23rdIEEE Symp. on Foundations of Computer Science, Chicago, IL (Nov. 1982), 80–91.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Benaloh, J.C. (1987). Cryptographic Capsules: A Disjunctive Primitive for Interactive Protocols. In: Odlyzko, A.M. (eds) Advances in Cryptology — CRYPTO’ 86. CRYPTO 1986. Lecture Notes in Computer Science, vol 263. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47721-7_15
Download citation
DOI: https://doi.org/10.1007/3-540-47721-7_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18047-0
Online ISBN: 978-3-540-47721-1
eBook Packages: Springer Book Archive