Home

    2011
  • Oblivious Transfer with Hidden Access Control Policies
    J. Camenisch, M. Dubovitskaya, G. Neven and G. M. Zaverucha
    Proceedings of PKC 2011.

  • Short One-Time Signatures
    G. M. Zaverucha and D. R. Stinson
    Advances in Mathematics of Communications 3 (2011), 473--488. (preprint)


    • 2010
  • Constant-Size Commitments to Polynomials and Their Applications
    A. Kate, G. M. Zaverucha and I. Goldberg
    Proceedings of ASIACRYPT 2010. (preprint)

  • Pairing-Based Onion Routing with Improved Forward Secrecy
    A. Kate, G. M. Zaverucha and I. Goldberg
    ACM TISSEC 13 (2010). (preprint)

  • Anonymity in Shared Symmetric Key Primitives
    G. M. Zaverucha and D. R. Stinson
    Designs, Codes and Cryptography 57 (2010), 139-160. (preprint)


    • 2009
  • Group Testing and Batch Verification
    G. M. Zaverucha and D. R. Stinson
    Proceedings of the 4th International Conference on
    Information Theoretic Security, ICITS 2009 (preprint)

  • Private Intersection of Certified Sets
    J. Camenisch and G. M. Zaverucha
    Proceedings of Financial Cryptography and Data Security, FC'09. (preprint)

  • Cryptographic Protocols of the Identity Mixer Library, v. 1.0
    P. Bichsel, C. Binding, J. Camenisch, T. Groß, T. Heydt-Benjamin,
    D. Sommer, and G.M. Zaverucha.
    IBM Research Report RZ3730, IBM Research, March 2009.


    • 2008
  • A Bound on the Size of Separating Hash Families
    S. R. Blackburn, T. Etzion, D. R. Stinson and G. M. Zaverucha
    Journal of Combinatorial Theory, Series A 115 (2008), 1246-1256. (preprint)

  • Some Improved Bounds for Secure Frameproof Codes and Related Separating
    Hash Families
    D. R. Stinson and G. M. Zaverucha
    IEEE Transactions on Information Theory 54 (2008), 2508-2514. (preprint)


    • 2007
  • On the Complexity of Katamari Damacy
    G. M. Zaverucha
    ACM Crossroads, Winter 2007 issue. (pdf)

  • New Bounds for Generalized Separating Hash Families
    D. R. Stinson and G. M. Zaverucha
    CACR Technical Report 2007-21 (pdf)

  • Bluetooth Wireless Privacy (Poster)
    R. H. Warren and G. M. Zaverucha
    UW Graduate Student Research Conference (GSRC 2007)

  • Anonymity and Security in Delay Tolerant Networks
    A. Kate, G. M. Zaverucha and U. Hengartner
    SecureComm 2007 (preprint)

  • Pairing-Based Onion Routing
    A. Kate, G. M. Zaverucha and I. Goldberg
    Privacy Enhancing Technologies Symposium, PET 2007. (preprint)

  • Web Based Health Recommender System Using Rough Sets, Survival Analysis and
    Rule-Based Expert Systems
    P. Pattaraintakorn, G. M. Zaverucha and N. Cercone
    The 11th International Conference on Rough Sets, Fuzzy Sets, Data Mining and
    Granular Computing 2007, LNAI 4482, 491-499.

    • 2006
  • Generalized Mersenne Numbers in Pairing-Based Cryptography
    G. M. Zaverucha
    MCS Thesis, Faculty of Computer Science, Dalhousie University (PDF)

    • 2005
  • Voronoi Tesselations of Proteins for Computing Contact Maps
    G. M. Zaverucha
    Technical Report CS-2005-07, Faculty of Computer Science, Dalhousie University

  • Approximating Polylines by Curved Paths
    G. M. Zaverucha
    Proceedings of ICMA 2005, IEEE International Conference on Mechatronics and Automation

  • Efficient Pairing-Based Cryptography
    G. M. Zaverucha and V. Keselj
    Proceedings of DCSI'05: Dalhousie Computer Science In-House Conference

    • 2004
  • Speeding the Elliptic Curve Method for Factoring Integers of a Special Form
    G. M. Zaverucha
    Honours Thesis, Department of Mathematics and Computer Science, Laurentian University