The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
On Using a Von Neumann Extractor in Heart-Beat-Based Security
Abstract
The Inter-Pulse-Interval (IPI) of heart beats has previously been suggested for facilitating security in mobile health (mHealth) applications. In heart-beat-based security, a security key is derived from the time difference between consecutive heart beats. As two entities that simultaneously sample the same heart beats may generate the same key (with some inter-key disparity), these keys may be used for various security functions, such as entity authentication or data confidentiality. One of the key limitations in heart-beat-based security is the low randomness intrinsic to the most-significant bits (MSBs) in the digital representation of each IPI. In this paper, we explore the use of a von Neumann entropy extractor on these MSBs in order to increase their randomness. We show that our von Neumann key-generator produces significantly more random bits than a non-extracting key generator with an average bit-extraction rate between 13.4% and 21.9%. Despite this increase in randomness, we also find a substantial increase in inter-key disparity, increasing the mismatch tolerance required for a given true-key pair. Accordingly, the maximum-attainable effective key-strength of our key generator is only slightly higher than that of a non-extracting generator (16.4 bits compared to 15.2 bits of security for a 60-bit key), while the former requires an increase in average key-generation time of 2.5x.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“As the number of bits decreases, the randomness tends to improve (44, 45).”
From Cryptographic transistor for true random number generator with low power consumption (2024) · cites this paper as [44]
Citations
Cites
A Mathematical Theory of Communication
Shannon, C. E. (1948) · The MIT Press eBooks · doi:10.1002/j.1538-7305.1948.tb00917.x · Cited by 50,398
Goldberger, A. L., Amaral, L. A. N., Glass, L., Hausdorff, J. M., Ivanov, P. C., Mark, R. G., Mietus, J. E., Moody, G. B., Peng, C.-K., & Stanley, H. E. (2000) · Circulation · doi:10.1161/01.cir.101.23.e215 · Cited by 14,809
The impact of the MIT-BIH Arrhythmia Database
Moody, G. B., & Mark, R. G. (2001) · IEEE Engineering in Medicine and Biology Magazine · doi:10.1109/51.932724 · Cited by 4,834
Polynomial Codes Over Certain Finite Fields
Reed, I. S., & Solomon, G. (1960) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0108018 · Cited by 3,802
Age-related alterations in the fractal scaling of cardiac interbeat interval dynamics
Iyengar, N., Peng, C., Morin, R. J., Goldberger, A. L., & Lipsitz, L. A. (1996) · American Journal of Physiology-Regulatory, Integrative and Comparative Physiology · doi:10.1152/ajpregu.1996.271.4.r1078 · Cited by 703
Juels, A., & Sudan, M. (2006) · Designs Codes and Cryptography · doi:10.1007/s10623-005-6343-z · Cited by 642
A novel biometrics method to secure wireless body area sensor networks for telemedicine and m-health
Poon, C. C. Y., Zhang, Y., & Bao, S. (2006) · IEEE Communications Magazine · doi:10.1109/mcom.2006.1632652 · Cited by 572
PSKA: Usable and Secure Key Agreement Scheme for Body Area Networks
Venkatasubramanian, K. K., Banerjee, A., & Gupta, S. K. S. (2009) · IEEE Transactions on Information Technology in Biomedicine · doi:10.1109/titb.2009.2037617 · Cited by 322
IMDGuard: Securing implantable medical devices with the external wearable guardian
Xu, F., Qin, Z., Tan, C. C., Wang, B., & Li, Q. (2011) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2011.5934987 · Cited by 272
SoK: Security and Privacy in Implantable Medical Devices and Body Area Networks
Rushanan, M., Rubin, A. D., Kune, D. F., & Swanson, C. M. (2014) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2014.40 · Cited by 259
Research works printed but not linked: 2
- 10.1145/584091.584093 · DOI
- von neumann, 1951, Various techniques used in connection with random digits, Monte Carlo Method National Bureau of Standards Applied Math, 36
Cited by
Sorted by citations
Cryptographic transistor for true random number generator with low power consumption
Kim, S.-I., You, H.-J., Kim, M.-S., An, U.-S., Kim, M.-S., Lee, D. H., Ryu, S.-T., & Choi, Y.-K. (2024) · Science Advances · doi:10.1126/sciadv.adk6042 · Cited by 33
“As the number of bits decreases, the randomness tends to improve ( 44 , 45 ).”
Metadata
- Authors
- Seepers, R. M., Strydis, C., Sourdis, I., & De Zeeuw, C. I.
- Affiliations
- Erasmus MC (NL)
- Chalmers University of Technology (SE)
- Venue
- 2015 IEEE Trustcom/BigDataSE/ISPA
- Publisher
- IEEE
- Published
- 2015-08
- Pages
- 491-498
- OpenAlex
- W4247436492
- Cited by
- 10
- References
- 17
- Citations by year
- 2024: 1 · 2023: 2 · 2021: 2 · 2020: 1 · 2019: 1 · 2018: 2 · 2017: 1
- FWCI
- 0.74
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom) (publishedVersion)
- EUR Research Repository (Erasmus University Rotterdam) (submittedVersion)
- Chalmers Research (Chalmers University of Technology) (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Advanced Authentication Protocols Security
- Physical Sciences › Computer Science › Information Systems › User Authentication and Security Systems
- Physical Sciences › Computer Science › Signal Processing › Biometric Identification and Security
- Keywords
- von Neumann extractor, interpulse interval, randomness extraction, entity authentication, key strength
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
