Non-interactive Zaps and New Techniques for NIZK

DOI10.1007/11818175_6zbMath1129.94024OpenAlexW1522706628MaRDI QIDQ5756624

Amit Sahai, Jens Groth, Rafail Ostrovsky

Publication date: 4 September 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11818175_6

zbMATH Keywords

Non-interactive zero-knowledgebilinear groupswitness indistinguishabilityDecisional Linear Assumption

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (45)

Verifiable Inner Product Encryption Scheme ⋮ Non-malleable codes for bounded parallel-time tampering ⋮ QA-NIZK Arguments of Same Opening for Bilateral Commitments ⋮ Unconditionally anonymous ring and mesh signatures ⋮ Dual-mode NIZKs: possibility and impossibility results for property transfer ⋮ Distributed (correlation) samplers: how to remove a trusted dealer in one round ⋮ Fully homomorphic NIZK and NIWI proofs ⋮ Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge ⋮ Explainable arguments ⋮ A survey of elliptic curves for proof systems ⋮ Verifiable Functional Encryption ⋮ NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion ⋮ Chopsticks: fork-free two-round multi-signatures from non-interactive assumptions ⋮ Obtaining simulation extractable NIZKs in the updatable CRS model generically ⋮ Gentry-Wichs is tight: a falsifiable non-adaptively sound SNARG ⋮ Efficient NIZKs for algebraic sets ⋮ Updatable NIZKs from non-interactive zaps ⋮ More efficient verifiable functional encryption ⋮ Group homomorphic encryption: characterizations, impossibility results, and applications ⋮ On constant-round concurrent non-malleable proof systems ⋮ Security-preserving distributed samplers: how to generate any CRS in one round without random oracles ⋮ On the impossibility of algebraic NIZK in pairing-free groups ⋮ A note on non-interactive zero-knowledge from CDH ⋮ Efficient traceable signatures in the standard model ⋮ Individual simulations ⋮ Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles ⋮ Statistical ZAPs from group-based assumptions ⋮ Two-round maliciously secure computation with super-polynomial simulation ⋮ Unnamed Item ⋮ Tightly secure ring signatures in the standard model ⋮ Compact Group Signatures Without Random Oracles ⋮ Fully leakage-resilient signatures revisited: graceful degradation, noisy leakage, and construction in the bounded-retrieval model ⋮ On subversion-resistant SNARKs ⋮ How to extract useful randomness from unreliable sources ⋮ Statistical ZAPR arguments from bilinear maps ⋮ Statistical ZAP arguments ⋮ Statistical Zaps and new oblivious transfer protocols ⋮ Non-interactive zero knowledge from sub-exponential DDH ⋮ Towards accountability in CRS generation ⋮ Co-sound Zero-Knowledge with Public Keys ⋮ Proofs on Encrypted Values in Bilinear Groups and an Application to Anonymity of Signatures ⋮ Efficient Traceable Signatures in the Standard Model ⋮ (Commit-and-prove) predictable arguments with privacy ⋮ New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust ⋮ Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages

This page was built for publication: Non-interactive Zaps and New Techniques for NIZK