Zero Knowledge Proofs and Advanced Primitives Questions

Covers the theory, construction, evaluation, and engineering of zero knowledge proofs and related advanced cryptographic primitives. Candidates should explain the formal properties such as completeness, soundness, and zero knowledge, the distinction between interactive and non interactive proof systems, and transforms used to obtain non interactive proofs. Expect discussion of succinct proof systems and transparent argument systems, trust and setup models including trusted setup versus transparent setups, and how these choices affect security assumptions, proof sizes, prover time, and verifier cost. The topic includes multi party computation, threshold cryptography, secure function evaluation, homomorphic encryption, and functional encryption as alternative or complementary approaches to privacy and verifiability. Interviewers may probe on practical use cases such as privacy preserving credentials, verifiable computation, and blockchain rollups, and on engineering considerations including constraint system design, circuit representation, randomness and entropy requirements, prover memory and time optimizations, verification strategies, side channel defenses, and integration into production stacks. Candidates should be able to evaluate trade offs between security assumptions and performance, cite representative libraries and frameworks, and describe how to test and measure correctness and performance in real world deployments.