Fair Secure Two-Party Computation
- 13 May 2003
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- A fair and efficient solution to the socialist millionaires’ problemDiscrete Applied Mathematics, 2001
- Proofs of Partial Knowledge and Simplified Design of Witness Hiding ProtocolsPublished by Springer Science and Business Media LLC ,2001
- Controlled Gradual Disclosure Schemes for Random Bits and Their ApplicationsPublished by Springer Science and Business Media LLC ,2001
- Optimistic Fair Secure ComputationLecture Notes in Computer Science, 2000
- Timed CommitmentsLecture Notes in Computer Science, 2000
- Verifiable partial key escrowPublished by Association for Computing Machinery (ACM) ,1997
- A fair protocol for signing contractsIEEE Transactions on Information Theory, 1990
- Multiparty computation with faulty majorityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- A Simple Unpredictable Pseudo-Random Number GeneratorSIAM Journal on Computing, 1986
- How to exchange (secret) keysACM Transactions on Computer Systems, 1983