Conferences in DBLP

(pairing)
2008 (conf/pairing/2008)

1. 
   Pairings in Trusted Computing. [Citation Graph (, )][DBLP]
   
   
2. 
   Pairing Lattices. [Citation Graph (, )][DBLP]
   
   
3. 
   The Uber-Assumption Family. [Citation Graph (, )][DBLP]
   
   
4. 
   Homomorphic Encryption and Signatures from Vector Decomposition. [Citation Graph (, )][DBLP]
   
   
5. 
   Hidden-Vector Encryption with Groups of Prime Order. [Citation Graph (, )][DBLP]
   
   
6. 
   The Hidden Root Problem. [Citation Graph (, )][DBLP]
   
   
7. 
   Evaluating Large Degree Isogenies and Applications to Pairing Based Cryptography. [Citation Graph (, )][DBLP]
   
   
8. 
   Computing the Cassels Pairing on Kolyvagin Classes in the Shafarevich-Tate Group. [Citation Graph (, )][DBLP]
   
   
9. 
   Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field. [Citation Graph (, )][DBLP]
   
   
10. 
    Constructing Pairing-Friendly Elliptic Curves Using Factorization of Cyclotomic Polynomials. [Citation Graph (, )][DBLP]
    
    
11. 
    A Generalized Brezing-Weng Algorithm for Constructing Pairing-Friendly Ordinary Abelian Varieties. [Citation Graph (, )][DBLP]
    
    
12. 
    Pairing-Friendly Hyperelliptic Curves with Ordinary Jacobians of Type y²=x⁵ax. [Citation Graph (, )][DBLP]
    
    
13. 
    Integer Variable chi-Based Ate Pairing. [Citation Graph (, )][DBLP]
    
    
14. 
    Pairing Computation on Twisted Edwards Form Elliptic Curves. [Citation Graph (, )][DBLP]
    
    
15. 
    Exponentiation in Pairing-Friendly Groups Using Homomorphisms. [Citation Graph (, )][DBLP]
    
    
16. 
    Generators for the l-Torsion Subgroup of Jacobians of Genus Two Curves. [Citation Graph (, )][DBLP]
    
    
17. 
    Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms. [Citation Graph (, )][DBLP]
    
    
18. 
    Pairings on Hyperelliptic Curves with a Real Model. [Citation Graph (, )][DBLP]
    
    
19. 
    Faster Implementation of eta-T Pairing over GF(3^m) Using Minimum Number of Logical Instructions for GF(3)-Addition. [Citation Graph (, )][DBLP]
    
    
20. 
    A Comparison between Hardware Accelerators for the Modified Tate Pairing over F_2^m and F_3^m. [Citation Graph (, )][DBLP]
    
    
21. 
    One-Round ID-Based Blind Signature Scheme without ROS Assumption. [Citation Graph (, )][DBLP]
    
    
22. 
    Tracing Malicious Proxies in Proxy Re-encryption. [Citation Graph (, )][DBLP]
    
    
23. 
    Security and Anonymity of Identity-Based Encryption with Multiple Trusted Authorities. [Citation Graph (, )][DBLP]