Exploring the limits of common coins using frontier analysis of protocols

DOI10.1007/978-3-642-19571-6_29MaRDI QIDQ3000558zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

Cited in

(3)

• On the structure of unconditional UC hybrid protocols
• The limits of common coins: further results
• scientific article; zbMATH DE number 7255566 (Why is no real title available?)

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)