New Quantum Rewinding Secures Succinct Arguments against Future Attacks
A novel quantum rewinding technique proves post-quantum security for succinct arguments, establishing a foundation for quantum-resistant verifiable computation.
Asynchronous Consensus Achieved Using Only Hash Functions and Simple Primitives
A novel asynchronous consensus protocol leverages a binding Index Cover Gather primitive and simple hash functions to achieve optimal fault tolerance and constant rounds, eliminating complex public-key cryptography.
New Zero-Knowledge Model Circumvents Impossibility for Perfect Soundness
By introducing a security definition based on logical independence, this breakthrough achieves non-interactive, transparent zero-knowledge proofs with perfect soundness, eliminating the need for trusted setups.
Lightweight Asynchronous Secret Sharing Achieves Optimal Resilience and Efficiency
New protocols for Asynchronous Verifiable Secret Sharing (AVSS) leverage lightweight primitives to achieve optimal resilience and amortized linear communication, fundamentally accelerating BFT consensus.
Topological Consensus Networks: Quantum-Secure Scalability for Blockchains
Léonne introduces quantum-enhanced topological consensus, dynamically restructuring networks to resolve the blockchain trilemma for scalable, secure, decentralized systems.
Topological Consensus Networks Enable Scalable, Secure, and Decentralized Blockchains
Léonne's Proof-of-Consensus leverages dynamic trust relationships and quantum randomness to overcome the blockchain trilemma, enabling unprecedented scalability and security.
