Compact NIZKs from standard assumptions on bilinear maps
type: Item
instance of: scholarly article
title: Compact NIZKs from standard assumptions on bilinear maps
DOI: 10.1007/978-3-030-45727-3_13
author: Shuichi Katsumata
author: Ryo Nishimaki
author: Shota Yamada
author: Takashi Yamakawa
publication date: 2021-12-01T00:00:00Z
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7436951
zbMATH Keywords: non-interactive zero-knowledge protocol
MaRDI profile type: Publication
full work available at URL: 978-3-030-45727-3 13
OpenAlex ID: W3022102127
cites work: Expressive Key-Policy Attribute-Based Encryption with Constant-Size Ciphertexts
cites work: Certifying permutations: Noninteractive zero-knowledge based on any trapdoor permutation
cites work: ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation
cites work: Perfect Structure on the Edge of Chaos
cites work: Q4783728
cites work: Breaking the Circuit Size Barrier for Secure Computation Under DDH
cites work: Fiat-Shamir: from practice to theory
cites work: Fiat-Shamir and correlation intractability from strong KDM-secure encryption
cites work: A forward-secure public-key encryption scheme
cites work: Certifying trapdoor permutations, revisited
cites work: Adaptively secure MPC with sublinear communication complexity
cites work: Square Span Programs with Applications to Succinct NIZK Arguments
cites work: An algebraic framework for Diffie-Hellman assumptions
cites work: Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
cites work: A Quasipolynomial Reduction for Generalized Selective Decryption on Trees
cites work: Adaptive Security of Constrained PRFs
cites work: Candidate indistinguishability obfuscation and functional encryption for all circuits
cites work: Quadratic Span Programs and Succinct NIZKs without PCPs
cites work: Fully homomorphic encryption using ideal lattices
cites work: Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs
cites work: Separating succinct non-interactive arguments from all falsifiable assumptions
cites work: Foundations of Cryptography
cites work: Definitions and properties of zero-knowledge proof systems
cites work: The Knowledge Complexity of Interactive Proof Systems
cites work: Short Non-interactive Zero-Knowledge Proofs
cites work: Short Pairing-Based Non-interactive Zero-Knowledge Arguments
cites work: On the Size of Pairing-Based Non-interactive Arguments
cites work: New Techniques for Noninteractive Zero-Knowledge
cites work: Efficient Noninteractive Proof Systems for Bilinear Groups
cites work: Adaptively Secure Garbled Circuits from One-Way Functions
cites work: Attribute-Based Encryption with Fast Decryption
cites work: Q4737161
cites work: Be adaptive, avoid overcommitting
cites work: Adaptive Security of Yao’s Garbled Circuits
cites work: Switching Lemma for Bilinear Tests and Constant-Size NIZK Proofs for Linear Subspaces
cites work: Shorter quasi-adaptive NIZK proofs for linear subspaces
cites work: From obfuscation to the security of Fiat-Shamir for proofs
cites work: Designated verifier/prover and preprocessing NIZKs from Diffie-Hellman assumptions
cites work: Exploring constructions of compact NIZKs from various assumptions
cites work: Quasi-Adaptive NIZK for Linear Subspaces Revisited
cites work: Multi-theorem preprocessing NIZKs from lattices
cites work: Compact adaptively secure ABE for \(\mathrm{NC}^1\) from \(k\)-lin
cites work: Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
cites work: Attribute-Based Signatures
cites work: Advances in Cryptology - CRYPTO 2003
cites work: Efficient Attribute-Based Signatures for Non-monotone Predicates in the Standard Model
cites work: Noninteractive zero knowledge for NP from (Plain) Learning With Errors
cites work: How to use indistinguishability obfuscation
cites work: An equivalence between attribute-based signatures and homomorphic signatures, and new constructions for both
cites work: Progress in Cryptology - INDOCRYPT 2003
cites work: Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
description: scientific article; zbMATH DE number 7436951