scientific article; zbMATH DE number 1759773

MaRDI QIDQ4536796zbMATH OpenFDO

Authors Christian Cachin, Jan Camenisch

Publication date 28 July 2002

Mathematics Subject Classification ID

Cryptography (94A60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Efficiently making secure two-party computation fair
• scientific article; zbMATH DE number 2009950
• Partial fairness in secure two-party computation
• Information Security and Privacy
• Optimal fair computation

Cited in

(20)

• On complete primitives for fairness
• Fair Threshold Decryption with Semi-Trusted Third Parties
• Optimally efficient multi-party fair exchange and fair secure multi-party computation
• On the power of an honest majority in three-party computation without broadcast
• scientific article; zbMATH DE number 2009950 (Why is no real title available?)
• Coin-based multi-party fair exchange
• Information Security and Privacy
• Concurrent signatures from a variety of keys
• SoK: communication across distributed ledgers
• Partial fairness in secure two-party computation
• Topics in Cryptology – CT-RSA 2006
• Legally-Enforceable Fairness in Secure Two-Party Computation
• Optimal fair computation
• Partially-Fair Computation from Timed-Release Encryption and Oblivious Transfer
• Legally Fair Contract Signing Without Keystones
• Optimality of a protocol by Feige-Kilian-Naor for three-party secure computation
• Generalizing efficient multiparty computation
• Resource fairness and composability of cryptographic protocols
• Quantum multi-party fair exchange protocol based on three-particle GHZ states
• Escrow protocols for cryptocurrencies: how to buy physical goods using Bitcoin

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 Q4536796)