ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2005.01565
  4. Cited By
A Tight Lower Bound on Adaptively Secure Full-Information Coin Flip

A Tight Lower Bound on Adaptively Secure Full-Information Coin Flip

4 May 2020
Iftach Haitner
Yonatan Karidi-Heller
ArXivPDFHTML

Papers citing "A Tight Lower Bound on Adaptively Secure Full-Information Coin Flip"

3 / 3 papers shown
Title
Byzantine Agreement in Polynomial Time with Near-Optimal Resilience
Byzantine Agreement in Polynomial Time with Near-Optimal Resilience
Shang-En Huang
Seth Pettie
Leqi Zhu
27
10
0
27 Feb 2022
An Almost-Optimally Fair Three-Party Coin-Flipping Protocol
An Almost-Optimally Fair Three-Party Coin-Flipping Protocol
Iftach Haitner
Eliad Tsfadia
20
30
0
03 May 2021
Fair Coin Flipping: Tighter Analysis and the Many-Party Case
Fair Coin Flipping: Tighter Analysis and the Many-Party Case
Niv Buchbinder
Iftach Haitner
Nissan Levi
Eliad Tsfadia
29
25
0
18 Apr 2021
1