Fair Secure Two-Party Computation Extended Abstract

@inproceedings{Pinkas2003FairST,
  title={Fair Secure Two-Party Computation Extended Abstract},
  author={Benny Pinkas},
  year={2003}
}
We demonstrate a transformation of Yao’s protocol for secure two-party computation to a fair protocol in which neither party gains any substantial advantage by terminating the protocol prematurely. The transformation adds additional steps before and after the execution of the original protocol, but does not change it otherwise, and does not use a trusted third party. It is based on the use of gradual release timed commitments, which are a new variant of timed commitments, and on a novel use of… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 28 REFERENCES

Semanko, The power of RSA inversion oracles and the security of Chaum’s RSA-based blind signature

  • M. Bellare, C. Namprempre, M. D. Pointcheval
  • scheme, in proc. of Financial Crypto
  • 2001
1 Excerpt

Similar Papers

Loading similar papers…