On the Equivalence of Generic Group Models
From MaRDI portal
Recommendations
Cites work
- A method for obtaining digital signatures and public-key cryptosystems
- A monte carlo method for factorization
- Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model
- Advances in cryptology - ASIACRYPT 2000. 6th international conference on the Theory and application of cryptology and information security, Kyoto, Japan, December 3--7, 2000. Proceedings
- Algorithms for black-box fields and their application to cryptography
- Another look at generic groups
- Complexity of a determinate algorithm for the discrete logarithm
- Cryptography and Coding
- Generic groups, collision resistance, and ECDSA
- scientific article; zbMATH DE number 1583771 (Why is no real title available?)
- scientific article; zbMATH DE number 1583798 (Why is no real title available?)
- scientific article; zbMATH DE number 3956969 (Why is no real title available?)
- scientific article; zbMATH DE number 1303114 (Why is no real title available?)
- scientific article; zbMATH DE number 2086711 (Why is no real title available?)
- scientific article; zbMATH DE number 1406786 (Why is no real title available?)
- New directions in cryptography
- On Black-Box Ring Extraction and Integer Factorization
- On the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms
- Short signatures without random oracles and the SDH assumption in bilinear groups
- The Exact Security of ECIES in the Generic Group Model
Cited in
(29)- The algebraic group model and its applications
- Generic-group delay functions require hidden-order groups
- A group theoretic approach to model comparison with simplicial representations
- Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions
- On the multi-user security of short Schnorr signatures with preprocessing
- On the analysis of cryptographic assumptions in the generic ring model
- Automated analysis of cryptographic assumptions in generic group models
- Automated analysis of cryptographic assumptions in generic group models
- Black-box models of computation in cryptology.
- Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems
- On the analysis of cryptographic assumptions in the generic ring model
- scientific article; zbMATH DE number 3915997 (Why is no real title available?)
- scientific article; zbMATH DE number 1303114 (Why is no real title available?)
- Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model
- scientific article; zbMATH DE number 2086711 (Why is no real title available?)
- Automated unbounded analysis of cryptographic constructions in the generic group model
- Cryptography and Coding
- The One-More Discrete Logarithm Assumption in the Generic Group Model
- Generic models for group actions
- On the security of functional encryption in the generic group model
- How to obfuscate MPC inputs
- To label, or not to label (in generic groups)
- Beyond Uber: instantiating generic groups via PGGs
- An analysis of the algebraic group model
- Generic-group lower bounds via reductions between geometric-search problems: with and without preprocessing
- The relationship between idealized models under computationally bounded adversaries
- Generic and algebraic computation models: when AGM proofs transfer to the GGM
- Quantum complexity for discrete logarithms and related problems
- Quantum money from abelian group actions
This page was built for publication: On the Equivalence of Generic Group Models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5505469)
