Philip Ginzboorg

dblp:68/5081 · DBLP profile ↗
← Back
13ranked-venue papers
4as first author
4since 2021 · last 2024
0000-0003-4579-3668ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 7 · 3 first-authorSecurity and privacy · 3 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1Theory of computation · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021
YearPublicationVenuePosition
2024 Attestation with Constrained Relying Party
abstract
Publisher Copyright: © 2024 by SCITEPRESS – Science and Technology Publications, Lda.
Mariam Moustafa, Arto Niemi, Philip Ginzboorg, Jan-Erik Ekberg
ICISSP3
2024 Authentication of fragments with short tags
Philip Ginzboorg, Valtteri Niemi, Jörg Ott
Theor. Comput. Sci.1
2022 Trusted Hart for Mobile RISC-V Security
abstract
The majority of mobile devices today are based on Arm architecture that supports the hosting of trusted applications in Trusted Execution Environment (TEE). RISC-V is a relatively new open-source instruction set architecture that was engineered to fit many uses. In one potential RISC-V usage scenario, mobile devices could be based on RISC-V hardware. We consider the implications of porting the mobile security stack on top of a RISC-V system on a chip, identify the gaps in the open-source Keystone framework for building custom TEEs, and propose a security architecture that, among other things, supports the GlobalPlatform TEE API specification for trusted applications. In addition to Keystone enclaves the architecture includes a Trusted Hart – a normal core that runs a trusted operating system and is dedicated for security functions, like control of the device’s keystore and the management of secure peripherals. The proposed security architecture for RISC-V platform is verified experimentally using the HiFive Unleashed RISC-V development board.
Vladimir Ushakov, Sampo Sovio, Qingchao Qi, Vijayanand Nayani, Valentin Manea, Philip Ginzboorg, Jan-Erik Ekberg
TrustCom6
2021 Privacy-Preserving Access for Multi-Access Edge Computing (MEC) Applications
Gizem Akman, Philip Ginzboorg, Valtteri Niemi
ICCSA (8)2
2014 Message fragmentation for a chain of disrupted links
Philip Ginzboorg, Valtteri Niemi, Jörg Ott
Comput. Commun.1
2013 Fragmentation algorithms for DTN links
Philip Ginzboorg, Valtteri Niemi, Jörg Ott
Comput. Commun.1
2013 Privacy of Community Pseudonyms in Wireless Peer-to-Peer Networks
Julien Freudiger, Murtuza Jadliwala, Jean-Pierre Hubaux, Valtteri Niemi, Philip Ginzboorg
Mob. Networks Appl.5
2012 Track Me If You Can: On the Effectiveness of Context-based Identifier Changes in Deployed Mobile Networks
Laurent Bindschaedler, Murtuza Jadliwala, Igor Bilogrevic, Imad Aad, Philip Ginzboorg, Valtteri Niemi, Jean-Pierre Hubaux
NDSS5
2012 Message fragmentation for a chain of disrupted links
abstract
We investigate the problem of estimating the transmission time of fragmented messages over multiple disrupted links. We build a system model for the case where a single message is sent over a chain of links and the disruptions in these links are identically and independently distributed. For this case, we derive an approximation formula for the mean transmission time, based on number of links, length of fragments and distributions of disruptions. The formula is verified against simulation experiments in the cases of uniform and exponential distributions for disruptions.
Philip Ginzboorg, Valtteri Niemi, Jörg Ott
WOWMOM1
2011 Best-effort authentication for opportunistic networks
abstract
A “best-effort” authentication method, which is easier to attack than generic authentication methods (but requires fewer computations for benign nodes), may be sufficient for certain networking scenarios. We illustrate this point by examining the case of fragment authentication by intermediaries in an opportunistic network. We describe mechanisms for implementing best-effort authentication, with the caveat that an authentication strength sufficient in one scenario may be unfit for another.
John Solis, Philip Ginzboorg, N. Asokan, Jörg Ott
IPCCC2
2010 Controlling resource hogs in mobile delay-tolerant networks
John Solis, N. Asokan, Kari Kostiainen, Philip Ginzboorg, Jörg Ott
Comput. Commun.4
2005 Visitor Access Management in Personal Wireless Networks
abstract
The increasing popularity and variety of consumer multimedia devices is driving the need for networked homes. Yet setting up a secure wireless network is a daunting task for most ordinary users. Recently, there have been several proposals for easing this process. However, none of the proposals consider the problem of how to make it easy to manage visitor access. In this paper, we motivate the requirements for visitor management, show the shortcomings of the current easy setup proposals in this regard, and propose a new setup procedure that makes it easy to manage visitor access to wireless networks. Our contributions are twofold: first we present an approach to assigning categories to client devices at admission time so that selective revocation of clients based on those categories becomes possible. Then we present the idea of admission tickets, a flexible and secure way to delegate conditional access rights. We report the results and experience of prototyping of the proposed procedure using the HostAP framework.
N. Asokan, Seamus Moloney, Philip Ginzboorg, Kari Kostiainen
ISM3
2000 Key agreement in ad hoc networks
N. Asokan, Philip Ginzboorg
Comput. Commun.2