Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
From MaRDI portal
Publication:2104242
DOI10.1007/978-3-030-56877-1_27zbMath1504.94127OpenAlexW3013097088MaRDI QIDQ2104242
Dominik Hartmann, Geoffroy Couteau
Publication date: 7 December 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-56877-1_27
pairing-based cryptographystructure-preserving signaturestight securityzero-knowledge argumentsnon-interactive zero-knowledge argumentssatistical witness-indistinguishability
Related Items (15)
QA-NIZK Arguments of Same Opening for Bilateral Commitments ⋮ 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 ⋮ Improved Constructions of Anonymous Credentials from Structure-Preserving Signatures on Equivalence Classes ⋮ 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 ⋮ Statistical ZAPs from group-based assumptions ⋮ Compact structure-preserving signatures with almost tight security ⋮ Zero-knowledge proofs for set membership: efficient, succinct, modular ⋮ Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An algebraic framework for Diffie-Hellman assumptions
- Improved (almost) tightly-secure simulation-sound QA-NIZK with applications
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- More efficient (almost) tightly secure structure-preserving signatures
- Statistical witness indistinguishability (and more) in two messages
- Efficient designated-verifier non-interactive zero-knowledge proofs of knowledge
- From obfuscation to the security of Fiat-Shamir for proofs
- Compact structure-preserving signatures with almost tight security
- Improved (almost) tightly-secure structure-preserving signatures
- The algebraic group model and its applications
- Statistical ZAP arguments
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
- Shorter QA-NIZK and SPS with tighter security
- Shorter ring signatures from standard assumptions
- Shorter quadratic QA-NIZK proofs
- Ring signatures: logarithmic-size, no setup -- from standard assumptions
- Compactly Hiding Linear Spans
- Tightly CCA-Secure Encryption Without Pairings
- Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces
- Tightly Secure Signatures and Public-Key Encryption
- Structure-Preserving Signatures on Equivalence Classes and Their Application to Anonymous Credentials
- Quasi-Adaptive NIZK for Linear Subspaces Revisited
- The Kernel Matrix Diffie-Hellman Assumption
- How to share a secret
- Implicit Zero-Knowledge Arguments and Applications to the Malicious Setting
- Structure-Preserving Signatures from Standard Assumptions, Revisited
- Short Group Signatures via Structure-Preserving Signatures: Standard Model Security from Simple Assumptions
- Batch Groth–Sahai
- Secure Hybrid Encryption from Weakened Key Encapsulation
- An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
- Unifying Zero-Knowledge Proofs of Knowledge
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- The Knowledge Complexity of Interactive Proof Systems
- Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions
- Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Stretching Groth-Sahai: NIZK Proofs of Partial Satisfiability
- Advances in Cryptology – CRYPTO 2004
- Information Security Practice and Experience
- A Non-interactive Shuffle with Pairing Based Verifiability
- New Techniques for Noninteractive Zero-Knowledge
- Fine-Tuning Groth-Sahai Proofs
- Non-malleability from Malleability: Simulation-Sound Quasi-Adaptive NIZK Proofs and CCA2-Secure Encryption from Homomorphic Signatures
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - CRYPTO 2003
- Ring Signatures of Sub-linear Size Without Random Oracles
- Zaps and Their Applications
- P-signatures and Noninteractive Anonymous Credentials
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- Improved Structure Preserving Signatures Under Standard Bilinear Assumptions
- Non-interactive Zaps and New Techniques for NIZK
- Theory of Cryptography
This page was built for publication: Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
