scientific article; zbMATH DE number 4191105

MaRDI QIDQ3210165zbMATHFDO

Authors Richard Cleve

Publication date 1990

zbMATH Keywords

protocolcryptographic problemcontrolled gradual disclosure schemesmulti-party function evaluationtwo-party secret bit exchanging

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Recommendations

• Practical and provably secure release of a secret and exchange of signatures
• Publication:4934739
• Randomness in distribution protocols
• The Round Complexity of Two-Party Random Selection
• An Optimally Fair Coin Toss

Cited in

(7)

• Complete characterization of fairness in secure two-party computation of Boolean functions
• On complete primitives for fairness
• Practical and provably secure release of a secret and exchange of signatures
• \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds
• Partial fairness in secure two-party computation
• A Single Initialization Server for Multi-party Cryptography
• Toward a game theoretic view of secure computation

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3210165)