Advertisement

Non-Interactive Oblivious Transfer and Applications

  • Mihir Bellare
  • Silvio Micali
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 435)

Abstract

We show how to implement oblivious transfer without interaction, through the medium of a public file. As an application we can get non-interactive zero knowledge proofs via the same public file.

Keywords

Hamiltonian Cycle Random String Oblivious Transfer Permute Graph Zero Knowledge 
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

  1. [BG]
    Bellare, M., and S. Goldwasser, “A New Paradigm for Digital Signataures and Message Authentication based on Non-Interactive Zero Knowledge Proofs,” CRYPTO 89.Google Scholar
  2. [BeMi]
    Bellare, M., and S. Micali, “How to Sign Given Any Trapdoor Function,” STOC 88.Google Scholar
  3. [BGW]
    Ben-Or, M., S. Goldwasser, and A. Wigderson, “Completeness Theorem for Non-Cryptographic Fault Tolerant Distributed Computing,” STOC 88.Google Scholar
  4. [BlMi]
    Blum, M., and S. Micali, “How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits,” SIAM Journal on Computing, Vol. 13, No. 4 (November 1984), 850–864.zbMATHCrossRefMathSciNetGoogle Scholar
  5. [BCR]
    Brassard, G., C. Crépeau, and J.-M. Robert, “Information Theoretic Reductions among Disclosure Problems,” FOCS 86.Google Scholar
  6. [BFM]
    Blum, M., P. Feldman and S. Micali, “Non-Interactive Zero Knowledge and its Applications,” STOC 88.Google Scholar
  7. [CCD]
    Chaum, D., C. Crépeau and I. Damgård, “Multiparty Unconditionally Secure Protocols,” STOC 88.Google Scholar
  8. [GHY]
    Galil, Z., S. Haber and M. Yung, “Cryptographic Computation: Secure Fault-Tolerant Protocols and the Public Key Model,” CRYPTO 87.Google Scholar
  9. [GM]
    Goldwasser, S., and S. Micali, “Probabilistic Encryption,” Journal of Computer and System Sciences 28 (April 1984), 270–299.Google Scholar
  10. [GL]
    Goldreich, O. and L. Levin, “A Hard-Core Predicate for any One-Way Function,” STOC 89.Google Scholar
  11. [GMW]
    Goldreich, O., S. Micali and A. Wigderson, “A Completeness Theorem for Protocols with Honest Majority,” STOC 87.Google Scholar
  12. [Kl]
    Kilian, J., “Founding Cryptography on Oblivious Transfer,” STOC 88.Google Scholar
  13. [K2]
    Kilian, J., personal communication.Google Scholar
  14. [KMO]
    Kilian, J., S. Micali and R. Ostrovsky, “Efficient Zero Knowledge Proofs with Bounded Interaction,” CRYPTO 89.Google Scholar
  15. [M]
    Micali, S., personal communication, March 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Mihir Bellare
    • 1
  • Silvio Micali
    • 1
  1. 1.MIT Laboratory for Computer ScienceCambridge

Personalised recommendations