Coin flipping by telephone a protocol for solving impossible problems
From MaRDI portal
Cited in
(59)- New binding-concealing trade-offs for quantum string commitment
- Weak coin flipping with small bias
- Cryptography with constant input locality
- Minimum disclosure proofs of knowledge
- Game theoretic notions of fairness in multi-party coin toss
- A light-weight bit commitment protocol based on unpredictable channel noise
- Practical and provably secure release of a secret and exchange of signatures
- Cryptanalysis and improvement of ``Game theoretic security of quantum bit commitment
- Overcoming impossibility results in composable security using interval-wise guarantees
- Cheat-sensitive coin flipping and quantum gambling
- Game-theoretic fairness meets multi-party protocols: the case of leader election
- Computational hardness of optimal fair computation: beyond Minicrypt
- A complete characterization of game-theoretically fair, multi-party coin toss
- Universally composable subversion-resilient cryptography
- Bounds on the efficiency of black-box commitment schemes
- Protocols for multiparty coin toss with a dishonest majority
- High entropy random selection protocols
- A simpler proof of the existence of quantum weak coin flipping with arbitrarily small bias
- Security of quantum bit string commitment depends on the information measure
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
- Transmutation scheme of coin flipping protocol and utilization
- Composable Security in the Bounded-Quantum-Storage Model
- Information-Theoretic Conditions for Two-Party Secure Function Evaluation
- Physical Limitations of Quantum Cryptographic Primitives or Optimal Bounds for Quantum Coin Flipping and Bit Commitment
- Quantum coin hedging, and a counter measure
- Robust and scalable middleware for selfish-computer systems
- Quantum cryptography: public key distribution and coin tossing
- Zero-knowledge proofs from spLWE-based commitments
- Quantum cryptography: key distribution and beyond
- Verifying quantum computations at scale: a cryptographic leash on quantum devices
- Constant-Round Nonmalleable Commitments from Any One-Way Function
- Short paper: On game-theoretically-fair leader election
- An accurate, scalable and verifiable protocol for federated differentially private averaging
- \(\log^\ast\)-round game-theoretically-fair leader election
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
- On the power of an honest majority in three-party computation without broadcast
- A high dimensional Goldreich-Levin theorem
- Expected linear round synchronization: the missing link for linear Byzantine SMR
- Bicorn: an optimistically efficient distributed randomness beacon
- Certifying private probabilistic mechanisms
- Game-theoretically fair distributed sampling
- Zero-knowledge proof systems for QMA
- Protocols for quantum weak coin flipping
- Cryptographic treatment of key control security. In light of NIST SP 800-108
- Streaming zero-knowledge proofs
- Good things come to those who wait. Dishonest-majority coin-flipping requires delay functions
- Efficient distributed randomness generation from minimal assumptions where \underline{PA}rties \underline{S}peak \underline{S}equentially \underline{O}nce
- Notes on conditional entropy and commitment capacity
- Avoiding trusted setup in isogeny-based commitments
- On the (im)possibility of game-theoretically fair leader election protocols
- Unconditionally secure relativistic multi-party biased coin flipping and die rolling
- Improved universal thresholdizer from iterative Shamir secret sharing
- A zero-knowledge proof for the syndrome decoding problem in the Lee metric
- Game-theoretically fair coin toss with arbitrary preferences
- Overlap gap and computational thresholds in the square wave perceptron
- Quantum cryptography beyond quantum key distribution
- A new framework for the design and analysis of identity-based identification schemes
- A commitment folk theorem
- Game authority for robust and scalable distributed selfish-computer systems
This page was built for publication: Coin flipping by telephone a protocol for solving impossible problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3967048)
