基于PUF与信封加密的1-of-n多设备口令恢复方案
A 1-of-n Multi-Device Password Recovery Scheme Based on Physical Unclonable Functions and Envelope Encryption
摘要: 随着在线账户数量增加,口令管理系统被广泛用于生成、保存和自动填充站点口令,但传统方案通常依赖低熵主口令或持久化根秘密,存在离线猜测和秘密泄露风险。物理不可克隆函数(physical unclonable function, PUF)可按需派生设备相关秘密,减少口令管理系统对用户记忆和根秘密持久化存储的依赖;然而,单一PUF设备损坏或遗失仍可能导致主秘密及全部站点口令无法恢复。针对这一问题,提出一种基于PUF与信封加密的1-of-n多设备冗余恢复方案,使任一可用完整成员均可独立恢复同一群主秘密,无须Host、网络或其他成员同时在线。围绕该结构,设计了群组初始化、单设备恢复、面对面入组和群组重建流程。安全性分析与Tamarin双成员符号模型验证表明,在既定假设下,方案能够保护群主秘密并检测篡改、重放和冒充行为,所建立的10条安全引理均验证通过。该方案在保留PUF硬件信任根优势的同时,缓解了单一PUF设备造成的口令恢复单点故障。
Abstract: With the increasing number of online accounts, password management systems are widely used to generate, store, and autofill site passwords. However, conventional solutions commonly rely on low-entropy master passwords or persistently stored root secrets, exposing them to offline guessing and secret-leakage risks. A physical unclonable function (PUF) can derive device-specific secrets on demand and reduce such dependence; nevertheless, damage to or loss of a single PUF device may make the master secret and all derived passwords unrecoverable. To address this problem, this paper proposes a PUF- and envelope-encryption-based 1-of-n multi-device recovery scheme, allowing any intact member to recover the same group master secret independently without requiring the host, network connectivity, or other members to be online. Group initialization, single-device recovery, face-to-face onboarding, and group rebuilding procedures are designed. Security analysis and a two-member Tamarin model show that, under the stated assumptions, the scheme protects the group master secret and detects tampering, replay, and impersonation. All ten security lemmas are verified. The scheme, while retaining the advantages of PUFs as hardware roots of trust, therefore mitigates the recovery single point of failure caused by reliance on a single PUF device.
文章引用:汪思贤, 孟坤, 王启源. 基于PUF与信封加密的1-of-n多设备口令恢复方案[J]. 软件工程与应用, 2026, 15(5): 706-715. https://doi.org/10.12677/sea.2026.155066

参考文献

