Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
From MaRDI portal
Publication:2104242
Recommendations
- Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
- Short pairing-based non-interactive zero-knowledge arguments
- Short non-interactive zero-knowledge proofs
- Efficient zero-knowledge proof of algebraic and non-algebraic statements with applications to privacy preserving credentials
- Zero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomials
- Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes
- Efficient zero-knowledge proofs of non-algebraic statements with sublinear amortized cost
- Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography
- An efficient noninteractive zero-knowledge proof system for NP with general assumptions
- Non-interactive zero-knowledge proofs with fine-grained security
Cites work
- A Non-interactive Shuffle with Pairing Based Verifiability
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology – CRYPTO 2004
- An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
- An algebraic framework for Diffie-Hellman assumptions
- Batch Groth-Sahai
- Compact structure-preserving signatures with almost tight security
- Compactly hiding linear spans. Tightly secure constant-size simulation-sound QA-NIZK proofs and applications
- Constant-size structure-preserving signatures: generic constructions and simple assumptions
- Efficient designated-verifier non-interactive zero-knowledge proofs of knowledge
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- Fine-Tuning Groth-Sahai Proofs
- From obfuscation to the security of Fiat-Shamir for proofs
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- How to share a secret
- scientific article; zbMATH DE number 2081086 (Why is no real title available?)
- scientific article; zbMATH DE number 2086698 (Why is no real title available?)
- scientific article; zbMATH DE number 1406779 (Why is no real title available?)
- scientific article; zbMATH DE number 1440890 (Why is no real title available?)
- Implicit zero-knowledge arguments and applications to the malicious setting
- Improved (almost) tightly-secure simulation-sound QA-NIZK with applications
- Improved (almost) tightly-secure structure-preserving signatures
- Improved structure preserving signatures under standard bilinear assumptions
- Information Security Practice and Experience
- More efficient (almost) tightly secure structure-preserving signatures
- New techniques for noninteractive zero-knowledge
- Non-interactive Zaps and New Techniques for NIZK
- Non-malleability from malleability: simulation-sound quasi-adaptive NIZK proofs and CCA2-secure encryption from homomorphic signatures
- P-signatures and Noninteractive Anonymous Credentials
- Quadratic span programs and succinct NIZKs without PCPs
- Quasi-adaptive NIZK for linear subspaces revisited
- Ring Signatures of Sub-linear Size Without Random Oracles
- Ring signatures: logarithmic-size, no setup -- from standard assumptions
- Secure Hybrid Encryption from Weakened Key Encapsulation
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Short group signatures via structure-preserving signatures: standard model security from simple assumptions
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
- Shorter QA-NIZK and SPS with tighter security
- Shorter quadratic QA-NIZK proofs
- Shorter quasi-adaptive NIZK proofs for linear subspaces
- Shorter ring signatures from standard assumptions
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- Statistical witness indistinguishability (and more) in two messages
- Statistical ZAP arguments
- Stretching Groth-Sahai: NIZK proofs of partial satisfiability
- Structure-preserving signatures from standard assumptions, revisited
- Structure-Preserving Signatures on Equivalence Classes and Their Application to Anonymous Credentials
- The algebraic group model and its applications
- The kernel matrix Diffie-Hellman assumption
- The Knowledge Complexity of Interactive Proof Systems
- Theory of Cryptography
- Tightly CCA-secure encryption without pairings
- Tightly Secure Signatures and Public-Key Encryption
- Unifying Zero-Knowledge Proofs of Knowledge
- Zaps and Their Applications
Cited in
(37)- Non-interactive zaps of knowledge
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
- Tight state-restoration soundness in the algebraic group model
- Signatures of knowledge for Boolean circuits under standard assumptions
- Non-interactive zero-knowledge proofs with fine-grained security
- One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model
- Shorter pairing-based arguments under standard assumptions
- Efficient non-interactive zero-knowledge proofs in cross-domains without trusted setup
- Shorter quadratic QA-NIZK proofs
- Statistical ZAPs from group-based assumptions
- Square span programs with applications to succinct NIZK arguments
- Quasi-adaptive NIZK for linear subspaces revisited
- Short pairing-based non-interactive zero-knowledge arguments
- QA-NIZK arguments of same opening for bilateral commitments
- Improved constructions of anonymous credentials from structure-preserving signatures on equivalence classes
- Stretching Groth-Sahai: NIZK proofs of partial satisfiability
- Non-interactive Zaps and New Techniques for NIZK
- Zero-knowledge proofs for set membership: efficient, succinct, modular
- Compact structure-preserving signatures with almost tight security
- NIWI and new notions of extraction for algebraic languages
- Efficient NIZKs for algebraic sets
- Smooth zero-knowledge hash functions
- To label, or not to label (in generic groups)
- Impossibilities in succinct arguments: black-box extraction and more
- On the impossibility of algebraic NIZK in pairing-free groups
- A simple and efficient framework of proof systems for NP
- Threshold structure-preserving signatures
- Set (non-)membership NIZKs from determinantal accumulators
- Threshold structure-preserving signatures: strong and adaptive security under standard assumptions
- Witness encryption for succinct functional commitments and applications
- Fast public-key silent OT and more from constrained Naor-Reingold
- Generic and algebraic computation models: when AGM proofs transfer to the GGM
- Practical traceable receipt-free encryption
- Updatable privacy-preserving blueprints
- On security proofs of existing equivalence class signature schemes
- Putting multi into multi-signatures: tight security for multiple signers
- Structure-preserving compressing primitives: vector commitments and accumulators and applications
This page was built for publication: Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104242)
