论文信息 - Cryptographic Capsules: A Disjunctive Primative for Interactive Protocols

Cryptographic Capsules: A Disjunctive Primative for Interactive Protocols

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.

Josh Benaloh | Josh Benaloh

[1] Gilles Brassard,et al. Zero-Knowledge Simulation of Boolean Circuits , 1986, CRYPTO.

[2] Silvio Micali,et al. Proofs that yield nothing but their validity and a methodology of cryptographic protocol design , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[3] Josh Benaloh,et al. Secret Sharing Homomorphisms: Keeping Shares of A Secret Sharing , 1986, CRYPTO.

[4] Moti Yung,et al. A private interactive test of a boolean predicate a minimum-knowledge public-key cryptosystems , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[5] Andrew Chi-Chih Yao,et al. Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[6] Michael J. Fischer,et al. A robust and verifiable cryptographically secure election scheme , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[7] Moti Yung,et al. Distributing the power of a government to enhance the privacy of voters , 1986, PODC '86.

[8] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.

[9] Andrew Chi-Chih Yao,et al. Theory and Applications of Trapdoor Functions (Extended Abstract) , 1982, FOCS.

[10] David Chaum,et al. Demonstrating That a Public Predicate Can Be Satisfied Without Revealing Any Information About How , 1986, CRYPTO.

[11] Josh D. Cohen,et al. Improving Privacy in Cryptographic Elections , 1986 .