Achieving Statistical Non-Malleable Zero-Knowledge in Four Rounds
A novel four-round zero-knowledge argument achieves statistical non-malleability, advancing cryptographic proof systems beyond computational security.
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.
