How to Exchange Half a Bit

  • Tom Tedrick


This paper discusses a method whereby two adversaries can exchange information worth an arbitrarily small “fraction of a bit”, in a particular setting (see [4]), although neither trusts the other.


Oblivious Transfer Distinct Root Provably Secure Significant Chance Computer Science Division 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    R. Berger, H. Karloff, D. Shmoys, “The Crytographic Security of The Sum of Bits”, in preparation.Google Scholar
  2. [2]
    R. Berger, R. Peralta, T. Tedrick, “A Provably Secure Oblivious Transfer”, to be submitted to STOC.Google Scholar
  3. [3]
    L. Blum, M. Blum and M. Shub, “A Simple Secure Pseudo-Random Number Generator”, to appear in SIAM Journal of Computing.Google Scholar
  4. [4]
    M. Blum, “How to Exchange (Secret) Keys”, ACM Transactions on Computer Systems (1983). (1982).Google Scholar
  5. [5]
    M. Blum and S. Micali, “How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits”, 1982 FOCS.Google Scholar
  6. [6]
    M. Luby, S. Micali and C. Rackoff, “The MiRackoLus Exchange of a Secret Bit”, to appear in 1983 FOCS.Google Scholar
  7. [7]
    T. Tedrick, “Advantages of Using Multiple Keys in Public Key Encryption Protocols”, in preparation.Google Scholar
  8. [8]
    U. Vazirani and V. Vazirani, “Trap-door Psuedo-Random Number Number Generators”, to appear in 1983 FOCS.Google Scholar

Copyright information

© Plenum Press, New York 1984

Authors and Affiliations

  • Tom Tedrick
    • 1
  1. 1.Computer Science DivisionUniversity of CaliforniaBerkeleyUSA

Personalised recommendations