Shorter quasi-adaptive NIZK proofs for linear subspaces
From MaRDI portal
(Redirected from Publication:1698397)
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
Cites work
- scientific article; zbMATH DE number 4191103 (Why is no real title available?)
- scientific article; zbMATH DE number 176565 (Why is no real title available?)
- scientific article; zbMATH DE number 1302836 (Why is no real title available?)
- scientific article; zbMATH DE number 2086698 (Why is no real title available?)
- scientific article; zbMATH DE number 1842484 (Why is no real title available?)
- A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- An algebraic framework for Diffie-Hellman assumptions
- Compactly hiding linear spans. Tightly secure constant-size simulation-sound QA-NIZK proofs and applications
- Disjunctions for Hash Proof Systems: New Constructions and Applications
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Dual-system simulation-soundness with applications to UC-PAKE and more
- Efficient (anonymous) compact HIBE from standard assumptions
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Hierarchical Predicate Encryption for Inner-Products
- Homomorphic Encryption and Signatures from Vector Decomposition
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- New directions in cryptography
- 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
- Quantum communication attacks on classical cryptographic protocols. (Invited talk)
- Quasi-adaptive NIZK for linear subspaces revisited
- Relatively-Sound NIZKs and Password-Based Key-Exchange
- Round-optimal password-based authenticated key exchange
- Secure Hybrid Encryption from Weakened Key Encapsulation
- Shorter IBE and signatures via asymmetric pairings
- Shorter quasi-adaptive NIZK proofs for linear subspaces
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- Structure-preserving signatures and commitments to group elements
- Switching lemma for bilinear tests and constant-size NIZK proofs for linear subspaces
- Tools for simulating features of composite order bilinear groups in the prime order setting
Cited in
(24)- Improved (almost) tightly-secure simulation-sound QA-NIZK with applications
- A Generic Construction of Integrated Secure-Channel Free PEKS and PKE
- CCA-secure ABE using tag and pair encoding
- Subversion-resistant quasi-adaptive NIZK and applications to modular zk-SNARKs
- Adaptively secure revocable hierarchical IBE from \(k\)-linear assumption
- Tight rank lower bounds for the Sherali-Adams proof system
- Switching lemma for bilinear tests and constant-size NIZK proofs for linear subspaces
- Shorter quasi-adaptive NIZK proofs for linear subspaces
- Compact NIZKs from standard assumptions on bilinear maps
- 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
- Shorter quadratic QA-NIZK proofs
- On black-box extension of a non-interactive zero-knowledge proof system for secret equality
- QANIZK for adversary-dependent languages and their applications
- Tag-based ABE in prime-order groups via pair encoding
- QA-NIZK arguments in asymmetric groups: new tools and new constructions
- Statistically consistent broadcast authenticated encryption with keyword search. Adaptive security from standard assumptions
- Non-interactive composition of sigma-protocols via Share-then-Hash
- Compactly hiding linear spans. Tightly secure constant-size simulation-sound QA-NIZK proofs and applications
- Compact NIZKs from standard assumptions on bilinear maps
- DAG-\( \Sigma \): a DAG-based sigma protocol for relations in CNF
- Revocable identity-based encryption with bounded decryption key exposure resistance: lattice-based construction and more
- A simple and efficient framework of proof systems for NP
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)
