Elisavet Konstantinou

Proceedings of the Progress in Cryptology - AFRICACRYPT 2024, 2024

2019

TNFS resistant families of pairing-friendly elliptic curves.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

2018

Generating pairing-friendly elliptic curve parameters using sparse families.

[BibT_eX]

[DOI]

J. Math. Cryptol., 2018

2017

Ordinary Pairing-Friendly Genus 2 Hyperelliptic Curves with Absolutely Simple Jacobians.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2017

2014

More Sparse Families of Pairing-Friendly Elliptic Curves.

[BibT_eX]

[DOI]

Proceedings of the Cryptology and Network Security - 13th International Conference, 2014

2013

An Efficient Constant Round ID-Based Group Key Agreement Protocol for Ad Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the Network and System Security - 7th International Conference, 2013

On the Efficient Generation of Generalized MNT Elliptic Curves.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Informatics - 5th International Conference, 2013

2012

What is your "birthday elliptic curve"?

[BibT_eX]

[DOI]

Heng Huat Chan

Chik How Tan

Finite Fields Their Appl., 2012

2011

Efficient cluster-based group key agreement protocols for wireless ad hoc networks.

[BibT_eX]

[DOI]

J. Netw. Comput. Appl., 2011

A Survey on Cluster-Based Group Key Agreement Protocols for WSNs.

[BibT_eX]

[DOI]

IEEE Commun. Surv. Tutorials, 2011

Constant round group key agreement protocols: A comparative study.

[BibT_eX]

[DOI]

Eleftheria Makri

Comput. Secur., 2011

Some remarks on the construction of class polynomials.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2011

Performance Evaluation of ID-based Group Key Agreement Protocols.

[BibT_eX]

[DOI]

Pavlos Kamparmpakis

Proceedings of the Sixth International Conference on Availability, 2011

2010

On the Efficient Generation of Prime-Order Elliptic Curves.

[BibT_eX]

[DOI]

J. Cryptol., 2010

A framework for identity privacy in SIP.

[BibT_eX]

[DOI]

Giorgos Karopoulos

J. Netw. Comput. Appl., 2010

Efficient Certification Path Discovery for MANET.

[BibT_eX]

[DOI]

Anastasia Douma

Marios Anagnostopoulos

EURASIP J. Wirel. Commun. Netw., 2010

Ramanujan's class invariants and their use in elliptic curve cryptography.

[BibT_eX]

[DOI]

Comput. Math. Appl., 2010

Revisiting WiMAX MBS security.

[BibT_eX]

[DOI]

Comput. Math. Appl., 2010

2009

A Cluster-Based Framework for the Security of Medical Sensor Environments.

[BibT_eX]

[DOI]

Proceedings of the Trust, 2009

2008

Binary tree based public-key management for Mobile Ad Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the 2008 5th International Symposium on Wireless Communication Systems, 2008

Cluster-based Group Key Agreement for Wireless Ad hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the The Third International Conference on Availability, 2008

Clustering Oriented Architectures in Medical Sensor Environments.

[BibT_eX]

[DOI]

Proceedings of the The Third International Conference on Availability, 2008

2007

Efficient generation of secure elliptic curves.

[BibT_eX]

[DOI]

Int. J. Inf. Sec., 2007

Agent-based Distributed Group Key Establishment in Wireless Sensor Networks.

[BibT_eX]

[DOI]

Ioannis Chatzigiannakis

Vasiliki Liagkou

Paul G. Spirakis

Proceedings of the 2007 International Symposium on a World of Wireless, 2007

2006

Design, Analysis and Performance Evaluation of Group Key Establishment in Wireless Sensor Networks.

[BibT_eX]

[DOI]

Ioannis Chatzigiannakis

Vasiliki Liagkou

Paul G. Spirakis

Proceedings of the Second Workshop on Cryptography for Ad-hoc Networks, 2006

2005

"Trust Engineering: " From Requirements to System Design and Maintenance - A Working National Lottery System Experience.

[BibT_eX]

[DOI]

Proceedings of the Information Security, 8th International Conference, 2005

2004

Generating Prime Order Elliptic Curves: Difficulties and Efficiency Considerations.

[BibT_eX]

[DOI]

Proceedings of the Information Security and Cryptology, 2004

Electronic National Lotteries.

[BibT_eX]

[DOI]

Proceedings of the Financial Cryptography, 2004

On the Use of Weber Polynomials in Elliptic Curve Cryptography.

[BibT_eX]

[DOI]

Proceedings of the Public Key Infrastructure, 2004

2003

On the Construction of Prime Order Elliptic Curves.

[BibT_eX]

[DOI]

Proceedings of the Progress in Cryptology, 2003

2002

A Software Library for Elliptic Curve Cryptography.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2002

On the Efficient Generation of Elliptic Curves over Prime Fields.

[BibT_eX]

[DOI]