Pages that link to "Item:Q2948380"
From MaRDI portal
The following pages link to Quasi-Adaptive NIZK for Linear Subspaces Revisited (Q2948380):
Displaying 50 items.
- An algebraic framework for Diffie-Hellman assumptions (Q514473) (← links)
- Smooth NIZK arguments (Q1629410) (← links)
- Parameter-hiding order revealing encryption (Q1633450) (← links)
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs (Q1648790) (← links)
- Shorter quasi-adaptive NIZK proofs for linear subspaces (Q1698397) (← links)
- Election control through social influence with unknown preferences (Q2019485) (← links)
- Compact NIZKs from standard assumptions on bilinear maps (Q2055661) (← links)
- New constructions of statistical NIZKs: dual-mode DV-NIZKs and more (Q2055662) (← links)
- Tightly CCA-secure inner product functional encryption scheme (Q2055966) (← links)
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages (Q2104242) (← links)
- Signatures of knowledge for Boolean circuits under standard assumptions (Q2143135) (← links)
- Subversion-resistant quasi-adaptive NIZK and applications to modular zk-SNARKs (Q2149845) (← links)
- Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions (Q2210433) (← links)
- Structure-preserving public-key encryption with leakage-resilient CCA security (Q2330095) (← links)
- Survey of information security (Q2385398) (← links)
- Improved, black-box, non-malleable encryption from semantic security (Q2413015) (← links)
- QANIZK for adversary-dependent languages and their applications (Q2420581) (← links)
- Hardware security without secure hardware: how to decrypt with a password and a server (Q2664944) (← links)
- Statistical ZAPs from group-based assumptions (Q2695645) (← links)
- Fully-succinct publicly verifiable delegation from constant-size assumptions (Q2695648) (← links)
- An adaptive quasi-Newton algorithm for eigensubspace estimation. (Q2734429) (← links)
- New Techniques for Non-interactive Shuffle and Range Arguments (Q2822687) (← links)
- Efficient IBE with Tight Reduction to Standard Assumption in the Multi-challenge Setting (Q2953791) (← links)
- The Kernel Matrix Diffie-Hellman Assumption (Q2958145) (← links)
- A New Paradigm for Public-Key Functional Encryption for Degree-2 Polynomials (Q5041154) (← links)
- Hierarchical Identity-Based Encryption with Tight Multi-challenge Security (Q5041156) (← links)
- On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness (Q5041170) (← links)
- On QA-NIZK in the BPK Model (Q5041171) (← links)
- QA-NIZK Arguments of Same Opening for Bilateral Commitments (Q5048959) (← links)
- Signatures of Knowledge for Boolean Circuits Under Standard Assumptions (Q5048960) (← links)
- Adaptive Partitioning (Q5270372) (← links)
- Improved Structure Preserving Signatures Under Standard Bilinear Assumptions (Q5738756) (← links)
- Equivalences and Black-Box Separations of Matrix Diffie-Hellman Problems (Q5738797) (← links)
- Unbounded inner product functional encryption from bilinear maps (Q5915907) (← links)
- Tightly secure hierarchical identity-based encryption (Q5919017) (← links)
- Minicrypt primitives with algebraic structure and applications (Q5925579) (← links)
- Almost tight multi-user security under adaptive corruptions \& leakages in the standard model (Q6085265) (← links)
- Tight lower bounds and optimal constructions of anonymous broadcast encryption and authentication (Q6101280) (← links)
- A Revocable Group Signature Scheme with Scalability from Simple Assumptions and Its Implementation (Q6108852) (← links)
- Traceable receipt-free encryption (Q6135436) (← links)
- Gentry-Wichs is tight: a falsifiable non-adaptively sound SNARG (Q6157544) (← links)
- Smooth zero-knowledge hash functions (Q6157605) (← links)
- CRS-updatable asymmetric quasi-adaptive NIZK arguments (Q6169455) (← links)
- Fine-grained secure attribute-based encryption (Q6176273) (← links)
- Almost Optimal Oblivious Transfer from QA-NIZK (Q6487220) (← links)
- Updatable Trapdoor SPHFs: Modular Construction of Updatable Zero-Knowledge Arguments and More (Q6488375) (← links)
- CCA Secure Attribute-Hiding Inner Product Encryption from Minimal Assumption (Q6488388) (← links)
- Partially-Fair Computation from Timed-Release Encryption and Oblivious Transfer (Q6488390) (← links)
- Encryption mechanisms for receipt-free and perfectly private verifiable elections (Q6547983) (← links)
- On black-box knowledge-sound commit-and-prove SNARKs (Q6562559) (← links)
