An analysis of the algebraic group model
From MaRDI portal
Recommendations
- The algebraic group model and its applications
- On instantiating the algebraic group model from falsifiable assumptions
- Tight reductions for Diffie-Hellman variants in the algebraic group model
- On the Equivalence of Generic Group Models
- A classification of computational assumptions in the algebraic group model
Cites work
- A classification of computational assumptions in the algebraic group model
- Algebraic adversaries in the universal composability framework
- Algebraic distinguishers: from discrete logarithms to decisional Uber assumptions
- An algebraic framework for universal and updatable SNARKs
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
- Breaking RSA may not be equivalent to factoring
- Complexity of a determinate algorithm for the discrete logarithm
- Cryptography and Coding
- Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
- Mathematics of public key cryptography.
- Monte Carlo Methods for Index Computation (mod p)
- New directions in cryptography
- On pairing-free blind signature schemes in the algebraic group model
- On the security of time-lock puzzles and timed commitments
- The algebraic group model and its applications
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Tight reductions for Diffie-Hellman variants in the algebraic group model
- Tight state-restoration soundness in the algebraic group model
- To label, or not to label (in generic groups)
- Universally composable relaxed password authenticated key exchange
Cited in
(22)- The algebraic group model and its applications
- A classification of computational assumptions in the algebraic group model
- On instantiating the algebraic group model from falsifiable assumptions
- Tight reductions for Diffie-Hellman variants in the algebraic group model
- Algebraic adversaries in the universal composability framework
- Practical Schnorr threshold signatures without the algebraic group model
- On black-box knowledge-sound commit-and-prove SNARKs
- Generic-group lower bounds via reductions between geometric-search problems: with and without preprocessing
- Limits in the provable security of ECDSA signatures
- Algebraic group model with oblivious sampling
- Vector commitments with proofs of smallness: short range proofs and more
- Constant-size zk-SNARKs in ROM from falsifiable assumptions
- Generic and algebraic computation models: when AGM proofs transfer to the GGM
- On knowledge-soundness of Plonk in ROM from falsifiable assumptions
- A fully-adaptive threshold partially-oblivious PRF
- Updatable public key encryption with strong CCA security: security analysis and efficient generic construction
- The brave new world of global generic groups and UC-secure zero-overhead SNARKs
- A complete characterization of one-more assumptions in the algebraic group model
- The structured generic-group model
- Simple two-message OT in the explicit isogeny model
- The uber-knowledge assumption: a bridge to the AGM
- Hashing in generic groups: completing the AGM-to-GGM transfer
This page was built for publication: An analysis of the algebraic group model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6175979)