Coin flipping by telephone a protocol for solving impossible problems
From MaRDI portal
Publication:3967048
DOI10.1145/1008908.1008911zbMath0501.68011OpenAlexW2073086835MaRDI QIDQ3967048
No author found.
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
cryptologyrandom numbersprimality testcertified mailexchange of secretsmental pokercompletely secure one-way function
Related Items (46)
Game-theoretic fairness meets multi-party protocols: the case of leader election ⋮ Computational hardness of optimal fair computation: beyond Minicrypt ⋮ Transmutation scheme of coin flipping protocol and utilization ⋮ Game theoretic notions of fairness in multi-party coin toss ⋮ Quantum coin hedging, and a counter measure ⋮ Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious ⋮ Practical and provably secure release of a secret and exchange of signatures ⋮ Minimum disclosure proofs of knowledge ⋮ A complete characterization of game-theoretically fair, multi-party coin toss ⋮ Universally composable subversion-resilient cryptography ⋮ High entropy random selection protocols ⋮ Short paper: On game-theoretically-fair leader election ⋮ Physical Limitations of Quantum Cryptographic Primitives or Optimal Bounds for Quantum Coin Flipping and Bit Commitment ⋮ 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 ⋮ Quantum cryptography beyond quantum key distribution ⋮ Composable Security in the Bounded-Quantum-Storage Model ⋮ Expected linear round synchronization: the missing link for linear Byzantine SMR ⋮ Robust and scalable middleware for selfish-computer systems ⋮ Quantum Cryptography: Key Distribution and Beyond ⋮ A light-weight bit commitment protocol based on unpredictable channel noise ⋮ Quantum cryptography: public key distribution and coin tossing ⋮ 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 ⋮ Bounds on the efficiency of black-box commitment schemes ⋮ On the power of an honest majority in three-party computation without broadcast ⋮ Unnamed Item ⋮ Information-Theoretic Conditions for Two-Party Secure Function Evaluation ⋮ A high dimensional Goldreich-Levin theorem ⋮ Verifying quantum computations at scale: A cryptographic leash on quantum devices ⋮ Bicorn: an optimistically efficient distributed randomness beacon ⋮ Protocols for multiparty coin toss with a dishonest majority ⋮ A Simpler Proof of the Existence of Quantum Weak Coin Flipping with Arbitrarily Small Bias ⋮ Certifying private probabilistic mechanisms ⋮ Game-theoretically fair distributed sampling ⋮ Zero-knowledge proof systems for QMA ⋮ Cryptanalysis and improvement of ``Game theoretic security of quantum bit commitment ⋮ New binding-concealing trade-offs for quantum string commitment ⋮ Weak coin flipping with small bias ⋮ Security of Quantum Bit String Commitment Depends on the Information Measure ⋮ Cryptography with constant input locality ⋮ Constant-Round Nonmalleable Commitments from Any One-Way Function ⋮ Overcoming impossibility results in composable security using interval-wise guarantees ⋮ Cheat-sensitive coin flipping and quantum gambling
This page was built for publication: Coin flipping by telephone a protocol for solving impossible problems
