The Limits of Common Coins: Further Results

DOI10.1007/978-3-642-25578-6_25zbMath1292.68024OpenAlexW99744536MaRDI QIDQ3104753

Hemanta K. Maji, Manoj Prabhakaran

Publication date: 16 December 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-25578-6_25

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Network protocols (68M12)

Cites Work

• 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
• Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations
• Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security
• Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation
• Semi-honest to Malicious Oblivious Transfer—The Black-Box Way
• Unnamed Item

This page was built for publication: The Limits of Common Coins: Further Results