Exploring the limits of common coins using frontier analysis of protocols

DOI10.1007/978-3-642-19571-6_29zbMATH Open1291.94124OpenAlexW1533811646MaRDI QIDQ3000558FDOQ3000558

Authors: Hemanta K. Maji, Pichayoot Ouppaphan, Manoj Prabhakaran, Mike Rosulek 

Publication date: 19 May 2011

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.400.8288

Recommendations

• The limits of common coins: further results
• On the power of correlated randomness in secure computation
• Limits of random oracles in secure computation (extended abstract)
• A zero-one law for cryptographic complexity with respect to computational UC security
• Limits on the Usefulness of Random Oracles

Mathematics Subject Classification ID

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

Cited In (3)

• On the structure of unconditional UC hybrid protocols
• The limits of common coins: further results
• Title not available (Why is that?)

This page was built for publication: Exploring the limits of common coins using frontier analysis of protocols

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