Relativistic Bit Commitment Achieves Unconditionally Secure Cryptography by Leveraging Special Relativity
The Relativistic Bit Commitment primitive leverages the speed of light to bypass quantum no-go theorems, enabling unconditionally secure foundational protocols.
Linear-Time Accumulation Enables Post-Quantum Recursive Proof Systems
WARP is the first accumulation scheme to achieve linear prover and logarithmic verifier complexity, enabling practical, post-quantum secure recursive proofs.
Symmetric Subset Encryption Enables Leakage-Free Non-Interactive Private Search
New Symmetric Subset Predicate Encryption (SSPE) is a primitive that proves set containment on encrypted data, enabling non-interactive, leakage-suppressed private queries critical for decentralized data privacy.
Constant-Space Distributed Randomness via Insertion-Secure Accumulators and Delay Functions
This framework achieves scalable, unpredictable randomness by combining Verifiable Delay Functions with a new accumulator property, reducing public storage complexity to a constant.
Commit-and-Prove Zero-Knowledge Reduces Space Complexity for Large Circuits
Commit-and-Prove ZK is a new cryptographic primitive that enables memory recycling, dramatically reducing space complexity for large-scale verifiable computation.
Universal ZK-SNARKs Decouple Proof System Setup from Application Circuit Logic
Universal ZK-SNARKs replace per-circuit trusted setups with a single, continuously updatable reference string, boosting developer agility and security.
Merkle Mountain Ranges Achieve Optimal Witness Update Frequency Lower Bound
This work establishes the theoretical lower bound for cryptographic accumulator witness updates, proving Merkle Mountain Ranges are structurally optimal for stateless blockchain verification.
Efficient Byzantine Verifiable Secret Sharing Secures Decentralized AI
New VSS scheme EByFTVeS counters adaptive share delay attacks, significantly improving the security and efficiency of decentralized privacy-preserving computation.
Scalable Post-Quantum Threshold Signatures Secure Decentralized Computation
This MPC-based protocol delivers the first practical, NIST-compatible quantum-safe threshold signature, enabling robust, decentralized, and future-proof asset control.
