Pages that link to "Item:Q3967048"

The following pages link to Coin flipping by telephone a protocol for solving impossible problems (Q3967048):

Displaying 38 items.

• Robust and scalable middleware for selfish-computer systems (Q465675) (← links)
• Quantum cryptography: public key distribution and coin tossing (Q477162) (← links)
• Quantum cryptography beyond quantum key distribution (Q908054) (← links)
• A new framework for the design and analysis of identity-based identification schemes (Q955014) (← links)
• A commitment folk theorem (Q972132) (← links)
• Game authority for robust and scalable distributed selfish-computer systems (Q974739) (← links)
• New binding-concealing trade-offs for quantum string commitment (Q1021244) (← links)
• Weak coin flipping with small bias (Q1029065) (← links)
• Cryptography with constant input locality (Q1037233) (← links)
• Minimum disclosure proofs of knowledge (Q1110348) (← links)
• Game theoretic notions of fairness in multi-party coin toss (Q1629437) (← links)
• A light-weight bit commitment protocol based on unpredictable channel noise (Q1725688) (← links)
• Practical and provably secure release of a secret and exchange of signatures (Q1903345) (← links)
• Cryptanalysis and improvement of ``Game theoretic security of quantum bit commitment'' (Q2053882) (← links)
• Overcoming impossibility results in composable security using interval-wise guarantees (Q2096476) (← links)
• Cheat-sensitive coin flipping and quantum gambling (Q2107937) (← links)
• Game-theoretic fairness meets multi-party protocols: the case of leader election (Q2128554) (← links)
• Computational hardness of optimal fair computation: beyond Minicrypt (Q2128555) (← links)
• A complete characterization of game-theoretically fair, multi-party coin toss (Q2169995) (← links)
• Universally composable subversion-resilient cryptography (Q2170002) (← links)
• Bounds on the efficiency of black-box commitment schemes (Q2268099) (← links)
• Protocols for multiparty coin toss with a dishonest majority (Q2516525) (← links)
• High entropy random selection protocols (Q2659776) (← links)
• A Simpler Proof of the Existence of Quantum Weak Coin Flipping with Arbitrarily Small Bias (Q2805518) (← links)
• Security of Quantum Bit String Commitment Depends on the Information Measure (Q3107821) (← links)
• Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious (Q3179362) (← links)
• Transmutation scheme of coin flipping protocol and utilization (Q3443346) (← links)
• Composable Security in the Bounded-Quantum-Storage Model (Q3519536) (← links)
• Information-Theoretic Conditions for Two-Party Secure Function Evaluation (Q3593116) (← links)
• Physical Limitations of Quantum Cryptographic Primitives or Optimal Bounds for Quantum Coin Flipping and Bit Commitment (Q4593252) (← links)
• Quantum coin hedging, and a counter measure (Q4637978) (← links)
• (Q5083085) (← links)
• Quantum Cryptography: Key Distribution and Beyond (Q5134949) (← links)
• Verifying quantum computations at scale: A cryptographic leash on quantum devices (Q5204995) (← links)
• Constant-Round Nonmalleable Commitments from Any One-Way Function (Q5501951) (← links)
• An accurate, scalable and verifiable protocol for federated differentially private averaging (Q6097108) (← links)
• Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious (Q6109072) (← links)
• On the power of an honest majority in three-party computation without broadcast (Q6109073) (← links)