Compact NIZKs from standard assumptions on bilinear maps
From MaRDI portal
Publication:6570525
DOI10.1007/S00145-024-09503-8zbMATH Open1543.94734MaRDI QIDQ6570525FDOQ6570525
Shota Yamada, Shuichi Katsumata, Takashi Yamakawa, Ryo Nishimaki
Publication date: 10 July 2024
Published in: Journal of Cryptology (Search for Journal in Brave)
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- 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
- 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
- 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
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)