Dr Mark Manulis is Associate Professor (Senior Lecturer) at the Department of Computing of the University of Surrey.
Prior to this appointment he served as Assistant Professor (Juniorprofessor) at the Department of Computer Science of the Technische Universität Darmstadt, where he continues heading the Cryptographic Protocols Group. As Principal Investigator he is further associated with the Center for Advanced Security Research Darmstadt (CASED) and the European Center for Security and Privacy by Design (EC SPRIDE).
Mark obtained his PhD in the area of cryptography and information security from the Ruhr-Universität Bochum and spent his post-doc time with the UCL Crypto Group at the Microelectronics Laboratory of the Université catholique de Louvain. He holds Dipl.-Inform. and M.Sc. degrees in computer science from the Technische Universität Braunschweig.
Mark serves on program committees of international conferences and workshops in information security and cryptography. He is general chair of CANS 2012, general co-chair of PKC 2012, and is involved in editorial boards of Elsevier's COMCOM and ISTR journals.
Mark's research interests include authentication and key management, anonymity and privacy, design and formal analysis of cryptographic protocols, network security, security in distributed systems, wireless networks, and user-centric security.
Please refer for full information to his personal academic website: www.manulis.eu
We propose a security model, referred as g-eCK model, for group key exchange that captures essentially all non-trivial leakage of static and ephemeral secret keys of participants, i.e., group key exchange version of extended Canetti-Krawczyk (eCK) model. Moreover, we propose the first one-round tripartite key exchange (3KE) protocol secure in the g-eCK model under the gap Bilinear Diffie-Hellman (gap BDH) assumption and in the random oracle model.
Gorantla MC, Boyd C, Nieto JMG, Manulis M.
(2011) 'Modeling Key Compromise Impersonation Attacks on Group Key Exchange Protocols'. ACM ACM Transactions on Information and Systems Security (TISSEC), 14 (4) Article number 28
Gajek S, Manulis M, Schwenk J.
(2009) 'User-Aware Provably Secure Protocols for Browser-Based Mutual Authentication'. Inderscience International Journal of Applied Cryptography (IJACT), 1 (4), pp. 290-308.
Bresson E, Manulis M.
(2008) 'Securing Group Key Exchange against Strong Corruptions and Key Registration Attacks'. Inderscience International Journal of Applied Cryptography (IJACT), 1 (2), pp. 91-107.
Robert R, Manulis M, Villenfagne FD, Leroy D, Jost J, Koeune F, Ker C, Dinant J-M, Poullet Y, Bonaventure O, Quisquater J-J.
(2008) 'WiFi Roaming: Legal Implications and Security Constraints'. Oxford University Press International Journal of Law and Information Technology, 16 (3), pp. 205-241.
Fleischhacker N, Günther F, Kiefer F, Manulis M, Poettering B.
(2013) 'Pseudorandom Signatures'. ACM 8th ACM Symposium on Information, Computer and Communications Security (ASIACCS 2013), Hangzhou, China: , pp. 107-118.
Nieto JMG, Manulis M, Sun D.
(2012) 'Fully Private Revocable Predicate Encryption'. Springer 17th Australasian Conference on Information Security and Privacy (ACISP 2012), Wollongong, NSW, Australia: 17th Australasian Conference, ACISP 2012 7372, pp. 350-363.
We introduce the concept of Revocable Predicate Encryption (RPE), which extends current predicate encryption setting with revocation support: private keys can be used to decrypt an RPE ciphertext only if they match the decryption policy (defined via attributes encoded into the ciphertext and predicates associated with private keys) and were not revoked by the time the ciphertext was created.
We formalize the notion of attribute hiding in the presence of revocation and propose an RPE scheme, called AH-RPE, which achieves attribute-hiding under the Decision Linear assumption in the standard model.
We then present a stronger privacy notion, termed full hiding, which further cares about privacy of revoked users. We propose another RPE scheme, called FH-RPE, that adopts the Subset Cover Framework and offers full hiding under the Decision Linear assumption in the standard model. The scheme offers very flexible privacy-preserving access control to encrypted data and can be used in sender-local revocation scenarios.
Fujioka A, Manulis M, Suzuki K, Ustaoglu B.
(2012) 'Sufficient Condition for Ephemeral Key-Leakage Resilient Tripartite Key Exchange'. Springer 17th Australasian Conference on Information Security and Privacy (ACISP 2012), 7372, pp. 15-28.
Stelle S, Manulis M, Hollick M.
(2012) 'Topology-Driven Secure Initialization in Wireless Sensor Networks: A Tool-Assisted Approach'. IEEE Computer Society 7th International Conference on International Conference on Availability, Reliability and Security (ARES 2012), Prague: ARES 2012, pp. 28-37.
Nieto JMG, Manulis M, Poettering B, Rangasamy J, Stebila D.
(2012) 'Publicly Verifiable Ciphertexts'. Springer 8th International Conference on Security and Cryptography for Networks (SCN 2012), Amalfi, Italy: 8th International Conference, SCN 2012 7485, pp. 393-410.
In many applications where encrypted traffic flows from an open (public) domain to a protected (private) domain there exists a gateway that bridges the two domains and faithfully forwards the incoming traffic to the receiver. We observe that indistinguishability against (adaptive) chosen-ciphertext attacks (IND-CCA), which is a mandatory goal in face of active attacks in a public domain, can be essentially relaxed to indistinguishability against chosen-plaintext attacks (IND-CPA) for ciphertexts once they pass the gateway that acts as an IND-CCA/CPA filter, by first checking the validity of an incoming IND-CCA ciphertext, then transforming it (if valid) into an IND-CPA ciphertext, and finally forwarding the latter to the recipient in the private domain. “Non-trivial filtering” can result in reduced decryption costs on the receiver’s side.
We identify a class of encryption schemes with publicly verifiable ciphertexts that admit generic constructions of (non-trivial) IND-CCA/ CPA filters. These schemes are characterized by existence of public algorithms that can distinguish between valid and invalid ciphertexts. To this end, we formally define (non-trivial) public verifiability of ciphertexts for general encryption schemes, key encapsulation mechanisms, and hybrid encryption schemes, encompassing public-key, identity-based, and tag-based encryption flavors. We further analyze the security impact of public verifiability and discuss generic transformations and concrete constructions that enjoy this property.
Fan CI, Hsu RH, Manulis M.
(2011) 'Group Signature with Constant Revocation Costs for Signers and Verifiers'. Springer Lecture Notes in Computer Science: Cryptology and Network Security, Sanya, China: 10th CANS 2011 7092, pp. 214-233.
Fischlin M, Libert B, Manulis M.
(2011) 'Non-Interactive and Re-Usable Universally Composable String Commitments with Adaptive Security'. Springer Lecture Notes in Computer Science: Advances in Cryptology – ASIACRYPT 2011, Seoul, South Korea: 17th International Conference on the Theory and Application of Cryptology and Information Security 7073, pp. 468-485.
Manulis M, Steiner M.
(2011) 'UPBA: User-Authenticated Property-Based Attestation'. IEEE Proceedings of 9th Annual International Conference on Privacy, Security and Trust, Montreal, Canada: 9th PST 2011, pp. 112-119.
Günther F, Manulis M, Strufe T.
(2011) 'Key Management in Distributed Online Social Networks'. IEEE Proceedings of 2011 IEEE International Symposium on a World of Wireless, Mobile, and Multimedia Networks, Tuscany, Italy: 12th IEEE WOWMOM 2011, pp. 1-7.
Manulis M, Poettering B.
(2011) 'Affiliation-Hiding Authentication with Minimal Bandwidth Consumption'. Springer 5th IFIP WG 11.2 International Workshop on Information Security Theory and Practice (WISTP 2011), pp. 85-99.
Cristofaro ED, Manulis M, Poettering B.
(2011) 'Private Discovery of Common Social Contacts'. Springer Berlin Heidelberg LNCS Applied Cryptography and Network Security - 9th International Conference, ACNS 2011, Nerja, Spain: 9th International Conference on Applied Cryptography and Network Security (ACNS 2011) 6715, pp. 147-165.
The increasing use of computing devices for social interactions propels the proliferation of online social applications, yet, it prompts a number of privacy concerns. One common problem occurs when two unfamiliar users, in the process of establishing social relationships, want to assess their social proximity by discovering mutual contacts. In this paper, we introduce Private Contact Discovery, a novel cryptographic primitive that lets two users, on input their respective contact lists, learn their common contacts (if any), and nothing else. We present an efficient and provably secure construction, that (i) prevents arbitrary list manipulation by means of contact certification, and (ii) guarantees user authentication and revocability. Following a rigorous cryptographic treatment of the problem, we define the privacy-protecting contact-hiding property and prove it for our solution, under the RSA assumption in the Random Oracle Model (ROM). We also show that other related cryptographic techniques, such as Private Set Intersection and Secret Handshakes, are unsuitable in this context. Experimental analysis attests to the practicality of our technique, which achieves computational and communication overhead (almost) linear in the number of contacts.
Günther F, Manulis M, Strufe T.
(2011) 'Cryptographic Treatment of Private User Profiles'. Springer Berlin Heidelberg Financial Cryptography and Data Security. Lecture Notes in Computer Science, St Lucia: 15th International Conference on Financial Cryptography and Data Security (FC 2011), RLCPS 7126, pp. 40-54.
The publication of private data in user profiles in a both secure and private way is a rising problem and of special interest in, e.g., online social networks that become more and more popular. Current approaches, especially for decentralized networks, often do not address this issue or impose large storage overhead. In this paper, we present a cryptographic approach to Private Profile Management that is seen as a building block for applications in which users maintain their own profiles, publish and retrieve data, and authorize other users to access different portions of data in their profiles. In this course, we provide: (i) formalization of confidentiality and unlinkability as two main security and privacy goals for the data which is kept in profiles and users who are authorized to retrieve this data, and (ii) specification, analysis, and comparison of two private profile management schemes based on different encryption techniques
Manulis M, Poettering B.
(2011) 'Practical Affiliation-Hiding Authentication from Improved Polynomial Interpolation'. ACM ASIACCS 2011, Hong Kong: 6th ACM Symposium on Information, Computer and Communications Security, pp. 286-295.
Among the plethora of privacy-friendly authentication techniques, affiliation-hiding (AH) protocols are valuable for their ability to hide not only identities of communicating users behind their affiliations (memberships to groups), but also these affiliations from non-members. These qualities become increasingly important in our highly computerized user-centric information society, where privacy is an elusive good.
Only little work on practical aspects of AH schemes, pursuing optimized implementations and deployment, has been done so far, and the main question a practitioner might ask --- whether affiliation-hiding schemes are truly practical today --- remained widely unanswered. Improving upon recent advances in the area of AH protocols, in particular on pioneering results in the multi-affiliation setting, we can give an affirmative answer to this question. To this end, we propose numerous algorithmic optimizations to a recent AH scheme leading to a remarkable performance gain. Our results are demonstrated not only at theoretical level, but we also offer implementations, performance measurements, and comparisons. At the same time, our improvements advance the area of efficient polynomial interpolation in finite fields, which is one of our building blocks.
Dent AW, Fischlin M, Manulis M, Stam M, Schröder D.
(2010) 'Confidential Signatures and Deterministic Signcryption'. Springer 13th International Conference on Practice and Theory in Public Key Cryptography (PKC 2010), 6056, pp. 462-479.
Galindo D, Libert B, Fischlin M, Fuchsbauer G, Lehmann A, Manulis M, Schröder D.
(2010) 'Public-Key Encryption with Non-interactive Opening: New Constructions and Stronger Definitions'. Springer AFRICACRYPT 2010, 6055, pp. 333-350.
Abdalla M, Chevalier C, Manulis M, Pointcheval D.
(2010) 'Flexible Group Key Exchange with On-Demand Computation of Subgroup Keys'. Springer Berlin Heidelberg AFRICACRYPT 2010, Stellenbosch, South Africa: Third International Conference on Cryptology in Africa AFRICACRYPT 2010 6055, pp. 351-368.
Modern multi-user communication systems, including popular instant messaging tools, social network platforms, and cooperative-work applications, offer flexible forms of communication and exchange of data. At any time point concurrent communication sessions involving different subsets of users can be invoked. The traditional tool for achieving security in a multi-party communication environment are group key exchange (GKE) protocols that provide participants with a secure group key for their subsequent communication. Yet, in communication scenarios where various user subsets may be involved in different sessions the deployment of classical GKE protocols has clear performance and scalability limitations as each new session should be preceded by a separate execution of the protocol. The motivation of this work is to study the possibility of designing more flexible GKE protocols allowing not only the computation of a group key for some initial set of users but also efficient derivation of independent secret keys for all potential subsets. In particular we improve and generalize the recently introduced GKE protocols enabling on-demand derivation of peer-to-peer keys (so called GKE+P protocols). We show how a group of users can agree on a secret group key while obtaining some additional information that they can use on-demand to efficiently compute independent secret keys for any possible subgroup. Our security analysis relies on the Gap Diffie-Hellman assumption and uses random oracles.
Manulis M, Poettering B, Tsudik G.
(2010) 'Affiliation-Hiding Key Exchange with Untrusted Group Authorities'. Applied Cryptography and Network Security (ACNS 2010), , pp. 402-419.
Christin D, Hollick M, Manulis M.
(2010) 'Security and Privacy Objectives for Sensing Applications in Wireless Community Networks'. IEEE Computer Society Proceedings of 19th International Conference on Computer Communications and Networks (ICCCN 2010), , pp. 1-6.
(2010) 'Privacy-Preserving Admission to Mobile Peer-to-Peer Groups'. IEEE Computer Society 8th IEEE International Conference on Pervasive Computing and Communications (PerCom 2010), , pp. 111-116.
Manulis M, Poettering B, Tsudik G.
(2010) 'Taming Big Brother Ambitions: More Privacy for Secret Handshakes'. Privacy Enhancing Technologies, , pp. 149-165.
Manulis M, Pinkas B, Poettering B.
(2010) 'Privacy-Preserving Group Discovery with Linear Complexity'. Applied Cryptography and Network Security (ACNS 2010), , pp. 420-437.
Brzuska C, Busch H, Dagdelen Ö, Fischlin M, Franz M, Katzenbeisser S, Manulis M, Onete C, Peter A, Poettering B, Schröder D.
(2010) 'Redactable Signatures for Tree-Structured Data: Definitions and Constructions'. Applied Cryptography and Network Security (ACNS 2010), , pp. 87-104.
Bresson E, Brecher T, Manulis M.
(2009) 'Fully Robust Tree-Diffie-Hellman Group Key Exchange'. Springer Proceedings of the 8th International Conference on Cryptology and Network Security (CANS 2009), Kanazawa, Ishikawa, Japan: Cryptology and Network Security, 8th International Conference LNCS 5888, pp. 478-497.
(2009) 'Group Key Exchange Enabling On-Demand Derivation of Peer-to-Peer Keys'. Springer-Verlag Proceedings of the 7th International Conference on Applied Cryptography and Network Security (ACNS 2009), Paris-Rocquencourt, France: Applied Cryptography and Network Security: 7th International Conference LNCS 5536, pp. 1-19.
Gorantla MC, Boyd C, Nieto JMG, Manulis M.
(2009) 'Generic One Round Group Key Exchange in the Standard Model'. Springer 12th International Conference on Information, Security, and Cryptology (ICISC 2009), 5984, pp. 1-15.
(2009) 'Securing Remote Access Inside Wireless Mesh Networks'. Springer Berlin Heidelberg LNCS. Proceedings of the 10th International Workshop on Information Security and Applications (WISA 2009), Busan, Korea: 10th International Workshop, WISA 2009 5932, pp. 324-338.
Wireless mesh networks (WMNs) that are being increasingly deployed in communities and public places provide a relatively stable routing infrastructure and can be used for diverse carrier-managed services. As a particular example we consider the scenario where a mobile device initially registered for the use with one wireless network (its home network) moves to the area covered by another network inside the same mesh. The goal is to establish a secure access to the home network using the infrastructure of the mesh.
Classical mechanisms such as VPNs can protect end-to-end communication between the mobile device and its home network while remaining transparent to the routing infrastructure. In WMNs this transparency can be misused for packet injection leading to the unnecessary consumption of the communication bandwidth. This may have negative impact on the cooperation of mesh routers which is essential for the connection establishment.
In this paper we describe how to establish remote connections inside WMNs while guaranteeing secure end-to-end communication between the mobile device and its home network and secure transmission of the corresponding packets along the underlying multi-hop path. Our solution is a provably secure, yet lightweight and round-optimal remote network access protocol in which intermediate mesh routers are considered to be part of the security architecture. We also sketch some ideas on the practical realization of the protocol using known standards and mention extensions with regard to forward secrecy, anonymity and accounting.
Leroy D, Manulis M, Bonaventure O.
(2009) 'Enhanced Wireless Roaming Security Using Three-Party Authentication and Tunnels'. ACM Press Proceedings of the 1st ACM workshop on User-provided Networking (U-Net), CoNEXT 2009, , pp. 7-12.
Catuogno L, Löhr H, Manulis M, Sadeghi A-R, Winandy M.
(2009) 'Transparent Mobile Storage Protection in Trusted Virtual Domains'. USENIX Association 23rd USENIX Large Installation Systems Administration Conference (LISA 2009), Baltimore, MD: 23rd Large Installation System Administration Conference, pp. 159-172.
Manulis M, Leroy D, Koeune F, Bonaventure O, Quisquater J-J.
(2009) 'Authenticated Wireless Roaming via Tunnels: Making Mobile Guests Feel at Home'. ACM Press Proceedings of ACM Symposium on Information, Computer and Communications Security (ASIACCS’09), Sydney, Australia: ACM Symposium on Information, Computer and Communications Security (ASIACCS 2009), pp. 92-103.
In wireless roaming a mobile device obtains a service from some foreign network while being registered for the similar service at its own home network. However, recent proposals try to keep the service provider role behind the home network and let the foreign network create a tunnel connection through which all service requests of the mobile device are sent to and answered directly by the home network. Such Wireless Roaming via Tunnels (WRT) offers several (security) benefits but states also new security challenges on authentication and key establishment, as the goal is not only to protect the end-to-end communication between the tunnel peers but also the tunnel itself.
In this paper we formally specify mutual authentication and key establishment goals for WRT and propose an efficient and provably secure protocol that can be used to secure such roaming session. Additionally, we describe some modular protocol extensions to address resistance against DoS attacks, anonymity of the mobile device and unlinkability of its roaming sessions, as well as the accounting claims of the foreign network in commercial scenarios.
Manulis M, Suzuki K, Ustaoglu B.
(2009) 'Modeling Leakage of Ephemeral Secrets in Tripartite/Group Key Exchange'. Springer Information Security and Cryptology - ICISC 2009, Seoul, Korea: 12th International Conference on Information, Security, and Cryptology (ICISC 2009) 5984, pp. 16-33.
Recent advances in the design and analysis of secure two-party key exchange (2KE) such as the leakage of ephemeral secrets used during the attacked sessions remained unnoticed by the current models for group key exchange (GKE). Focusing on a special case of GKE — the tripartite key exchange (3KE) — that allows for efficient one-round protocols, we demonstrate how to incorporate these advances to the multi-party setting. From this perspective our work closes the most pronounced gap between provably secure 2KE and GKE protocols.
The proposed 3KE protocol is an implicitly authenticated protocol with one communication round which remains secure even in the event of ephemeral secret leakage. It also significantly improves upon currently known 3KE protocols, many of which are insecure. An optional key confirmation round can be added to our proposal to achieve the explicitly authenticated protocol variant
Gajek S, Manulis M, Schwenk J.
(2008) 'Enforcing User-Aware Browser-Based Mutual Authentication with Strong Locked Same Origin Policy'. Springer Berlin Heidelberg LNCS Proceedings of 13th Australasian Conference on Information Security and Privacy (ACISP 2008), Wollongong, Australia: 13th Australasian Conference, ACISP 2008 5107, pp. 6-20.
The standard solution for mutual authentication between human users and servers on the Internet is to execute a TLS handshake during which the server authenticates using a X.509 certificate followed by the authentication of the user either with own password or with some cookie stored within the user’s browser. Unfortunately, this solution is susceptible to various impersonation attacks such as phishing as it turned out that average Internet users are unable to authenticate servers based on their certificates.
In this paper we address security of cookie-based authentication using the concept of strong locked same origin policy for browsers introduced at ACM CCS’07. We describe a cookie-based authentication protocol between human users and TLS-servers and prove its security in the extended formal model for browser-based mutual authentication introduced at ACM ASIACCS’08. It turns out that the small modification of the browser’s security policy is sufficient to achieve provably secure cookie-based authentication protocols considering the ability of users to recognize images, video, or audio sequences.
Chen L, Löhr H, Manulis M, Sadeghi A-R.
(2008) 'Property-Based Attestation without a Trusted Third Party'. Springer Information Security, 11th International Conference, ISC 2008, 5222, pp. 31-46.
Gajek S, Manulis M, Pereira O, Sadeghi A-R, Schwenk J.
(2008) 'Universally Composable Security Analysis of TLS.'. Springer Proceedings of the 2nd International Conference on Provable Security (ProvSec 2008), 5324, pp. 313-327.
Bresson E, Manulis M.
(2008) 'Securing Group Key Exchange against Strong Corruptions'. ACM Press Proceedings of ACM Symposium on Information, Computer and Communications Security (ASIACCS’08), Tokyo, Japan: ACM Symposium on Information, Computer & Communication Security (ASIACCS '08), pp. 249-260.
Gajek S, Jager T, Manulis M, Schwenk J.
(2008) 'A Browser-Based Kerberos Authentication Scheme'. Springer Proceedings of 13th European Symposium on Research in Computer Security (ESORICS 2008), 5283, pp. 115-129.
Chen L, Escalante AN, Löhr H, Manulis M, Sadeghi A-R.
(2008) 'A Privacy-Protecting Multi-Coupon Scheme with Stronger Protection against Splitting'. Springer-Verlag Financial Cryptography and Data Security, 11th International Conference, FC 2007, 4886, pp. 29-44.
Armknecht F, Escalante AN, Löhr H, Manulis M, Sadeghi A-R.
(2008) 'Secure Multi-Coupons for Federated Environments: Privacy-Preserving and Customer-Friendly'. Springer Information Security Practice and Experience, 4th International Conference, ISPEC 2008, 4991, pp. 29-44.
Gajek S, Manulis M, Sadeghi A-R, Schwenk J.
(2008) 'Provably Secure Browser-Based User-Aware Mutual Authentication over TLS'. ACM Press Proceedings of ACM Symposium on Information, Computer and Communications Security (ASIACCS’08), Tokyo, Japan: ACM Symposium on Information, Computer & Communication Security (ASIACCS '08), pp. 300-311.
Bresson E, Manulis M, Schwenk JO.
(2007) 'On Security Models and Compilers for Group Key Exchange Protocols'. Springer-Verlag Proceedings of the 2nd International Workshop on Security (IWSEC 2007), Nara, Japan: Advances in Information and Computer Security, 2nd Intl. Workshop on Security LNCS 4752, pp. 292-307.
Manulis M, Schwenk JO.
(2007) 'Provably Secure Framework for Information Aggregation in Sensor Networks'. Springer Computational Science and Its Applications - ICCSA 2007, Part I, 4705, pp. 603-621.
Bresson E, Manulis M.
(2007) 'Malicious Participants in Group Key Exchange: Key Control and Contributiveness in the Shadow of Trust'. Springer-Verlag Proceedings of the 4th Autonomic and Trusted Computing Conference (ATC 2007), Hong Kong, China: 4th International Conference, ATC 2007 LNCS 4610, pp. 395-409.
Manulis M, Sadeghi A-R, Schwenk J.
(2006) 'Linkable Democratic Group Signatures'. Springer-Verlag Proceedings of the 2nd Information Security Practice and Experience Conference (ISPEC 2006), 3903, pp. 187-201.
Manulis M, Sadeghi A-R.
(2006) 'Property-Based Taming of Lying Mobile Nodes'. IEEE Computer Society Proceedings of 20th International Conference on Advanced Information Networking and Applications (AINA 2006), Vol. 2, , pp. 476-480.
(2006) 'Democratic Group Signatures - On an Example of Joint Ventures'. ACM Press Proceedings of ACM Symposium on Information, Computer and Communications Security (ASIACCS’06), Taipei, Taiwan: 2006 ACM Symposium on Information, computer and communications security, pp. 365-365.
We propose a novel group-oriented signature scheme, called a democratic group signature (DGS). In DGS the scheme setting is controlled on a contributory basis, i.e., without any centralized trusted authority (group manager). Group members agree on a common tracing trapdoor, i.e., every member can trace issued signatures individually. Members are able to sign on behalf of the group while remaining anonymous only to third parties. DGS supports dynamic changes of the group formation (joins and leaves of members). For security reasons the tracing trapdoor is updated after every dynamic change. The DGS model results from strong changes to the standard model of group signatures caused by elimination of the group manager's role and distribution of the tracing rights to individuals.
Liao L, Manulis M.
(2006) 'Tree-Based Group Key Agreement Framework for Mobile Ad-Hoc Networks'. IEEE Computer Society Proceedings of 20th International Conference on Advanced Information Networking and Applications (AINA 2006), Vol. 2, , pp. 5-9.
(2005) 'Contributory Group Key Agreement Protocols, Revisited for Mobile Ad-Hoc Groups'. IEEE Computer Society Proceedings of 2nd IEEE International Conference on Mobile Adhoc and Sensor Systems (MASS 2005), , pp. 811-818.
(2005) 'Key Agreement for Heterogeneous Mobile Ad-Hoc Groups'. IEEE Computer Society Proceedings of 11th International Conference on Parallel and Distributed Systems (ICPADS 2005), Vol. 2, , pp. 290-294.
Manulis M, Schwenk J.
(2004) 'Pseudonym Generation Scheme for Ad-Hoc Group Communication Based on IDH'. Springer ESAS, 3313, pp. 107-124.
Pieprzyk J, Sadeghi AR, Manulis M.
(2012) Cryptology and Network Security — CANS 2012. 7712
BOOK (AUTHORED & EDITED)
Fischlin M, Buchmann J, Manulis M.
(2012) Public Key Cryptography — PKC 2012. Springer-Verlag 7293
BOOK (AUTHORED & EDITED)
(2007) Provably Secure Group Key Exchange. Berlin, Bochum, Dülmen, London, Paris : Europäischer Universitätsverlag 5
BOOK (AUTHORED & EDITED)
Cutillo LA, Manulis M, Strufe T.
(2010) 'Security and Privacy in Online Social Networks'. in Furht B (ed.) Handbook of Social Network Technologies and Applications
Springer-Verlag New York Inc Article number 23
Liao L, Manulis M, Schwenk J.
(2008) 'Securing Email Communication with XML Technology'. in Gupta JND, Sharma S (eds.) Handbook of Research on Information Security and Assurance
IGI Global Article number XVII , pp. 202-217.