Quasi-Adaptive NIZK for Linear Subspaces Revisited
From MaRDI portal
Publication:2948380
DOI10.1007/978-3-662-46803-6_4zbMath1326.94103OpenAlexW835751452WikidataQ59163651 ScholiaQ59163651MaRDI QIDQ2948380
Publication date: 30 September 2015
Published in: Advances in Cryptology - EUROCRYPT 2015 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-46803-6_4
Related Items (45)
A New Paradigm for Public-Key Functional Encryption for Degree-2 Polynomials ⋮ Hierarchical Identity-Based Encryption with Tight Multi-challenge Security ⋮ On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness ⋮ On QA-NIZK in the BPK Model ⋮ Smooth NIZK arguments ⋮ QA-NIZK Arguments of Same Opening for Bilateral Commitments ⋮ Signatures of Knowledge for Boolean Circuits Under Standard Assumptions ⋮ Parameter-hiding order revealing encryption ⋮ Signatures of knowledge for Boolean circuits under standard assumptions ⋮ Subversion-resistant quasi-adaptive NIZK and applications to modular zk-SNARKs ⋮ Survey of information security ⋮ Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs ⋮ Hardware security without secure hardware: how to decrypt with a password and a server ⋮ Improved, black-box, non-malleable encryption from semantic security ⋮ QANIZK for adversary-dependent languages and their applications ⋮ Efficient IBE with Tight Reduction to Standard Assumption in the Multi-challenge Setting ⋮ Almost tight multi-user security under adaptive corruptions \& leakages in the standard model ⋮ Tight lower bounds and optimal constructions of anonymous broadcast encryption and authentication ⋮ A Revocable Group Signature Scheme with Scalability from Simple Assumptions and Its Implementation ⋮ The Kernel Matrix Diffie-Hellman Assumption ⋮ NIWI and new notions of extraction for algebraic languages ⋮ Traceable receipt-free encryption ⋮ Gentry-Wichs is tight: a falsifiable non-adaptively sound SNARG ⋮ Smooth zero-knowledge hash functions ⋮ CRS-updatable asymmetric quasi-adaptive NIZK arguments ⋮ Shorter quasi-adaptive NIZK proofs for linear subspaces ⋮ Impossibilities in succinct arguments: black-box extraction and more ⋮ Statistical ZAPs from group-based assumptions ⋮ Fully-succinct publicly verifiable delegation from constant-size assumptions ⋮ Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions ⋮ An algebraic framework for Diffie-Hellman assumptions ⋮ Improved Structure Preserving Signatures Under Standard Bilinear Assumptions ⋮ Equivalences and Black-Box Separations of Matrix Diffie-Hellman Problems ⋮ Election control through social influence with unknown preferences ⋮ Fine-grained secure attribute-based encryption ⋮ Unbounded inner product functional encryption from bilinear maps ⋮ Tightly secure hierarchical identity-based encryption ⋮ Minicrypt primitives with algebraic structure and applications ⋮ Compact NIZKs from standard assumptions on bilinear maps ⋮ New constructions of statistical NIZKs: dual-mode DV-NIZKs and more ⋮ Tightly CCA-secure inner product functional encryption scheme ⋮ New Techniques for Non-interactive Shuffle and Range Arguments ⋮ Structure-preserving public-key encryption with leakage-resilient CCA security ⋮ Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages ⋮ Adaptive Partitioning
This page was built for publication: Quasi-Adaptive NIZK for Linear Subspaces Revisited
