TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures

DOI10.1007/978-3-030-78375-4_15zbMath1492.94190OpenAlexW3159257500MaRDI QIDQ2117059

Mayank Varia, Yaron Gvili, Sarah Scheffler, Julie Ha, Xinyuan Zhang, Ziling Yang

Publication date: 21 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-78375-4_15

zbMATH Keywords

arithmetic circuitsMPC-in-the-head paradigm

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (2)

Layering quantum-resistance into classical digital signature algorithms ⋮ Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head

Uses Software

• Pinocchio
• SNARKs for C
• GitHub
• Ligero
• ZKBoo
• Geppetto
• libiop
• Libra
• Marlin
• Spartan

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Updatable and universal common reference strings with applications to zk-SNARKs
• BBQ: using AES in Picnic signatures
• Overdrive: making SPDZ great again
• Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
• Efficient adaptively secure zero-knowledge from garbled circuits
• Transparent SNARKs from DARK compilers
• Marlin: preprocessing zkSNARKs with universal and updatable SRS
• Stacked garbling for disjunctive zero-knowledge proofs
• Banquet: short and fast signatures from AES
• Spartan: efficient and general-purpose zkSNARKs without trusted setup
• Turbospeedz: double your online SPDZ! Improving SPDZ using function dependent preprocessing
• Aurora: transparent succinct arguments for R1CS
• Zero-knowledge proofs on secret-shared data via fully linear PCPs
• Efficient pseudorandom correlation generators: silent OT extension and more
• Libra: succinct zero-knowledge proofs with optimal prover computation
• Oblivious transfer and polynomial evaluation
• SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
• Scalable Zero Knowledge via Cycles of Elliptic Curves
• Multiparty Computation from Somewhat Homomorphic Encryption
• A New Approach to Practical Active-Secure Two-Party Computation
• Ciphers for MPC and FHE
• Privacy-Free Garbled Circuits with Applications to Efficient Zero-Knowledge
• Two Halves Make a Whole
• Semi-homomorphic Encryption and Multiparty Computation
• Short Pairing-Based Non-interactive Zero-Knowledge Arguments
• Interactive Oracle Proofs
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• The Knowledge Complexity of Interactive Proof Systems
• Algebraic methods for interactive proof systems
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Succinct Non-interactive Arguments via Linear Interactive Proofs
• Quadratic Span Programs and Succinct NIZKs without PCPs
• Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography
• LegRoast: Efficient Post-quantum Signatures from the Legendre PRF
• Constant-round interactive proofs for delegating computation
• An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
• On the Size of Pairing-Based Non-interactive Arguments
• Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting

This page was built for publication: TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures