How to solve any protocol problem - An efficiency improvement

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 293 LNCS, Issue , 1988, Pages 73-86

  Goldrcich, Oded ^a   Vainish, Ronen ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; EFFICIENCY; POLYNOMIAL APPROXIMATION; TURING MACHINES;

DIRECT SOLUTION; EFFICIENCY IMPROVEMENT; OBLIVIOUS TRANSFER; POLYNOMIAL-TIME ALGORITHMS; PRIVACY PROTOCOLS; TWO-PARTY PROTOCOLS;

PROBLEM SOLVING;

EID: 85032194875     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48184-2_6     Document Type: Conference Paper

References (12)

1. Barrington, D.A., “Bounded-Width Polynomial-Size Branching Programs Recognize Exactly Those Languages in NC 1”, Proc. 18th STOC, 1986, pp. 1–5.
2. Chor, B., S. Goldwasser, S. Micali, and B. Awerbuch. “Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults”, Proc. 26th FOCS, 1985, pp. 383–395.
3. Cohen, J.D., “Secret Sharing Homomorphisms: Keeping Shares of a Secret”, technical report YALEU/DCS/TR-453. Yale University, Dept. of Computer Science, Feb. 1986. Presented in Crypto86, 1986.
4. Diffie, W., and M.E. Hellman, “New Directions in Cryptography”, IEEE Tram. on Inform. Theory, Vol. IT-22, No. 6, November 1976, pp. 644–654.
5. Even, S., O. Goldreich, and A. Lempel, “A Randomized Protocol for Signing Contracts”. CACM, Vol. 28. No. 6, 1985. pp. 637–647.
6. Goldreich, O., S. Micali, and A. Wigderson, “Proofs that Yield Nothing But their Validity and a Methodology of Cryptographic Protocol Design”, Proc. 27th FOCS, 1986.
7. Goldreich, O., S. Micali, and A. Wigderson, “How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority”, Proc. 19th STOC, 1987.
8. Goldwasser, S., and S. Micali, “Probabilistic Encryption”, JCSS, Vol. 28, No. 2, 1984, pp. 270–299.
9. Goldwasser, S., S. Micali, and C. Rackoff, “Knowledge Complexity of Interactive Proofs”, Proc. 17th STOC, 1985, pp. 291–304.
10. Haber, S., and S. Micali, private communication, 1986.
11. Yao, A.C., “Theory and Applications of Trapdoor Functions”, Proc. of the 23rd IEEE Symp. on Foundation of computer Science, 1982, pp. 80–91.
12. Yao, A.C., “How to Generate and Exchange Secrets”, Proc. 27th FOCS, 1986.