Resume
Personal Information
November 2010
Maria Striki
Technical Interests
Wireless, Mobile, Ad hoc, Cellular Networks, Routing algorithms, Mobile Computing, Multicast protocols,
Network and Computer Security, Key Management and Authentication, Algorithms and Optimization, Routing
Protocols, Secure Routing, Distributed Trust Models, Intrusion Detection, Socia l Networks, Information Systems,
Cybernetics, Cognitive Networks.
Areas of Expertise and Interest
For my PhD thesis, I got involved in the design of efficient and low cost key management architecture for
multicast communications, in a resource constrained, infrastructure-less, dynamic environment, such as this of
mobile ad-hoc networks (MANETs). My work focused mostly on: 1) the design, optimization, and performance
evaluation of multicast key generation and distribution protocols for MANETs (in both analytical and simulation
level), 2) entity authentication and access control algorithms , trust establishment, 3) cross-layer optimization and in
particular the interaction of scheduling with the routing layer, 4) the interaction of routing and mobility with key
management.
During my PhD studies at University of Maryland College Park, USA, and my almost three year work experience
at Telcordia Technologies Inc., New Jersey, I additionally got involved with the following projects and topics:
design and evaluation of (secure) routing algorithms, component based routing (CBR) for topology representation
and routing dissemination, design and optimization of algorithms (i.e. key management models, optimized routing
models, efficient topological structures for Intrusion Detection, etc.), propagation of trust in MANETs,
cryptography, mobile computing, clustering, wireless multicasting, cellular and ad hoc networks, Intrusion
Detection.
Computer Skills
Computer Languages: C, C++, Java, J2EE, Verilog, HTML, Ada, Prolog, Lisp, Perl, MATLAB.
Operating Systems: Unix, Linux, Microsoft Windows
Meta-Languages: XML, PHP
Software Packets: MATLAB, Mathematical, MS-Office, MS-Access, OPNET (beginner), NS-2 (some
experience).
Education
PhD in Electrical and Computer Engineering (October 2006)
University of Maryland, College Park
Thesis Title: Key Management: Towards the Design of a Secure, Efficient, Lightweight Framework for Secure
Group Communications in Large Mobile Ad Hoc Networks
Advisor: John S. Baras
MS in Electrical and Computer Engineering (May 2004)
University of Maryland, College Park
Thesis Title: Efficient Key Management Techniques for Securing Group Communications in Mobile Ad Hoc
Networks (MANETs)
Advisor: John S. Baras
BS (MS equivalent – 5 year) in Electrical and Computer Engineering (July 1999)
National Technical University of Athens (NTUA), Greece
Thesis Title: Location Area Planning
Advisors: M. Theologou, E. Protonotarios, E.Tzifa, P.Demestichas
High-school Degree -
Excellent - (June 1994)
st
1 Lyceum of Nea Smyrni, Athens, Greece
University of Maryland, College Park.
Degree: Ph.D., Department of Electrical and Computer Engineering, October 2006.
Thesis Title: “Key Management: Towards the Design of a Secure, Efficient, Lightweight Framework for
Secure Group Communications in Large Mobile Ad Hoc Networks “. My research focuses on the development
of autonomous, efficient, robust key management (KM) schemes for secure group communications, capable of
distributed operation where key infrastructure components are absent or inaccessible . We designed novel or
improved KM schemes that accomplish the following: (a) the extra overhead issued to secure the network is as
low as possible – our protocols present better performance than this of existing schemes for similar environments,
(b) they successfully handle network dynamics and failures, in networks with large number of nodes. We
contributed towards secure, scalable and efficient protocols with the design of two new Octopus-based protocols
(GDH.2-based MO and TGDH-based MOT), and the adaptation of the original Octopus (O) to MANETs. In
addition, we have contributed to the following: (1) extended a number of KM protocols to overcome failures with
low overhead, (2) used Elliptic Curves Cryptography (ECC) in the protocols studied to reduce the associated
communication and computation costs further, and promote more proactive scheme to deal with failures, and (3)
investigated the effects of a number of mobility models in the performance of our schemes and adapted a
lightweight leader election scheme, suitable for the Octopus-based protocols.
Implementations (Prototyping): Real-time implementation of (O) and MOT (Linux (kernel-2.4.18), and OpenSSL
library for symmetric key encryptio n (DES)), which includes both the basic functionality of the protocols for the
establishment of a multicast group key (including the multicast group formation) and also the response of the
protocols in cases of dynamic membership changes in the multicast group (detection of group change and new key
establishment). The presentation of the protocols is supported from a GUI and a user level multicast application
which encrypts, transmits, receives and decrypts multicast data (i.e. pictures), by utilizing the established group
keys of the protocols. The implementation is still on-going, as more functions are being gradually included to the
basic framework (i.e. entity authentication, access control, leader election).
Demos: CTA Review May ’03 - ‘05, CTA Demo Exhibitions Oct. ‘04, IEEE SECON Sept. ‘05.
- - - - - - - - - - - - - - - -- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Degree: M.S., Department of Electrical and Computer Engineering, April 2004.
Thesis Title: “Efficient Key Management Techniques for Securing Group Communications in Mobile Ad Hoc
Networks (MANETs)”. My thesis deals with the design and performance evaluation of novel or improved key
generation-distribution protocols for secure group communications in MANETs. We developed protocols
addressing the environments of Flat or Hierarchical MANETs separately. Among all, for Hierarchical MANETs,
we designed a 2-level Hybrid scheme that consists of various key generation protocols in combinations to
optimize a number of metrics of interest, such as bandwidth, routing, computation cost. This scheme exploits
battlefield diversity, and links key distribution to network topology and nodes’ mobility. For Flat MANETs, we
extended the 2d -Octopus protocol, by desig ning two novel schemes, MO and MOT. The particular features of
MOT, as well as the results of the comparative performance evaluation, show that this protocol not only improves
significantly its ancestor scheme, but outperforms a number of well-known key generation schemes as well.
Related graduate courses in UMD
?
?
?
?
?
?
?
?
?
?
?
?
Random Processes for Communication and Control
Information Theory
Computer Architecture, and Advanced Topics in Computer Architecture: Microarchitecture
Estimation and Detection Theory
Design of Distributed Computer Systems
Digital Signal Processing
Computer Aided Design of Digital Systems
Multi-user Communications
Network Security
Mathematical Foundations for Computer Systems, and Advanced Analysis of Algorithms
Advanced topics in Cryptography
Communications, Computer Architecture, and Bioengineering Seminars
Major Field: Communications, Minor Field: Computer Engineering, Department: ECE
Faculty Advisor: Prof. John S. Baras
Room #: 2247 AV.Williams Bldg,
Institute for Systems Research,
University of Maryland, College Park, 20742
Office phone: (301) 405 6606
Email: baras@isr.umd.edu
National Technical University of Athens, Athens, Greece.
Degree: B.S. (5 years – MS equivalent), Electrical and Computer Engineering Dept., June 1999
Diploma Thesis Title: “Location Area Planning”. My diploma thesis focuses on the design of Location Areas in
mobile wireless communications in such a way that the Total Communication Cost resulting from the Location
Update and Paging is minimized. Towards this end, we have explored and analyzed how Location Areas should be
interconnected with respect to the number of cells comprised in each, following and modifying basic principles
found in “Genetic Algorithms”.
Thesis Advisors: Prof. M.Theologou, Prof. E.M. Protonotarios, Dr. L.Tzifa, Dr P.Demestichas.
GPA: 9.12/10.0
Professional Experience
Rank: 4/230
Telcordia Technologies Inc, Piscataway, NJ
February 2007 – present
Senior Research Scientist – Advanced Technologies Department.
Projects
I have been participating to a number of government and/or commercial projects on:
(1) the design and implementation of optimized routing protocols, under the Component Based Routing (CBR)
theory consideration. CBR theory can be interpreted as designing and analyzing protocols from orthogonal
components. An example that highlights the usefulness of CBR can be the following: provide analytic modeling of
alternatives to Multi Point Relays (MPRs) in the standard MANET Optimized Link State Routing (OLSR) protocol.
Using the latter as starting point, among other contributions, we have modeled routing dissemination applying novel
distributed techniques based on Connected Dominating Sets (CDSs) and geometric properties of polygons.
(2) the design of optimized and robust algorithms (i.e., routing, clustering) under the consideration of incomplete,
erroneous, and outdated information. We have investigated the following issues: a) How to use perfect information
(i.e., given trajectories) to improve existing deterministic algorithms and how significant the improvement becomes
compared to the original deterministic algorithms and the improved versions using only abstract information, and b)
assuming that we do have abstract mobility information described from a probability distribution function (pdf),
how well we can we do (first define a general mobility distribution model based on the collected data).
(3) the design and analysis of topological structures suitable for efficient, scalable and robust cooperative Intrusion
Detection. We have introduced analytical expressions that map Intrusion Detection structures to the metric space of
real numbers. We provided formal analytical definitions for the quantification of detection latency and resiliency for
various types of hierarchical structures (i.e., trees, HCubes, rings, chains, etc.).
(4) enhancements to the IEEE 802.21 Events, Commands and Information Elements in order to support seamless
handoff in mobile ad hoc networks in future battlefield military networks. The approach reuses as much IEEE
802.21 proposed standards as possible. Presented an IEEE 802.21 framework to support integrated Soft Handoff in
Mobile ad hoc networks, with challenges, media independent handover (MIH) primitives and recommendations for
Service Access Points. Investigated and designed scenarios for demonstrating the capability of the IEEE 802.21
MIH Services in an ad hoc test bed based on NS2 models.
(5) security of wireless, mobile, and ad hoc networks and communications, intrusion detection techniques.
(6) the simulation (using C/C++) of the performance of a novel contributory group key management protocol
(PICO) that take into account the underlying routing, and makes routing and group decisions considering routing
and network issues such as proximity (Dijkstra routing algorithm is used to detect shortest paths), link weight (i.e.,
BER), path weight, response time-out, etc. (on-going).
(7) the patent reviewing project held at Telcordia, in collaboration with Intellectual Ventures (IV) (Claude Project).
We have reviewed patents with topics related to Key Management and Security. The work has been meticulous and
progressive, including weekly Telecons with the representative colleagues from IV, continual update of the Claude
project URL with information, useful input, and final justifia ble claim charts (having determined if and why such
claim charts can be drawn).
Proposal Writing
(1) EFIPSANS
The EFIPSANS project aims at exposing the features in IP version six protocols that can be exploited or extended
for the purposes of designing or building autonomic networks and services. The vision is that, the specified
autonomic behavior specifications, the identified exploitable IPv6 features and new protocol and architectural
extensions will one day be standardized in the long run (after the first 3 years of EFIPSANS) i.e. mature from being
drafts to standards. I am currently involved in the WPs that have to do with autonomic networking and autonomic
routing.
(2) ADAPT: A Framework for Dynamically Adapting Key Management.
ADAPT is a Technical proposal prepared for the Office of Naval Research (ONR). The topic addressed is the
following: What are the network models, architectures and policies offering the greatest flexibility to exercise cyber
power and cyber defense in a federated cyberspace where the cyber "global commons" has significant economic
value that must be protected and strategic risk that must be managed? Towards this end, we are proposing a
framework called Adapt to enable diverse Key Management Protocols to be used within the same network. Adapt
will provide an analysis capability to enable a mission planner to determine policy for dynamically switching
among Key Management Protocols. Adapt will also provide a distributed mission-time capability to make policybased decisions on the best key management protocol for the current situation and, when needed, either switch Key
Management Protocols or keep the currently operational Key management protocol and change its parameters.
Courses and Certifications at Telcordia
(1) Advanced Programming in Java Using Eclipse: 5 day course, Integrated Development Environment (IDE) - Eclipse
(2) J2EE programming: 5 day course, Programming in Java 2 Enterprise Edition
(3) LTE (Long Term Evolution) Essentials: 2 days course.
(4) Mastering LTE: 1 day course
(5) OPNET Training: 5 day OPNET Training: Introductory OPNET Training (3 days), Advanced OPNET training (2 days),
Bethesda, Maryland, OPNET Headquarters.
Institute for Systems Research, University of Maryland, College Park, MD
Sept. 1999 – Oct. 2006
Sept.’99-Oct. ’06: Graduate Research Assistant for ECE Dept. Conducted research in the areas of network
security, wireless communications, mobile ad hoc networks, multicasting, routing protocols.
Focused on the design of an efficient, lightweight framework for group communication in
MANETs.
Fall ’03:
Volunteer Teaching Fellow: Instructed recitation class for graduate course: ENEE620: “Random
Processes in Communication and Control”, generated and provided the solutions to weekly
homework assignments, graded homework and exams.
Sept.’99 - May. ’02: Graduate Class Projects: Emphasis on projects in the context of the following courses
among others: (a) Computer architecture and micro-architecture (simulated in C and Verilog the
execution of CPU microcode in a five stage pipeline, mapped the physical to virtual memory,
designed and tested new methods for improving the hit ratio of the cache, the latency of branch
prediction), (b) Computer Aided Design of Digital Systems (designed and implemented algorithms
that perform operations in random graphs: e.g. search for X-sized cliques or dominating sets), (c)
Digital Signal Processing (e.g. linear prediction: sampled signals, represented them with linear
models (ARMA), and reconstructed them with the appropriate decoders), (d) Mathematical
Foundations of Computer Algorithms (implemented and graphically represented the data structure
of Red-Black Trees).
Telcordia Technologies Inc., Piscataway, NJ
Summer Internship:
June 2005 – August 2005
Supervisors : Dr Giovanni Di Crescenzo, Dr Simon Tsang.
Worked on the general topic of Security. Worked on Key Management protocols for Group Communications, in
particular, and focused Diffie –Hellman based Key Agreement protocols (i.e. DH-KA). Extended a number of KA
protocols to include routing, under the assumption of a physical group member graph. Evaluated the combined
protocols, and proposed novel topology driven algorithms to improve their efficiency. The resulting protocols are
more efficient with respect to bandwidth and latency.
Summer Internship:
June 2004 – August 2004
Supervisors: Dr Giovanni Di Crescenzo, Dr Rajesh Talpade
Designed a novel backbone scheme that supports and enhances the execution of key management protocols for
group communications. The scheme is based on the generation of a virtual minimum spanning tree (VMST) over a
subset of network nodes, and results in that the dynamics of the network (failures, membership changes) are handled
more effectively, as VMST introduces hierarchy.
Undergraduate Experience:
National Technical Unversity of Athens (NTUA)
I was involved in various programming projects through which I developed skills and experience in a number of
programming languages and systems, in the context of the following coursework: Operating Systems,
Distributed Operating Systems, Data Base Design, Data Structures, (Advanced) Computer Programming,
Organization of Programming Languages, Low-Level Programming, Introduction to Artificial Intelligence,
Software Engineering, etc.
Computer Skills (obtained from Undergraduate Courses and Projects)
Computer Languages: FORTRAN, Assembly, Pascal, C/C++, Java, HTML, SQL, Ada, Prolog, Lisp.
Operating Systems: Unix, Microsoft Windows
Software: MATLAB, MS-Office, MS-Access
General Honors and Awards
? Ranked 17th out of 150,000 candidates in Panhellenic University Entrance Exams, and 8th in the Department of
Electrical Engineering and Computer Engineering of National Technical University of Athens, in 1994.
? National Scholarship Foundation Award for Excellent Performance on the University Undergraduate Courses
for the consecutive years of 1996, 1997, 1998.
? Hellenic Society of Mathematics Award for the years of 1989, 1991.
? Second Award of Excellence in Telecommunications by ERICSSON for my undergraduate Diploma Thesis on
Location Area Planning, Summer 2000.
Publications
Conferences
? Maria Striki, Tony McAuley. “Using Novel Distributed Heuristics on Hexagonal Connected Dominating Sets
to Model Routing Dissemination”, Procs of CTRQ 2010 (Best Paper Award), Glyfada, Athens, Greece, 13-19
June 2010.
? Maria Striki, Kyriakos Manousakis, Darrell Kindred, Dan Sterne, Geoff Lawler, Natalie Ivanic, George Tran.
“On the Quantification of Resiliency and Detection Latency of Intrusion Detection Structures”, accepted for
publication and presentation at MILCOM 2009, Boston, Massachusetts, 18-21 October 2009.
? Maria Striki, Tony McAuley. “Using Distributed Heuristics on Hexagonal Connected Dominating Sets to
Model Routing Dissemination in Future Force Networks”, Procs of the 5th Int’l Conference IWCMC’09,
Leipzig, Germany, June 21-24, 2009.
? Maria Striki, John Baras. “New Algorithms for the efficient design of topology-oriented Hypercube Protocols
in Multi-hop Ad Hoc Networks”, Procs of the Eight Int’l Conference on Networking ICN’09, Gosier,
Guadalupe, French Caribbean, 1-6 March, 2009.
? Maria Striki, Tony McAuley, Raquel Morera. “Modeling Topology Dissemination for Routing in Future
Force Networks”, Procs of MILCOM’08 Conference, San Diego, California, 17-19 November 2008.
? Maria Striki, John Baras, Kyriakos Manousakis. “New Algorithms for the efficient design of topology-oriented
Group Diffie Hellman Protocols in Multi-hop Ad Hoc Networks”, Sixth Int’l Symposium on Modeling and
Optimization in Mobile, Ad Hoc, and Wireless Networks - WiOpt’08, Beriln, Germany, 31 March – 4 April
2008.
? Maria Striki, Kyriakos Manousakis, John Baras. “Fault Tolerant Extension of Hypercube for Secure, Robust,
Group Communications”, Seventh international Conference on Networking, ICN’08, Cancun, Mexico, 13-18
April 2008.
? Maria Striki, John S. Baras, Giovanni Di Crescenzo. “Modeling Key Ag reement in Multi-hop Ad -Hoc
Networks “, Procs. of IWCMC’06, pp. 39-45, July 3-6, Vancouver, British Columbia, Canada, July 2006.
? Maria Striki, John Baras. “A Robust, Distributed TGDH-based Scheme for Secure Group Communications in
MANETs “, Procs. of ICC 2006 Conference, Istanbul, Turkey, June ’06.
? Maria Striki, John Baras. “Distributed Certification Authority Generation to Enhance Autonomous Key
Management for Group Communications in MANETs”, Army Science Conference (ASC)’04, Orlando, FL.
? Maria Striki, Giovanni Di Crescenzo. “Efficient Fault-Tolerant and Distributed Key Agreement for Secure
Group Communications for Arbitrary Deployment in MANETs ”, ASC ’04, Orlando, FL.
? Maria Striki, John Baras. "Towards Integrating Key Distribution with Entity Authentication for Efficient,
Scalable and Secure Group Communication in MANETs", ICC’04 Conference, Paris, France, June 2004
? Maria Striki, John Baras. "Efficient Scalable Key Agreement Protocols for Secure Multicast Communication
in MANETs", CTA ‘03 symposium, pp. 101-105, College Park MD, May 2003.
? Maria Striki, John Baras. “Key Distribution Protocols for Secure Multicast Communication Survivable in
MANETs”, IEEE MILCOM ‘03, Boston MA, October 2003.
? Maria Striki, John Baras. “Scalable and Fault-Tolerant Key Agreement Octopus Protocols for Secure
Multicast Communication in MANETs”, 37th Conference on Information Sciences and Systems (CISS ‘03),
Johns Hopkins, Baltimore MD, March 2003.
? Maria Striki, John Baras. “Two Level Hybrid Key Scheme for Efficient Key Distribution in MANETs“. ASC
’02 Procs, Orlando, FL.
? P.Demestichas, E.Tzifa, V.Demesticha, N.Georgantas, G.Kotsakis, M.Striki, M.Kilanioti, M.Anagnostou,
M.Theologou. “Control of the location update and paging signaling load in cellular systems by means of
planning tools”, VTC, 1999 - Fall. IEEE VTS 50th , Volume: 4 , 1999, Page(s): 2119 -2123 vol.4
Journals
? P.Demestichas, N.Georgantas, E.Tzifa, V.Demesticha, M.Striki, M.Kilanioti, M.Theologou.
“Computationally efficient algorithms for location area planning in future cellular systems”. Elsevier
Journals, Computer Communications 23(13): 1263-1280 (2000)
? Maria Striki, Tony McAuley. “Using Distributed Heuristics on Hexagonal Connected Dominating Sets to
Model Routing Dissemination in Future Force Networks”, submitted, passed 1st review round, awaiting for
the final outcome.
? Maria Striki, John S. Baras. “Topology Driven Key Agreement in Mobile Ad Hoc Networks “, under
preparation.
? Maria Striki, John Baras. "Efficient Scalable Key Agreement Protocols for Secure Multicast Communication
in MANETs", under preparation.
Technical Reports
? Maria Striki, John Baras. “New Algorithms for the efficient design of topology-oriented Key Agreement
Protocols in Multi-hop Ad Hoc Networks”, HyNet, TR_2006-13, August 2006.
? Maria Striki, John Baras. “Fault Tolerant Extension of Hypercube Algorithm for Efficient, Robust, Group
Communications in MANETs”, HyNet, TR_ 2005-108, October 2005.
? Maria Striki, John Baras, “A Robust, Distributed TGDH-based Scheme for Secure Group Communications in
MANETs”, Center of Satellite and Hybrid Communications (CSHCN), Institute for Systems Research (ISR)
TR_2005-97, July 2005.
? Maria Striki, John Baras. “Two-Level Hybrid Scheme for Efficient Key Distribution in Mobile Ad-Hoc
Networks and overview of key distribution protocols“. CSHCN, ISR TR_2003-17, Jan. 2003.
? Maria Striki, John Baras. “Scalable and Efficient Key Agreement Protocols for Secure Multicast
Communication in MANETs “. CSHCN, ISR TR_2002-62, Dec. 2002.
Demos
? M. Striki, K. Manousakis, J. Baras “Implementation of Octopus based Key Agreement Protocols”, IEEE
SECON’05 Conference, Santa Clara, CA, Sept. 2005.
? M. Striki, K. Manousakis, J. Baras “Implementation of Octopus based Key Agreement Protocols”, CTA
Conference 2005, Crystal City, VA, Jun. 2005 - CTA Conference 2004, University of Maryland University
College (UMBC), College Park, MD, May 2004.
Posters
? Maria Striki, John Baras, “Two Level Hybrid Key Scheme for Efficient Key Distribution in Mobile Ad -Hoc
Networks “, Army Science Conference (ASC) ’02, Orlando, FL.
Miscellaneous
Professional Services
Reviewer
Conferences: IEEE ICC, IEEE VTC, ACNS’05, WEMIC’06, EW’06, Mobile Summit’06 – ‘07, Mobicom’06,
WCNC’07, Sarnoff’08 – ‘09
Journals: IEEE Transactions in Wireless Communications, ETRI’07
Tutorials Chair for Sarnoff’08 Conference, Princeton, New Jersey, USA, April 2008.
Served as Tutorials’ Chair for the conference, and in addition actively contributed to various aspects undertaken by
the executive committee for the successful organization of the conference. Received a Recognition Award for
significantly contributing to the set up of the conference.
Personal Information
Nationality: Hellenic , European Union Citizen.
American Visa Status: H-1B
Languages: Greek (native), English (Fluently), French (Fluently), German (moderate), Spanish (elementary).
Memberships & Activities
?
Secretary: Hellenic Graduate Students Association (DIGENIS), University of Maryland, College Park,
2001.
?
Member: IEEE Communications Society, IEEE Computer Society, Electrical and Computer Engineering
?
Graduate Student Association (ECEGSA), University of Maryland, College Park, Hellenic Graduate
Students Association (DIGENIS).
Member: Technical Chamber of Greece.