Algebraic group model with oblivious sampling
From MaRDI portal
Publication:6587960
Recommendations
Cites work
- \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
- A subversion-resistant SNARK
- A unified framework for non-universal SNARKs
- Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model
- Algebraic distinguishers: from discrete logarithms to decisional Uber assumptions
- Algebraic group model with oblivious sampling
- An analysis of the algebraic group model
- Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
- Constant-Size Commitments to Polynomials and Their Applications
- Cryptography and Coding
- Efficient indifferentiable hashing into ordinary elliptic curves
- Efficient signature generation by smart cards
- Estimating the size of the image of deterministic hash functions to elliptic curves
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- How to Hash into Elliptic Curves
- scientific article; zbMATH DE number 1583798 (Why is no real title available?)
- scientific article; zbMATH DE number 176566 (Why is no real title available?)
- scientific article; zbMATH DE number 1024065 (Why is no real title available?)
- scientific article; zbMATH DE number 1942415 (Why is no real title available?)
- scientific article; zbMATH DE number 1942416 (Why is no real title available?)
- scientific article; zbMATH DE number 1842494 (Why is no real title available?)
- NIZKs with an untrusted CRS: security in the face of parameter subversion
- On subversion-resistant SNARKs
- Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
- Random oracles with(out) programmability
- Revisiting the Uber assumption in the algebraic group model: fine-grained bounds in hidden-order groups and improved reductions in bilinear groups
- Snarky ceremonies
- Square span programs with applications to succinct NIZK arguments
- The algebraic group model and its applications
- The Semi-Generic Group Model and Applications to Pairing-Based Cryptography
- The Uber-Assumption Family
- Tight state-restoration soundness in the algebraic group model
- To label, or not to label (in generic groups)
Cited in
(14)- Algebraic group model with oblivious sampling
- Lookup arguments: improvements, extensions and applications to zero-knowledge decision trees
- Constant-size zk-SNARKs in ROM from falsifiable assumptions
- Polymath: Groth16 is not the limit
- On knowledge-soundness of Plonk in ROM from falsifiable assumptions
- Efficiently-thresholdizable batched identity based encryption, with applications
- On extractability of the KZG family of polynomial commitment schemes
- The brave new world of global generic groups and UC-secure zero-overhead SNARKs
- Attention is still what you need: another round of exploring Shoup's GGM
- Plonk is simulation extractable in ROM under falsifiable assumptions
- Special soundness and binding properties: a framework for tightly secure zk-SNARKs
- The uber-knowledge assumption: a bridge to the AGM
- Revisiting discrete logarithm reductions
- The art of linearization: from a KZG's trick to a general commitment framework
This page was built for publication: Algebraic group model with oblivious sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6587960)
