Abstract
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.
Research sponsored by the National Science Foundation Grant MCS 82–04506
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Berger, H. Karloff, D. Shmoys, “The Crytographic Security of The Sum of Bits”, in preparation.
R. Berger, R. Peralta, T. Tedrick, “A Provably Secure Oblivious Transfer”, to be submitted to STOC.
L. Blum, M. Blum and M. Shub, “A Simple Secure Pseudo-Random Number Generator”, to appear in SIAM Journal of Computing.
M. Blum, “How to Exchange (Secret) Keys”, ACM Transactions on Computer Systems (1983). (1982).
M. Blum and S. Micali, “How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits”, 1982 FOCS.
M. Luby, S. Micali and C. Rackoff, “The MiRackoLus Exchange of a Secret Bit”, to appear in 1983 FOCS.
T. Tedrick, “Advantages of Using Multiple Keys in Public Key Encryption Protocols”, in preparation.
U. Vazirani and V. Vazirani, “Trap-door Psuedo-Random Number Number Generators”, to appear in 1983 FOCS.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1984 Plenum Press, New York
About this chapter
Cite this chapter
Tedrick, T. (1984). How to Exchange Half a Bit. In: Chaum, D. (eds) Advances in Cryptology. Springer, Boston, MA. https://doi.org/10.1007/978-1-4684-4730-9_13
Download citation
DOI: https://doi.org/10.1007/978-1-4684-4730-9_13
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4684-4732-3
Online ISBN: 978-1-4684-4730-9
eBook Packages: Springer Book Archive