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

H. Tews; B.P.F. Jacobs

doi:10.1007/978-3-642-03944-7_8

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

H. Tews, B.P.F. Jacobs

Mathematics and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

18 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 language	English
Title of host publication	Proceedings 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 Publication	Berlin
Publisher	Springer
Pages	95-111
ISBN (Print)	978-3-642-03943-0
DOIs	https://doi.org/10.1007/978-3-642-03944-7_8
Publication status	Published - 2009

Publication series

Name	Lecture Notes in Computer Science
Volume	5746
ISSN (Print)	0302-9743

Access to Document

10.1007/978-3-642-03944-7_8

Cite this

Tews, H., & Jacobs, B. P. F. (2009). Performance issues of selective disclosure and blinded issuing protocols on Java Card. In Proceedings 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 (pp. 95-111). (Lecture Notes in Computer Science; Vol. 5746). Springer. https://doi.org/10.1007/978-3-642-03944-7_8

Tews, H. ; Jacobs, B.P.F. / Performance issues of selective disclosure and blinded issuing protocols on Java Card. Proceedings 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. Berlin : Springer, 2009. pp. 95-111 (Lecture Notes in Computer Science).

@inproceedings{fa678e37c9b94245853484644704a2bf,

title = "Performance issues of selective disclosure and blinded issuing protocols on Java Card",

abstract = "We develop algorithms to compute Voronoi diagrams, shortest path maps, and the Fr{\'e}chet distance in the plane with polygonal obstacles. Distances between points are measured either by link distance or by Euclidean shortest path distance.",

author = "H. Tews and B.P.F. Jacobs",

year = "2009",

doi = "10.1007/978-3-642-03944-7_8",

language = "English",

isbn = "978-3-642-03943-0",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "95--111",

booktitle = "Proceedings 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",

address = "Germany",

}

Tews, H & Jacobs, BPF 2009, Performance issues of selective disclosure and blinded issuing protocols on Java Card. in Proceedings 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. Lecture Notes in Computer Science, vol. 5746, Springer, Berlin, pp. 95-111. https://doi.org/10.1007/978-3-642-03944-7_8

Performance issues of selective disclosure and blinded issuing protocols on Java Card. / Tews, H.; Jacobs, B.P.F.
Proceedings 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. Berlin: Springer, 2009. p. 95-111 (Lecture Notes in Computer Science; Vol. 5746).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

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

AU - Tews, H.

AU - Jacobs, B.P.F.

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

U2 - 10.1007/978-3-642-03944-7_8

DO - 10.1007/978-3-642-03944-7_8

M3 - Conference contribution

SN - 978-3-642-03943-0

T3 - Lecture Notes in Computer Science

SP - 95

EP - 111

BT - Proceedings 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

PB - Springer

CY - Berlin

ER -

Tews H, Jacobs BPF. Performance issues of selective disclosure and blinded issuing protocols on Java Card. In Proceedings 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. Berlin: Springer. 2009. p. 95-111. (Lecture Notes in Computer Science). doi: 10.1007/978-3-642-03944-7_8

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

Abstract

Publication series

Access to Document

Fingerprint

Cite this