Partially synchronous Byzantine protocols are widely used in blockchains due to their strong performance and deterministic finality. However, as network size increases, these protocols face severe scalability challenges, with communication complexity often growing exponentially. This leads to significant performance degradation, particularly in Byzantine fault-tolerant (BFT) protocols, where excessive message exchanges increase latency and reduce throughput. To address these limitations, we propose Election-Secure Hierarchical Byzantine Fault Tolerance (ES-HBFT). ES-HBFT adopts a root-subcommittee hierarchical architecture that mitigates single-point decision bottlenecks present in existing hierarchical designs. To enhance security and resilience, we integrate trusted execution environments (TEEs) and verifiable random functions (VRFs) into a robust committee election mechanism, minimizing the risk of adversarial manipulation. Additionally, we introduce a time-decaying credit evaluation system based on historical node behavior to select high-reputation nodes for the root committee, thereby improving consensus accuracy. Experimental results demonstrate that ES-HBFT improves throughput by 110% and reduces latency by 25% compared to HotStuff at a 200-node scale.