Coin flipping by telephone a protocol for solving impossible problems
From MaRDI portal
Publication:3967048
DOI10.1145/1008908.1008911zbMATH Open0501.68011OpenAlexW2073086835MaRDI QIDQ3967048FDOQ3967048
Authors: Manuel Blum 
Publication date: 1983
Published in: ACM SIGACT News (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1008908.1008911
primality testcryptologyrandom numberscertified mailexchange of secretsmental pokercompletely secure one-way function
Cited In (46)
- Transmutation scheme of coin flipping protocol and utilization
- Quantum coin hedging, and a counter measure
- Constant-Round Nonmalleable Commitments from Any One-Way Function
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
- A light-weight bit commitment protocol based on unpredictable channel noise
- Composable Security in the Bounded-Quantum-Storage Model
- Quantum cryptography: public key distribution and coin tossing
- On the power of an honest majority in three-party computation without broadcast
- Computational hardness of optimal fair computation: beyond Minicrypt
- A new framework for the design and analysis of identity-based identification schemes
- Bicorn: an optimistically efficient distributed randomness beacon
- Cryptanalysis and improvement of ``Game theoretic security of quantum bit commitment
- Weak coin flipping with small bias
- A commitment folk theorem
- Information-Theoretic Conditions for Two-Party Secure Function Evaluation
- Short paper: On game-theoretically-fair leader election
- Game theoretic notions of fairness in multi-party coin toss
- Game-theoretic fairness meets multi-party protocols: the case of leader election
- An accurate, scalable and verifiable protocol for federated differentially private averaging
- Minimum disclosure proofs of knowledge
- Physical Limitations of Quantum Cryptographic Primitives or Optimal Bounds for Quantum Coin Flipping and Bit Commitment
- Protocols for multiparty coin toss with a dishonest majority
- Security of quantum bit string commitment depends on the information measure
- Practical and provably secure release of a secret and exchange of signatures
- Universally composable subversion-resilient cryptography
- New binding-concealing trade-offs for quantum string commitment
- Bounds on the efficiency of black-box commitment schemes
- Robust and scalable middleware for selfish-computer systems
- Cheat-sensitive coin flipping and quantum gambling
- High entropy random selection protocols
- Cryptography with constant input locality
- A complete characterization of game-theoretically fair, multi-party coin toss
- A simpler proof of the existence of quantum weak coin flipping with arbitrarily small bias
- Verifying quantum computations at scale: a cryptographic leash on quantum devices
- Game authority for robust and scalable distributed selfish-computer systems
- Quantum cryptography beyond quantum key distribution
- Certifying private probabilistic mechanisms
- Game-theoretically fair distributed sampling
- A high dimensional Goldreich-Levin theorem
- Expected linear round synchronization: the missing link for linear Byzantine SMR
- \(\log^\ast\)-round game-theoretically-fair leader election
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
- Zero-knowledge proof systems for QMA
- Quantum cryptography: key distribution and beyond
- Title not available (Why is that?)
- Overcoming impossibility results in composable security using interval-wise guarantees
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)
