The following pages link to (Q2739458):
Displaying 50 items.
- Faster Ate pairing computation on Selmer's model of elliptic curves (Q285904) (← links)
- Structure-preserving signatures and commitments to group elements (Q290392) (← links)
- Further refinements of Miller's algorithm on Edwards curves (Q300877) (← links)
- An ID-based authenticated dynamic group key agreement with optimal round (Q362177) (← links)
- An improved two-party identity-based authenticated key agreement protocol using pairings (Q414861) (← links)
- A round-optimal three-party ID-based authenticated key agreement protocol (Q425537) (← links)
- Provably-secure time-bound hierarchical key assignment schemes (Q431793) (← links)
- Reducing equational theories for the decision of static equivalence (Q437026) (← links)
- An XTR-based constant round key agreement scheme (Q474414) (← links)
- Efficient algorithms for secure outsourcing of bilinear pairings (Q476851) (← links)
- Fixed argument pairing inversion on elliptic curves (Q499662) (← links)
- A pairing-based publicly verifiable secret sharing scheme (Q545465) (← links)
- Provably secure identity-based authenticated key agreement protocols with malicious private key generators (Q621645) (← links)
- Efficient selective identity-based encryption without random oracles (Q656924) (← links)
- Multi-party authenticated key agreement protocols from multi-linear forms (Q702645) (← links)
- An identity-based strongly unforgeable signature without random oracles from bilinear pairings (Q726463) (← links)
- Multi-designated verifiers signatures: anonymity without encryption (Q845986) (← links)
- A comparison of MNT curves and supersingular curves (Q862563) (← links)
- Cryptanalysis of tripartite and multi-party authenticated key agreement protocols (Q867668) (← links)
- A survey of fault attacks in pairing based cryptography (Q892296) (← links)
- Implementing optimized pairings with elliptic nets (Q893619) (← links)
- Spreading alerts quietly and the subgroup escape problem (Q901371) (← links)
- Tate and Ate pairings for \(y^2=x^5-\alpha x\) in characteristic five (Q957691) (← links)
- Rogue-key attacks on the multi-designated verifiers signature scheme (Q963405) (← links)
- Comparing two pairing-based aggregate signature schemes (Q970534) (← links)
- On the embedding degree of reductions of an elliptic curve (Q989443) (← links)
- Pairings for cryptographers (Q1003698) (← links)
- On bilinear structures on divisor class groups (Q1017359) (← links)
- Using abelian varieties to improve pairing-based cryptography (Q1027984) (← links)
- Direct chosen-ciphertext secure identity-based key encapsulation without random oracles (Q1034629) (← links)
- A secure and scalable group key exchange system (Q1041738) (← links)
- Pairing-based cryptography on elliptic curves (Q1616164) (← links)
- Towards breaking the exponential barrier for general secret sharing (Q1648814) (← links)
- Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications (Q1688406) (← links)
- Solving discrete logarithms on a 170-bit MNT curve by pairing reduction (Q1698673) (← links)
- Parallelizing pairings on Hessian elliptic curves (Q1713870) (← links)
- Computing discrete logarithms in \(\mathbb F_{p^6}\) (Q1746956) (← links)
- An optimal Tate pairing computation using Jacobi quartic elliptic curves (Q1752615) (← links)
- Secure simultaneous bit extraction from Koblitz curves (Q1755988) (← links)
- Efficient identity-based authenticated key agreement protocol from pairings (Q1763263) (← links)
- New identity-based society oriented signature schemes from pairings on elliptic curves (Q1765412) (← links)
- A one round protocol for tripartite Diffie-Hellman (Q1772225) (← links)
- Efficient algorithms for Koblitz curves over fields of characteristic three (Q1775021) (← links)
- Indiscreet logarithms in finite fields of small characteristic (Q1783724) (← links)
- Converting pairing-based cryptosystems from composite to prime order setting -- a comparative analysis (Q1787193) (← links)
- A self-pairing map and its applications to cryptography (Q1827010) (← links)
- Provably secure and efficient certificateless authenticated tripartite key agreement protocol (Q1931046) (← links)
- Security weaknesses of authenticated key agreement protocols (Q1944114) (← links)
- Faster pairing computation on genus \(2\) hyperelliptic curves (Q1944931) (← links)
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification (Q2056782) (← links)
