Greyhound Achieves Post-Quantum Polynomial Commitments with Unprecedented Efficiency
A new lattice-based polynomial commitment scheme, Greyhound, delivers post-quantum security and 8000X smaller proofs, unlocking scalable verifiable computation.
Lattice-Based Recursion Enables Transparent Post-Quantum Zero-Knowledge Proofs
LaBRADOR introduces a post-quantum, lattice-based ZK primitive that achieves sublinear proof size via recursive folding, securing future computation.
Lattice-Based SNARKs Achieve Post-Quantum Security and Proof Efficiency
Lattice-based proofs, rooted in the SIS problem, enable quantum-resistant, succinct zero-knowledge arguments, securing future computation.
Post-Quantum Signatures Eliminate Trapdoors Using Zero-Knowledge Proofs
Lattice-based non-interactive zero-knowledge proofs secure digital signatures against quantum adversaries by removing exploitable trapdoor functions.
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 Publicly Verifiable Secret Sharing Achieves Post-Quantum Standard Model Security
Researchers constructed the first lattice-based Publicly Verifiable Secret Sharing scheme, achieving post-quantum security in the rigorous standard model, securing decentralized key management against future threats.
Practical Lattice-Based Single Secret Leader Election Secures Post-Quantum Consensus
Qelect introduces the first practical constant-round post-quantum SSLE using RLWE and tFHE, securing Proof-of-Stake against quantum adversaries.
Lattice-Based Zero-Knowledge Signatures Eliminate Cryptographic Trapdoors
A new post-quantum signature framework converts non-trapdoor zero-knowledge proofs into digital signatures, fundamentally enhancing long-term security assurances.