On Complete Primitives for Fairness
Authors:
- 1 January 2010
- book chapter
- Published by Springer Nature
- p. 91-108
Abstract
No abstract availableKeywords
This publication has 35 references indexed in Scilit:
- Unconditional Byzantine Agreement with good majority2005
- Minimal Complete Primitives for Secure Multi-Party ComputationJournal of Cryptology, 2004
- A Quantitative Approach to Reductions in Secure Computation2004
- Security and Composition of Multiparty Cryptographic ProtocolsJournal of Cryptology, 2000
- Reducibility and Completeness in Private ComputationsSIAM Journal on Computing, 2000
- Practical and provably secure release of a secret and exchange of signaturesJournal of Cryptology, 1995
- On the structure of the privacy hierarchyJournal of Cryptology, 1994
- A Zero-One Law for Boolean PrivacySIAM Journal on Discrete Mathematics, 1991
- A randomized protocol for signing contractsCommunications of the ACM, 1985
- How to exchange (secret) keysACM Transactions on Computer Systems, 1983