Non-Interactive Quantum Knowledge Arguments Achieve Transparent Setup and Extractable Security
A new non-interactive quantum proof system uses coset state authentication to achieve transparent setup and extractable security, advancing post-quantum verifiable computation.
Zero-Knowledge Authenticator Achieves Policy-Private Transaction Authentication on Public Blockchains
This new cryptographic primitive uses equivocable verification keys to privatize complex authentication policies, enhancing on-chain privacy.
Constant-Time Publicly Verifiable Secret Sharing Unlocks Scalable Blockchain Primitives
This framework transforms Publicly Verifiable Secret Sharing from $O(n)$ to $O(1)$ complexity by leveraging CCA2-Secure Threshold Encryption and NIZK proofs, eliminating a critical scalability bottleneck.
Zero-Knowledge Authenticators Decouple Public Blockchain Transparency from Private Policy
Zero-Knowledge Authenticators introduce a primitive for policy-private on-chain authentication, securing complex governance rules without public exposure.
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.
