Machine learningCryptographic proof systems

zk-STARK

A zk-STARK (Zero-Knowledge Scalable Transparent Argument of Knowledge) is a cryptographic proof system allowing a prover to convince a verifier of a computation's correctness without trusted setup or revealing computational details. Introduced by Ben-Sasson and colleagues in 2018, zk-STARKs address a key limitation of zk-SNARKs: they require no preprocessing phase vulnerable to corruption. Instead, STARKs rely only on cryptographic hash functions, making them simpler, more transparent, and believed to be post-quantum secure.

Open in MethodMindSoonVideoSoon

Read the full method

Members only

Sign in with a free account to read this section.

Sign in

Sources

  1. Ben-Sasson, E., Bentov, I., Horesh, Y., & Riabzev, M. (2019). Scalable, transparent, and post-quantum secure computational integrity. In IACR Cryptology ePrint Archive, Report 2018/046. link
  2. Ben-Sasson, E., Riabzev, M., Rozenkraut, M., Shacham, H., & Stemen, M. (2021). Aurora: Transparent Succinct Non-Interactive Zero-Knowledge Proofs. In IACR Cryptology ePrint Archive, Report 2018/828. link

Related methods

Referenced by

ScholarGatezk-STARK (Zero-Knowledge Scalable Transparent Argument of Knowledge). Retrieved 2026-06-04 from https://scholargate.app/en/cryptography/zk-stark