On the structure of unconditional UC hybrid protocols

DOI10.1007/978-3-030-03810-6_4zbMath1430.94087OpenAlexW2724550911MaRDI QIDQ1631320

Morgan Shirley, Mike Rosulek

Publication date: 6 December 2018

Full work available at URL: https://doi.org/10.1007/978-3-030-03810-6_4

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

Computational hardness of optimal fair computation: beyond Minicrypt

Cites Work

• Unnamed Item
• Unnamed Item
• Secure two-party computation with fairness -- a necessary design principle
• A Unified Characterization of Completeness and Triviality for Secure Function Evaluation
• Completeness Theorems with Constructive Proofs for Finite Deterministic 2-Party Functions
• Exploring the Limits of Common Coins Using Frontier Analysis of Protocols
• More general completeness theorems for secure two-party computation
• A Zero-One Law for Cryptographic Complexity with Respect to Computational UC Security
• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
• Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations
• Founding Cryptography on Oblivious Transfer – Efficiently
• Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation
• Lower Bounds for Oblivious Transfer Reductions
• A Full Characterization of Completeness for Two-Party Randomized Function Evaluation
• Theory of Cryptography

This page was built for publication: On the structure of unconditional UC hybrid protocols