Paper 2021/925 Original: eprint.iacr.org/2021/925 ↗
Bilinear Map Based One-Time Signature Scheme with Secret Key Exposure
Abstract
Dijk et al. presents Remote Attestation (RA) for secure processor technology which is secure in the presence of an All Digital State Observing (ADSO) adversary. The scheme uses a combination of hardware security primitives and design principles together with a new cryptographic primitive called a Public Key Session based One-Time Signature Scheme with Secret Key Exposure (OTS-SKE). Dijk et al. show a hash based realization of OTS-SKE which is post quantum secure but suffers long $8.704$ KB signatures for 128-bit quantum security or 256-bit classical security. From a classical cryptographic perspective we complete the picture by introducing a bilinear map based OTS-SKE with short $0.125$ KB signatures, $65$ times shorter, and for which the security reduces to the Computational Diffie-Hellman Problem (CDHP) -- at the cost of a $9\times$ longer initialization phase in the RA scheme if implemented in software (this can be improved with appropriate elliptic curve hardware acceleration). Signing takes 560 ms at most $60\%$ of the $>936$ ms needed for the hash based scheme.
Metadata
- Available format(s)
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2021-07-09: last updated
- 2021-07-09: published
- Short URL
- https://ia.cr/2021/925
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2021/925,
author = {Marten van Dijk and Deniz Gurevin and Chenglu Jin and Omer Khan and Phuong Ha Nguyen},
title = {Bilinear Map Based One-Time Signature Scheme with Secret Key Exposure},
howpublished = {Cryptology {ePrint} Archive, Paper 2021/925},
year = {2021},
url = {https://eprint.iacr.org/2021/925}
}