Automated analysis of cryptographic assumptions in generic group models
From MaRDI portal
Recommendations
- Automated analysis of cryptographic assumptions in generic group models
- Automated unbounded analysis of cryptographic constructions in the generic group model
- The algebraic group model and its applications
- On the Equivalence of Generic Group Models
- Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems
Cited in
(15)- Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions
- Towards a classification of non-interactive computational assumptions in cyclic groups
- Optimal broadcast encryption from pairings and LWE
- Automated analysis of cryptographic assumptions in generic group models
- Design in type-I, run in type-III: fast and scalable bilinear-type conversion using integer programming
- The kernel matrix Diffie-Hellman assumption
- The Semi-Generic Group Model and Applications to Pairing-Based Cryptography
- The Exact Security of ECIES in the Generic Group Model
- Automated Reasoning
- Equivalences and black-box separations of matrix Diffie-Hellman problems
- Automated unbounded analysis of cryptographic constructions in the generic group model
- On the security of functional encryption in the generic group model
- Redeeming reset indifferentiability and applications to post-quantum security
- To label, or not to label (in generic groups)
- OneTwoPAKE: two-round strong asymmetric PAKE with ideal security
This page was built for publication: Automated analysis of cryptographic assumptions in generic group models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2874498)