Performance issues of selective disclosure and blinded issuing protocols on Java Card

H. Tews, B.P.F. Jacobs

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

14 Citations (Scopus)

Abstract

We develop algorithms to compute Voronoi diagrams, shortest path maps, and the Fréchet distance in the plane with polygonal obstacles. Distances between points are measured either by link distance or by Euclidean shortest path distance.
Original languageEnglish
Title of host publicationProceedings of the 3rd IFIP WG 11.2 International Workshop on Information Security Theory and Practice. Smart Devices, Pervasive Systems, and Ubiquitous Networks (WISTP 2009), 1-4 September 2009, Brussels, Belgium
Place of PublicationBerlin
PublisherSpringer
Pages95-111
ISBN (Print)978-3-642-03943-0
DOIs
Publication statusPublished - 2009

Publication series

NameLecture Notes in Computer Science
Volume5746
ISSN (Print)0302-9743

Fingerprint Dive into the research topics of 'Performance issues of selective disclosure and blinded issuing protocols on Java Card'. Together they form a unique fingerprint.

Cite this