Transparent Constant-Sized Polynomial Commitments Enable Practical Trustless zk-SNARKs
Dew introduces the first transparent polynomial commitment scheme with constant proof size and logarithmic verification, eliminating the trusted setup barrier for succinct verifiable computation.
Efficient Simulation Extractable Groth16 zk-SNARKs for Enhanced Security
This research introduces an optimized Groth16 zk-SNARK variant, achieving simulation extractability with fewer pairings, bolstering non-malleability for robust blockchain protocols.
Group Verifiable Random Functions Advance Anonymous Token Scalability
A new cryptographic primitive, Group Verifiable Random Functions, enables anonymous, scalable token issuance by decentralizing randomness generation.
