Partially-Fair Computation from Timed-Release Encryption and Oblivious Transfer

DOI10.1007/978-3-030-90567-5_17zbMath1521.68052MaRDI QIDQ6488390

Peter Y. A. Ryan, Geoffroy Couteau, A. W. Roscoe

Publication date: 13 April 2023

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Privacy of data (68P27)

Related Items (1)

CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Round-optimal password-based authenticated key exchange
• Partial fairness in secure two-party computation
• TARDIS: a foundation of time-lock puzzles in UC
• Honey Encryption Beyond Message Recovery Security
• New Techniques for SPHFs and Efficient One-Round PAKE Protocols
• How to Use Bitcoin to Design Fair Protocols
• Quasi-Adaptive NIZK for Linear Subspaces Revisited
• Partial Fairness in Secure Two-Party Computation
• Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
• A Framework for Efficient and Composable Oblivious Transfer
• Usable Optimistic Fair Exchange
• Information Security and Privacy
• Legally-Enforceable Fairness in Secure Two-Party Computation
• Completely fair SFE and coalition-safe cheap talk
• Optimistic Fair Exchange in a Multi-user Setting

This page was built for publication: Partially-Fair Computation from Timed-Release Encryption and Oblivious Transfer