Compact NIZKs from standard assumptions on bilinear maps

DOI10.1007/S00145-024-09503-8zbMATH Open1543.94734MaRDI QIDQ6570525FDOQ6570525

Authors: Shuichi Katsumata, Ryo Nishimaki, Shota Yamada, Takashi Yamakawa 

Publication date: 10 July 2024

Published in: Journal of Cryptology (Search for Journal in Brave)

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

zbMATH Keywords

compactnessbilinear mapsnon-interactive zero-knowledgestandard assumptions

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites Work

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

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)