Equivalence between two flavours of oblivious transfers

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

Volumn 293 LNCS, Issue , 1988, Pages 350-354

  Crépeau, Claude ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CRYPTOGRAPHIC PROTOCOLS; OBLIVIOUS TRANSFER; PROTOCOL CANS;

CRYPTOGRAPHY;

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

References (5)

1. Brassard G., Crépeau C. and Robert J.-M., “Information Theoretic Reductions Among Disclosure Problems”, Proceedings of the 27th Annual IEEE Symposium on the Foundations of Computer Science, 1986, pp. 168–173.
2. Even S., Goldreich O. and Lempel A., “A randomized Protocol for Signing Contracts”, Communications of the ACM, Vol. 28, No. 6, 1985, pp. 637–647.
3. Goldreich O., Micali S. and Wigderson A., “How To Play Any Mental Game or A Completeness Theorem for Protocols with Honest Majority”. Proceedings of the 19th Annual ACM Symposium on the Theory of Computing, 1987, pp. 218–229.
4. Halpern J. and Rabin M.O., “A Logic to Reason about likehood”, Proceedings of the 15th Annual ACM Symposium on the Theory of Computing, 1983, pp. 310–319.
5. Kranakis, E., “Primality and Cryptography”, John Wiley & Sons, 1986.