[1] Gentles, J., Fields, M., Goodman, G. and Bhunia, S. (2025) Breaking the Vault: A Case Study of the 2022 LastPass Data Breach.
https://arxiv.org/abs/2502.04287
[2] Bindel, N., Cremers, C. and Zhao, M. (2023) FIDO2, CTAP 2.1, and Webauthn 2: Provable Security and Post-Quantum Instantiation. 2023 IEEE Symposium on Security and Privacy (SP), San Francisco, 21-25 May 2023, 1471-1490.
https://doi.org/10.1109/sp46215.2023.10179454
[3] Büttner, A. and Gruschka, N. (2025) Device-Bound vs. Synced Credentials: A Comparative Evaluation of Passkey Authentication. Proceedings of the 11th International Conference on Information Systems Security and Privacy, 2, 651-659.
https://doi.org/10.5220/0013380600003899
[4] Oesch, S. and Ruoti, S. (2020) That Was Then, This Is Now: A Security Evaluation of Password Generation, Storage, and Autofill in Browser-Based Password Managers. 29th USENIX Security Symposium (USENIX Security ’20), 12-14 August 2020, 2165-2182.
[5] Nair, V. and Song, D. (2023) MFDPG: Multi-Factor Authenticated Password Management with Zero Stored Secrets. arXiv:2306.14746.
https://arxiv.org/abs/2306.14746
[6] Gao, Y., Al-Sarawi, S.F. and Abbott, D. (2020) Physical Unclonable Functions. Nature Electronics, 3, 81-91.
https://doi.org/10.1038/s41928-020-0372-5
[7] Cambou, B. (2018) Addressable PUF Generators for Database-Free Password Management System. 16th International Workshop on Cryptographic Architectures Embedded in Logic Devices (CryptArchi 2018), Guidel-Plages, 17-20 June 2018.
[8] Assiri, S. and Cambou, B. (2021) Homomorphic Password Manager Using Multiple-Hash with PUF. In: Arai, K., Ed., Advances in Intelligent Systems and Computing, Springer International Publishing, 772-792.
https://doi.org/10.1007/978-3-030-73100-7_55
[9] Liu, J., Xie, J., Zhang, J., Liu, B., Chen, X. and Feng, H. (2023) A Secure Secret Key Agreement Scheme among Multiple Twinning Superlattice PUF Holders. Sensors, 23, Article 4704.
https://doi.org/10.3390/s23104704
[10] Barbareschi, M., Casola, V., Emmanuele, A. and Lombardi, D. (2024) A Lightweight PUF-Based Protocol for Dynamic and Secure Group Key Management in IOT. IEEE Internet of Things Journal, 11, 32969-32984.
https://doi.org/10.1109/jiot.2024.3418207
[11] Feng, P., Li, B., Han, B., Ma, Y., Hu, Y. and Zhao, R. (2026) A Scalable Group Authentication Protocol for IoT Based on PUF-Derived Bases in Inner Product Spaces. Cybersecurity, 9, Article No. 41.
https://doi.org/10.1186/s42400-025-00468-0
[12] Brandão, L.T.A.N. and Peralta, R. (2026) NIST First Call for Multi-Party Threshold Schemes: NIST IR 8214C. NIST.
[13] Erinle, Y., Kethepalli, Y., Feng, Y., et al. (2023) SoK: Design, Vulnerabilities, and Security Measures of Cryptocurrency Wallets. arXiv:2307.12874.
https://arxiv.org/abs/2307.12874
[14] Rogaway, P. and Shrimpton, T. (2006) A Provable-Security Treatment of the Key-Wrap Problem. In: Vaudenay, S., Ed., Lecture Notes in Computer Science, Springer, 373-390.
https://doi.org/10.1007/11761679_23
[15] NIST (2012) Recommendation for Block Cipher Modes of Operation: Methods for Key Wrapping: NIST SP 800-38F. NIST.
[16] Canetti, R., Fuller, B., Paneth, O., Reyzin, L. and Smith, A. (2021) Reusable Fuzzy Extractors for Low-Entropy Distributions. Journal of Cryptology, 34, Article No. 2.
https://doi.org/10.1007/s00145-020-09367-8
[17] Krawczyk, H. and Eronen, P. (2010) HMAC-Based Extract-and-Expand Key Derivation Function (HKDF): RFC 5869. Internet Engineering Task Force.
[18] Dworkin, M. (2007) Recommendation for Block Cipher Modes of Operation: Galois/Counter Mode (GCM) and GMAC: NIST SP 800-38D. NIST.
[19] Josefsson, S. and Liusvaara, I. (2017) Edwards-Curve Digital Signature Algorithm (EdDSA): RFC 8032. Internet Research Task Force.
[20] Langley, A., Hamburg, M. and Turner, S. (2016) Elliptic Curves for Security: RFC 7748. Internet Research Task Force.
[21] Krawczyk, H. (2010) Cryptographic Extraction and Key Derivation: The HKDF Scheme. In: Rabin, T., Ed., Lecture Notes in Computer Science, Springer, 631-648.
https://doi.org/10.1007/978-3-642-14623-7_34
[22] Gennaro, R., Jarecki, S., Krawczyk, H. and Rabin, T. (2007) Secure Distributed Key Generation for Discrete-Log Based Cryptosystems. Journal of Cryptology, 20, 51-83.
https://doi.org/10.1007/s00145-006-0347-3
[23] Vaudenay, S. (2005) Secure Communications over Insecure Channels Based on Short Authenticated Strings. In: Shoup, V., Ed., Lecture Notes in Computer Science, Springer, 309-326.
https://doi.org/10.1007/11535218_19
[24] Meier, S., Schmidt, B., Cremers, C. and Basin, D. (2013) The TAMARIN Prover for the Symbolic Analysis of Security Protocols. In: Sharygina, N. and Veith, H. Eds., Lecture Notes in Computer Science, Springer, 696-701.
https://doi.org/10.1007/978-3-642-39799-8_48
[25] Dolev, D. and Yao, A. (1983) On the Security of Public Key Protocols. IEEE Transactions on Information Theory, 29, 198-208.
https://doi.org/10.1109/tit.1983.1056650