Pages that link to "Item:Q5962223"
From MaRDI portal
The following pages link to Discrete logarithm problems with auxiliary inputs (Q5962223):
Displaying 23 items.
- Discrete logarithm problem using index calculus method (Q445390) (← links)
- Recent progress on the elliptic curve discrete logarithm problem (Q908041) (← links)
- Research on attacking a special elliptic curve discrete logarithm problem (Q1793291) (← links)
- How to solve DLOG problem with auxiliary input (Q1800721) (← links)
- PRE: stronger security notions and efficient construction with non-interactive opening (Q2015128) (← links)
- Verifiable random functions with optimal tightness (Q2061948) (← links)
- Counting fixed points and rooted closed walks of the singular map \(x \mapsto x^{x^n}\) modulo powers of a prime (Q2303901) (← links)
- Short signatures from Diffie-Hellman: realizing almost compact public key (Q2408586) (← links)
- (Q2778853) (← links)
- Multiple Discrete Logarithm Problems with Auxiliary Inputs (Q2811130) (← links)
- The discrete logarithm problem for exponents of bounded height (Q2878833) (← links)
- Finding elliptic curves with a subgroup of prescribed size (Q3179510) (← links)
- (Q3331305) (← links)
- (Q3360980) (← links)
- A new approach to the discrete logarithm problem with auxiliary inputs (Q3467665) (← links)
- Compact hierarchical identity-based encryption based on a harder decisional problem (Q5259051) (← links)
- Distribution and Polynomial Interpolation of the Dodis-Yampolskiy Pseudo-Random Function (Q5267798) (← links)
- Analysis on a generalized algorithm for the strong discrete logarithm problem with auxiliary inputs (Q5418497) (← links)
- A survey of elliptic curves for proof systems (Q6063127) (← links)
- Elliptic curve cryptography; applications, challenges, recent advances, and future trends: a comprehensive survey (Q6101318) (← links)
- A Revocable Group Signature Scheme with Scalability from Simple Assumptions and Its Implementation (Q6108852) (← links)
- Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier (Q6132419) (← links)
- Optimized and Secure Pairing-Friendly Elliptic Curves Suitable for One Layer Proof Composition (Q6488029) (← links)