New Lower Bounds Define Communication Limits for Dishonest-Majority Broadcast Protocols
        
        
        
        
          
        
        
      
        
    
        
        This research establishes fundamental communication lower bounds for randomized Byzantine broadcast in dishonest-majority networks, framing the ultimate scalability limits.
        
        Optimizing Communication for Secure Multi-Party Computation with Aborts
        
        
        
        
          
        
        
      
        
    
        
        New protocols drastically reduce communication overhead in secure multi-party computation with selective aborts, enhancing practicality for decentralized applications.
