Black-Box Succinct Proofs Achieve Statistical Zero-Knowledge Security
A new polynomial commitment scheme enables succinct zero-knowledge proofs from minimal assumptions, establishing a theoretically optimal foundation for verifiable computation.
