Lattice-Based Zero-Knowledge Proofs Secure Computation against Quantum Threat
The research introduces quantum-resistant zero-knowledge proof systems leveraging hard lattice problems, ensuring long-term privacy and verifiability for decentralized architectures.
Lattice-Based Arguments Achieve Succinct Post-Quantum Verification Using Homomorphic Commitments
This work delivers the first lattice-based argument with polylogarithmic verification time, resolving the trade-off between post-quantum security and SNARK succinctness.
Threshold Encryption Secures Transaction Ordering Fairness and Mitigates Extractable Value
Threshold encryption decouples transaction submission from execution, forcing validator collusion to extract MEV, thereby enforcing order fairness.
Affine One-Wayness Establishes Post-Quantum Verifiable Temporal Ordering for Distributed Systems
Affine One-Wayness is a new post-quantum cryptographic primitive that enforces provable, clock-independent event ordering, enabling Byzantine-resistant distributed synchronization.
Fiat-Shamir Transformation Vulnerable to Practical Attacks, Impacting Blockchain Security
Researchers expose a critical flaw in Fiat-Shamir, enabling false proofs in widely used systems and demanding re-evaluation of blockchain security foundations.
Publicly Verifiable PIR: Private Queries with Public Result Integrity
This research introduces Publicly Verifiable Private Information Retrieval, enabling transparent, auditable private data queries in decentralized systems.
