Resource fairness and composability of cryptographic protocols
From MaRDI portal
Publication:656919
DOI10.1007/s00145-010-9080-zzbMath1251.94030MaRDI QIDQ656919
Juan A. Garay, Ke Yang, Manoj Prabhakaran, Philip D. 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
94A60: Cryptography
Related Items
Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles, Fully-secure MPC with minimal trust, 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, \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- General composition and universal composability in secure multiparty computation
- Practical and provably secure release of a secret and exchange of signatures
- Security and composition of multiparty cryptographic protocols
- Strengthening zero-knowledge protocols using signatures
- Secure multi-party computation without agreement
- Timed Release of Standard Digital Signatures
- More general completeness theorems for secure two-party computation
- On Complete Primitives for Fairness
- Partial Fairness in Secure Two-Party Computation
- Universally composable two-party and multi-party secure computation
- An Optimally Fair Coin Toss
- Optimistic fair exchange of digital signatures
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Foundations of Cryptography
- Detectable byzantine agreement secure against faulty majorities
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - CRYPTO 2003
- Completely fair SFE and coalition-safe cheap talk
- Computer Aided Verification
- Theory of Cryptography
