Resource fairness and composability of cryptographic protocols

DOI10.1007/S00145-010-9080-ZzbMATH Open1251.94030OpenAlexW2037285013MaRDI QIDQ656919FDOQ656919

Authors: Juan Garay, Manoj Prabhakaran, Ke Yang, Philip MacKenzie 

Publication date: 13 January 2012

Published in: Journal of Cryptology (Search for Journal in Brave)

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

Recommendations

• Theory of Cryptography
• An optimistic fair exchange protocol and its security in the universal composability framework
• Computational hardness of optimal fair computation: beyond Minicrypt
• scientific article; zbMATH DE number 708801
• Complexity-style resources in cryptography
• From fairness to full security in multiparty computation
• From fairness to full security in multiparty computation
• Secure composition of cryptographic protocols. (Abstract)
• Probabilistic termination and composability of cryptographic protocols

zbMATH Keywords

secure multi-party computation

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Security and composition of multiparty cryptographic protocols
• Title not available (Why is that?)
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Foundations of Cryptography
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Complete fairness in secure two-party computation
• Optimistic fair exchange of digital signatures
• Title not available (Why is that?)
• Timed fair exchange of standard signatures (extended abstract)
• Practical and provably secure release of a secret and exchange of signatures
• Partial fairness in secure two-party computation
• An Optimally Fair Coin Toss
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Completely fair SFE and coalition-safe cheap talk
• Advances in Cryptology - EUROCRYPT 2004
• Universally composable two-party and multi-party secure computation
• Title not available (Why is that?)
• Advances in Cryptology - CRYPTO 2003
• Strengthening zero-knowledge protocols using signatures
• General composition and universal composability in secure multiparty computation
• Secure multi-party computation without agreement
• Timed release of standard digital signatures (extended abstract)
• More general completeness theorems for secure two-party computation
• On complete primitives for fairness
• Title not available (Why is that?)
• Detectable Byzantine agreement secure against faulty majorities
• Theory of Cryptography

Cited In (10)

• Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes
• Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era
• Synchronizable fair exchange
• Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles
• How fair is your protocol? A utility-based approach to protocol optimality
• Theory of Cryptography
• \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds
• Proof-of-work-based consensus in expected-constant time
• Fully-secure MPC with minimal trust
• How to use bitcoin to design fair protocols

This page was built for publication: Resource fairness and composability of cryptographic protocols

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