TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
From MaRDI portal
Publication:2117059
Recommendations
- Non-interactive zero-knowledge proofs with fine-grained security
- scientific article; zbMATH DE number 4191103
- Post-quantum zero-knowledge proofs for accumulators with applications to ring signatures from symmetric-key primitives
- Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge
- Tightly secure non-interactive multisignatures in the plain public key model
- A note on the post-quantum security of (ring) signatures
- Cryptography and Coding
- scientific article; zbMATH DE number 2009955
- Strengthening zero-knowledge protocols using signatures
Cites work
- scientific article; zbMATH DE number 1722673 (Why is no real title available?)
- scientific article; zbMATH DE number 4191103 (Why is no real title available?)
- scientific article; zbMATH DE number 5485433 (Why is no real title available?)
- scientific article; zbMATH DE number 1256680 (Why is no real title available?)
- A new approach to practical active-secure two-party computation
- Algebraic methods for interactive proof systems
- An Attack on Some Signature Schemes Constructed from Five-Pass Identification Schemes
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- Aurora: transparent succinct arguments for R1CS
- BBQ: using AES in Picnic signatures
- Banquet: short and fast signatures from AES
- Ciphers for MPC and FHE
- Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography
- Constant-round interactive proofs for delegating computation
- Cryptography with constant computational overhead
- Efficient adaptively secure zero-knowledge from garbled circuits
- Efficient pseudorandom correlation generators: silent OT extension and more
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Interactive oracle proofs
- LegRoast: efficient post-quantum signatures from the Legendre PRF
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Multiparty Computation from Somewhat Homomorphic Encryption
- Oblivious transfer and polynomial evaluation
- On the size of pairing-based non-interactive arguments
- Overdrive: making SPDZ great again
- Privacy-free garbled circuits with applications to efficient zero-knowledge
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Quadratic span programs and succinct NIZKs without PCPs
- Scalable zero knowledge via cycles of elliptic curves
- Semi-homomorphic encryption and multiparty computation
- Short pairing-based non-interactive zero-knowledge arguments
- Snarks for C: verifying program executions succinctly and in zero knowledge
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Stacked garbling for disjunctive zero-knowledge proofs
- Succinct non-interactive arguments via linear interactive proofs
- The Knowledge Complexity of Interactive Proof Systems
- Transparent SNARKs from DARK compilers
- Turbospeedz: double your online SPDZ! Improving SPDZ using function dependent preprocessing
- Two halves make a whole: reducing data transfer in garbled circuits using half gates
- Updatable and universal common reference strings with applications to zk-SNARKs
- Zero-knowledge proofs on secret-shared data via fully linear PCPs
Cited in
(7)- More efficient zero-knowledge protocols over \(\mathbb{Z}_{2^k}\) via Galois rings
- Efficient zero-knowledge arguments and digital signatures \textit{via} sharing conversion \textit{in the head}
- A simple post-quantum non-interactive zero-knowledge proof from garbled circuits
- Layering quantum-resistance into classical digital signature algorithms
- Resumable zero-knowledge for circuits from symmetric key primitives
- Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography
- Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head
Describes a project that uses
Uses Software
This page was built for publication: TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117059)
