Switching Lemma for Bilinear Tests and Constant-Size NIZK Proofs for Linear Subspaces
From MaRDI portal
Publication:2874543
DOI10.1007/978-3-662-44381-1_17zbMath1335.94057OpenAlexW27132305MaRDI QIDQ2874543
Publication date: 7 August 2014
Published in: Advances in Cryptology – CRYPTO 2014 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-44381-1_17
Related Items (19)
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 ⋮ Subversion-resistant quasi-adaptive NIZK and applications to modular zk-SNARKs ⋮ Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs ⋮ Linearly homomorphic structure-preserving signatures and their applications ⋮ The Kernel Matrix Diffie-Hellman Assumption ⋮ CRS-updatable asymmetric quasi-adaptive NIZK arguments ⋮ Shorter quasi-adaptive NIZK proofs for linear subspaces ⋮ 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 ⋮ Election control through social influence with unknown preferences ⋮ Unbounded inner product functional encryption from bilinear maps ⋮ Compact NIZKs from standard assumptions on bilinear maps ⋮ New Techniques for Non-interactive Shuffle and Range Arguments ⋮ Short tightly secure signatures for signing a vector of group elements: a new approach ⋮ Keyed-fully homomorphic encryption without indistinguishability obfuscation
This page was built for publication: Switching Lemma for Bilinear Tests and Constant-Size NIZK Proofs for Linear Subspaces
