TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
From MaRDI portal
Publication:2117059
DOI10.1007/978-3-030-78375-4_15zbMATH Open1492.94190OpenAlexW3159257500MaRDI QIDQ2117059FDOQ2117059
Authors: Yaron Gvili, Julie Ha, Sarah Scheffler, Mayank Varia, Ziling Yang, Xinyuan Zhang 
Publication date: 21 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-78375-4_15
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
Quantum cryptography (quantum-theoretic aspects) (81P94) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Snarks for C: verifying program executions succinctly and in zero knowledge
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Oblivious transfer and polynomial evaluation
- Multiparty Computation from Somewhat Homomorphic Encryption
- A new approach to practical active-secure two-party computation
- Title not available (Why is that?)
- Semi-homomorphic encryption and multiparty computation
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- The Knowledge Complexity of Interactive Proof Systems
- Title not available (Why is that?)
- Cryptography with constant computational overhead
- Algebraic methods for interactive proof systems
- Short pairing-based non-interactive zero-knowledge arguments
- Succinct non-interactive arguments via linear interactive proofs
- Quadratic span programs and succinct NIZKs without PCPs
- Ciphers for MPC and FHE
- Title not available (Why is that?)
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- Efficient adaptively secure zero-knowledge from garbled circuits
- Title not available (Why is that?)
- Constant-round interactive proofs for delegating computation
- Updatable and universal common reference strings with applications to zk-SNARKs
- BBQ: using AES in Picnic signatures
- Banquet: short and fast signatures from AES
- Aurora: transparent succinct arguments for R1CS
- Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography
- LegRoast: efficient post-quantum signatures from the Legendre PRF
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Two halves make a whole: reducing data transfer in garbled circuits using half gates
- Overdrive: making SPDZ great again
- On the size of pairing-based non-interactive arguments
- Interactive oracle proofs
- Privacy-free garbled circuits with applications to efficient zero-knowledge
- Scalable zero knowledge via cycles of elliptic curves
- Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
- Transparent SNARKs from DARK compilers
- Stacked garbling for disjunctive zero-knowledge proofs
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Turbospeedz: double your online SPDZ! Improving SPDZ using function dependent preprocessing
- Zero-knowledge proofs on secret-shared data via fully linear PCPs
- Efficient pseudorandom correlation generators: silent OT extension and more
- An Attack on Some Signature Schemes Constructed from Five-Pass Identification Schemes
Cited In (7)
- Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography
- A simple post-quantum non-interactive zero-knowledge proof from garbled circuits
- Layering quantum-resistance into classical digital signature algorithms
- Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head
- More efficient zero-knowledge protocols over \(\mathbb{Z}_{2^k}\) via Galois rings
- Resumable zero-knowledge for circuits from symmetric key primitives
- Efficient zero-knowledge arguments and digital signatures \textit{via} sharing conversion \textit{in the head}
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)
