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

Tews, H.;Jacobs, B.
(2009) Information Security Theory and Practice. Smart Devices, Pervasive Systems, and Ubiquitous Networks. Third IFIP WG11.2 International Workshop, WISTP 2009 — Location: Brussels, Belgium (1.September.2009)

Files

pdfdocument.pdf
  • Restricted Access
  • Adobe PDF
  • 295.89 KB
No access

Details

Authors
  • Tews, H.
    Author
  • Jacobs, B.
    Author
Abstract
In this paper we report on the performance of the RSA variants of Brands protocols for zero-knowledge proof and restrictive blinded issuing. The performance is relatively bad: For 4 attributes and an RSA key size of 1280 bits, blinded issuing takes about 10 seconds and the zero-knowledge proof takes about 9 seconds. For 2 attributes the zero-knowledge proof drops to 5 seconds. The poor performance comes from the fact that the cryptographic coprocessor on the Java card can only be employed in very limited ways. With appropriate support of the cryptographic coprocessor both protocols would run much faster.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Tews, H., & Jacobs, B. (2009). Performance issues of selective disclosure and blinded issuing protocols on Java card. In Markowitch, O.; Bilas, A.; Hoepman, J.-H.; Mitchell, C.J.; Quisquater, J.-J.; (ed.), Information Security Theory and Practice. Smart Devices, Pervasive Systems, and Ubiquitous Networks. Third IFIP WG11.2 International Workshop, WISTP 2009 (p. p. 95-111). Springer verlag. https://doi.org/10.1007/978-3-642-03944-7_8