Reducibility and completeness in multi-party private computations
- 17 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 478-489
- https://doi.org/10.1109/sfcs.1994.365743
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- Fair Computation of General Functions in Presence of Immoral MajorityPublished by Springer Nature ,2001
- On the structure of the privacy hierarchyJournal of Cryptology, 1994
- Privacy and Communication ComplexitySIAM Journal on Discrete Mathematics, 1992
- A Zero-One Law for Boolean PrivacySIAM Journal on Discrete Mathematics, 1991
- A zero-one law for Boolean privacyPublished by Association for Computing Machinery (ACM) ,1989
- Privacy and communication complexityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Achieving oblivious transfer using weakened security assumptionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- How to play ANY mental gamePublished by Association for Computing Machinery (ACM) ,1987
- How to generate and exchange secretsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- A randomized protocol for signing contractsCommunications of the ACM, 1985