Compact NIZKs from standard assumptions on bilinear maps

Recommendations

Compact NIZKs from standard assumptions on bilinear maps
Exploring constructions of compact NIZKs from various assumptions
Compact designated verifier NIZKs from the CDH assumption without pairings
Designated verifier/prover and preprocessing NIZKs from Diffie-Hellman assumptions
Short pairing-based non-interactive zero-knowledge arguments

Cites work

scientific article; zbMATH DE number 2086626 (Why is no real title available?)
scientific article; zbMATH DE number 1842494 (Why is no real title available?)
A Depth-Universal Circuit
A forward-secure public-key encryption scheme
A quasipolynomial reduction for generalized selective decryption on trees
Adaptive Security of Constrained PRFs
Adaptive security of Yao's garbled circuits
Adaptively secure MPC with sublinear communication complexity
Adaptively secure garbled circuits from one-way functions
Advances in Cryptology - CRYPTO 2003
An algebraic framework for Diffie-Hellman assumptions
An equivalence between attribute-based signatures and homomorphic signatures, and new constructions for both
Attribute-based encryption for circuits from multilinear maps
Attribute-based encryption schemes with constant-size ciphertexts
Attribute-based encryption with fast decryption
Attribute-based signatures
Be adaptive, avoid overcommitting
Breaking the circuit size barrier for secure computation under DDH
Candidate indistinguishability obfuscation and functional encryption for all circuits
Certifying permutations: Noninteractive zero-knowledge based on any trapdoor permutation
Certifying trapdoor permutations, revisited
Compact NIZKs from standard assumptions on bilinear maps
Compact adaptively secure ABE for $\mathsf{NC}^1$ from $k$-Lin
Compact designated verifier NIZKs from the CDH assumption without pairings
Cryptography in $NC^0$
Definitions and properties of zero-knowledge proof systems
Designated verifier/prover and preprocessing NIZKs from Diffie-Hellman assumptions
Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
Efficient attribute-based signatures for non-monotone predicates in the standard model
Efficient noninteractive proof systems for bilinear groups
Exploring constructions of compact NIZKs from various assumptions
Expressive key-policy attribute-based encryption with constant-size ciphertexts
Fiat-Shamir and correlation intractability from strong KDM-secure encryption
Fiat-Shamir: from practice to theory
Foundations of Cryptography
From obfuscation to the security of Fiat-Shamir for proofs
Fully-succinct publicly verifiable delegation from constant-size assumptions
Homomorphic signatures for polynomial functions
How to delegate computations publicly
How to use indistinguishability obfuscation
Leveled fully homomorphic signatures from standard lattices
Log Depth Circuits for Division and Related Problems
Multi-theorem preprocessing NIZKs from lattices
Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
New techniques for noninteractive zero-knowledge
Non-interactive zero knowledge from sub-exponential DDH
Non-interactive zero-knowledge in pairing-free groups from weaker assumptions
Noninteractive zero knowledge for NP from (Plain) Learning With Errors
On the size of pairing-based non-interactive arguments
Perfect structure on the edge of chaos. Trapdoor permutations from indistinguishability obfuscation
Progress in Cryptology - INDOCRYPT 2003
Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
Quadratic span programs and succinct NIZKs without PCPs
Quasi-adaptive NIZK for linear subspaces revisited
Separating succinct non-interactive arguments from all falsifiable assumptions
Short non-interactive zero-knowledge proofs
Short pairing-based non-interactive zero-knowledge arguments
Shorter quasi-adaptive NIZK proofs for linear subspaces
Square span programs with applications to succinct NIZK arguments
Switching lemma for bilinear tests and constant-size NIZK proofs for linear subspaces
The Knowledge Complexity of Interactive Proof Systems
Trapdoor hash functions and their applications
Universal circuits (Preliminary Report)
Unprovable security of perfect NIZK and non-interactive non-malleable commitments
Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs
ZAPs and non-interactive witness indistinguishability from indistinguishability obfuscation

Cited in

(1)

On the impossibility of algebraic NIZK in pairing-free groups

This page was built for publication: Compact NIZKs from standard assumptions on bilinear maps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6570525)