Resource fairness and composability of cryptographic protocols
From MaRDI portal
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
- 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
- Fair secure two-party computation
- Foundations of Cryptography
- General composition and universal composability in secure multiparty computation
- 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 2204782 (Why is no real title available?)
- Minimal complete primitives for secure multi-party computation
- More general completeness theorems for secure two-party computation
- Multiparty computation from threshold homomorphic encryption
- Non-interactive and information-theoretic secure verifiable secret sharing
- On complete primitives for fairness
- One-way accumulators: A decentralized alternative to digital signatures
- Optimistic fair exchange of digital signatures. (Extended abstract)
- Optimistic fair secure computation. (Extended abstract)
- Partial fairness in secure two-party computation
- Perfect hiding and perfect binding universally composable commitment schemes with constant expansion factor
- Practical and provably secure release of a secret and exchange of signatures
- Proofs of partial knowledge and simplified design of witness hiding protocols
- Public-key cryptosystems based on composite degree residuosity classes
- Secret sharing decryption in the context of voting or lotteries
- Secure multi-party computation without agreement
- Security and composition of multiparty cryptographic protocols
- Strengthening zero-knowledge protocols using signatures
- The decision Diffie-Hellman problem
- Theory of Cryptography
- Timed commitments. (Extended abstract)
- Timed fair exchange of standard signatures (extended abstract)
- Timed release of standard digital signatures (extended abstract)
- Universally composable commitments (extended abstract)
- Universally composable two-party and multi-party secure computation
Cited in
(11)- 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
- How fair is your protocol? A utility-based approach to protocol optimality
- How to use bitcoin to design fair protocols
- Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles
- Theory of Cryptography
- 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
- Synchronizable fair exchange
- Proof-of-work-based consensus in expected-constant time
- Separating verifiable delay functions and time-lock puzzles
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)
