Resource fairness and composability of cryptographic protocols
From MaRDI portal
Publication:656919
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
- Secure composition of cryptographic protocols. (Abstract)
- Probabilistic termination and composability of cryptographic protocols
Cites work
- scientific article; zbMATH DE number 1808209 (Why is no real title available?)
- scientific article; zbMATH DE number 1186931 (Why is no real title available?)
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- scientific article; zbMATH DE number 503243 (Why is no real title available?)
- scientific article; zbMATH DE number 1162684 (Why is no real title available?)
- scientific article; zbMATH DE number 1942445 (Why is no real title available?)
- scientific article; zbMATH DE number 2009950 (Why is no real title available?)
- scientific article; zbMATH DE number 1759349 (Why is no real title available?)
- scientific article; zbMATH DE number 1759773 (Why is no real title available?)
- scientific article; zbMATH DE number 1759782 (Why is no real title available?)
- scientific article; zbMATH DE number 1842484 (Why is no real title available?)
- scientific article; zbMATH DE number 1848306 (Why is no real title available?)
- scientific article; zbMATH DE number 1394309 (Why is no real title available?)
- scientific article; zbMATH DE number 1406779 (Why is no real title available?)
- scientific article; zbMATH DE number 2204782 (Why is no real title available?)
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - EUROCRYPT 2004
- An Optimally Fair Coin Toss
- Complete fairness in secure two-party computation
- Completely fair SFE and coalition-safe cheap talk
- Detectable Byzantine agreement secure against faulty majorities
- Foundations of Cryptography
- General composition and universal composability in secure multiparty computation
- More general completeness theorems for secure two-party computation
- On complete primitives for fairness
- Optimistic fair exchange of digital signatures
- Partial fairness in secure two-party computation
- Practical and provably secure release of a secret and exchange of signatures
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Secure multi-party computation without agreement
- Security and composition of multiparty cryptographic protocols
- Strengthening zero-knowledge protocols using signatures
- Theory of Cryptography
- Timed fair exchange of standard signatures (extended abstract)
- Timed release of standard digital signatures (extended abstract)
- Universally composable two-party and multi-party secure computation
Cited in
(10)- Theory of Cryptography
- Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era
- Fully-secure MPC with minimal trust
- \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds
- Synchronizable fair exchange
- Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles
- How to use bitcoin to design fair protocols
- Proof-of-work-based consensus in expected-constant time
- Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes
- How fair is your protocol? A utility-based approach to protocol optimality
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)
