How to simultaneously exchange a secret bit by flipping a symmetrically-biased coin
- 1 November 1983
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
We present a cryptographic protocol allowing two mutually distrusting parties, A and B, each having a secret bit, to "simultaneously" exchange the values of those bits. It is assumed that initially each party presents a correct encryption of his secret bit to the other party. We develop a new tool to implement our protocol: a slightly biased symmetric coin. The key property of this coin is that from each flip A receives a piece of probabilistic information about B's secret bit which is symmetric to the piece of information B receives about A's secret bit.Keywords
This publication has 7 references indexed in Scilit:
- How to Exchange Half a BitPublished by Springer Nature ,1984
- How to exchange (secret) keysPublished by Association for Computing Machinery (ACM) ,1983
- On Computationally Secure Authentication Tags Requiring Short Secret Shared KeysPublished by Springer Nature ,1983
- A logic to reason about likelihoodPublished by Association for Computing Machinery (ACM) ,1983
- Protocols for secure computationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Theory and application of trapdoor functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- On distinguishing prime numbers from composite numbersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1980