Shorter quasi-adaptive NIZK proofs for linear subspaces
From MaRDI portal
Publication:1698397
DOI10.1007/S00145-016-9243-7zbMATH Open1386.94078OpenAlexW2530441704WikidataQ113906168 ScholiaQ113906168MaRDI QIDQ1698397FDOQ1698397
Authors: C. S. Jutla, Arnab Roy 
Publication date: 15 February 2018
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-016-9243-7
Recommendations
- Shorter quasi-adaptive NIZK proofs for linear subspaces
- Quasi-adaptive NIZK for linear subspaces revisited
- Compactly hiding linear spans. Tightly secure constant-size simulation-sound QA-NIZK proofs and applications
- Switching lemma for bilinear tests and constant-size NIZK proofs for linear subspaces
- Improved (almost) tightly-secure simulation-sound QA-NIZK with applications
bilinear pairingssignaturesSXDHDLINdual-system IBEGroth-Sahai NIZKsquasi-adaptive non-interactive zero-knowledge (NIZK) proofs
Cites Work
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- New directions in cryptography
- Title not available (Why is that?)
- Title not available (Why is that?)
- Structure-preserving signatures and commitments to group elements
- A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
- Title not available (Why is that?)
- Advances in Cryptology – CRYPTO 2004
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- Secure Hybrid Encryption from Weakened Key Encapsulation
- Hierarchical Predicate Encryption for Inner-Products
- Title not available (Why is that?)
- Tools for simulating features of composite order bilinear groups in the prime order setting
- Shorter IBE and signatures via asymmetric pairings
- Quantum communication attacks on classical cryptographic protocols. (Invited talk)
- Advances in Cryptology - EUROCRYPT 2004
- Homomorphic Encryption and Signatures from Vector Decomposition
- Title not available (Why is that?)
- An algebraic framework for Diffie-Hellman assumptions
- Shorter quasi-adaptive NIZK proofs for linear subspaces
- Switching lemma for bilinear tests and constant-size NIZK proofs for linear subspaces
- Quasi-adaptive NIZK for linear subspaces revisited
- Round-optimal password-based authenticated key exchange
- Non-interactive and re-usable universally composable string commitments with adaptive security
- Non-malleability from malleability: simulation-sound quasi-adaptive NIZK proofs and CCA2-secure encryption from homomorphic signatures
- Dual-system simulation-soundness with applications to UC-PAKE and more
- Relatively-Sound NIZKs and Password-Based Key-Exchange
- Compactly hiding linear spans. Tightly secure constant-size simulation-sound QA-NIZK proofs and applications
- Efficient (anonymous) compact HIBE from standard assumptions
- Disjunctions for Hash Proof Systems: New Constructions and Applications
Cited In (24)
- A simple and efficient framework of proof systems for NP
- Shorter quadratic QA-NIZK proofs
- Shorter quasi-adaptive NIZK proofs for linear subspaces
- Switching lemma for bilinear tests and constant-size NIZK proofs for linear subspaces
- From polynomial IOP and commitments to non-malleable zkSNARKs
- Non-malleability from malleability: simulation-sound quasi-adaptive NIZK proofs and CCA2-secure encryption from homomorphic signatures
- Quasi-adaptive NIZK for linear subspaces revisited
- QA-NIZK arguments in asymmetric groups: new tools and new constructions
- Compact NIZKs from standard assumptions on bilinear maps
- Improved (almost) tightly-secure simulation-sound QA-NIZK with applications
- Compactly hiding linear spans. Tightly secure constant-size simulation-sound QA-NIZK proofs and applications
- Revocable identity-based encryption with bounded decryption key exposure resistance: lattice-based construction and more
- Adaptively secure revocable hierarchical IBE from \(k\)-linear assumption
- Subversion-resistant quasi-adaptive NIZK and applications to modular zk-SNARKs
- On black-box extension of a non-interactive zero-knowledge proof system for secret equality
- CCA-secure ABE using tag and pair encoding
- A Generic Construction of Integrated Secure-Channel Free PEKS and PKE
- Compact NIZKs from standard assumptions on bilinear maps
- Non-interactive composition of sigma-protocols via Share-then-Hash
- Statistically consistent broadcast authenticated encryption with keyword search. Adaptive security from standard assumptions
- Tight rank lower bounds for the Sherali-Adams proof system
- QANIZK for adversary-dependent languages and their applications
- Tag-based ABE in prime-order groups via pair encoding
- DAG-\( \Sigma \): a DAG-based sigma protocol for relations in CNF
This page was built for publication: Shorter quasi-adaptive NIZK proofs for linear subspaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1698397)
