IP Library Granted Patent US 12,676,762
Granted Patent B2
US 12,676,762 · App. 18/029,078 · Granted Jul 7, 2026

Physically unclonable functions

Inventors: Jack Owen Davies (London, GB); Craig Steven Wright (London, GB)
Assignee: nChain Licensing AG
H04L9/3278H04L9/0866H04L9/321H04L9/3271H04L9/50H04L63/0876
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,676,762
App. No.
18/029,078
Filed
Mar 28, 2023
Granted
Jul 7, 2026
Kind
B2
Art Unit
2494
USPC
713/189
Abstract

A method for enabling a verifying party to verify an identity of a target party or device. The method comprises, in a set-up phase: storing, in a data store, a respective piece of response data for each of a set of one or more responses resulting from a setting-up party inputting a respective set of one or more challenges into a PUF module comprising a physically unclonable function, PUF, to generate the one or more responses based on the PUF; and storing an indication of the set of challenges in the data store. The indication does not comprise a value of each of the challenges in the set, but rather a master challenge from which the set of challenges is derivable by applying a derivation function to the master challenge.

Claims (44)

1 . A computer-implemented method for enabling one or more verifying parties to verify an identity of a target comprising a target party or a device of the target party; the method comprising, in a set-up phase:

storing, in a data store, a respective piece of response data for each of a set of one or more responses resulting from a setting-up party inputting a respective set of one or more challenges into a PUF module comprising a physically unclonable function, PUF, to generate the one or more responses based on the PUF, wherein the respective piece of response data for each response comprises the respective response or data derived therefrom; and

storing an indication of the set of challenges in the data store, wherein the indication does not comprise a value of each of the challenges in the set, but rather instead, the stored indication comprises a master challenge from which the set of challenges is derivable by applying a derivation function to the master challenge, wherein the master challenge is stored in the data store in lieu of explicitly storing a respective challenge for every response in the set of one or more responses;

making the master challenge and at least one of the pieces of response data available to the one or more verifying parties from the data store, thereby enabling the one or more verifying parties to derive the respective challenge from the master challenge using the derivation function, for the one or more verifying parties to verify the identity of the target in a subsequent verification phase.

2 . The method of claim 1 , wherein the data store is implemented in third party computer equipment.

3 . The method of claim 1 , wherein the data store is a public peer-to-peer publication medium, wherein the peer-to-peer publication medium is a blockchain.

4 . The method of claim 1 , wherein the master challenge comprises identification data comprising, or derived from, one or more pieces of identification information relating to the identity of the target.

5 . The method of claim 4 , wherein the identification data comprises, or is generated from, a combination of a plurality of pieces of identification information of the target party.

6 . The method of claim 4 , wherein the method is performed by a trusted third party, and comprises determining the master challenge based on obtaining the one or more pieces of identification information.

7 . The method of claim 6 , wherein said obtaining comprises receiving the one or more pieces of identification information from the target party.

8 . The method of claim 7 , comprising establishing a secure channel between the target party and the trusted third party based on a shared secret shared between the target party and trusted third party, wherein the receiving or sending of the identification information between the target party and trusted third party is performed over the secure channel.

9 . The method of claim 4 , wherein the method is performed by the target party, and the storing of the master challenge comprises the target party performing one of: determining the master challenge and sending it to be stored in the data store, or sending at least one of the one or more pieces of identification information to a trusted third party to cause the trusted third party to generate the master challenge and store it in the data store.

10 . The method of claim 1 , wherein the target is one of multiple targets for which the data store stores corresponding sets of response data and master challenges, each master challenge enabling derivation of a respective set of challenges, for use in verifying the corresponding target.

11 . The method of claim 10 , wherein each master challenge comprises identification data of the corresponding target.

12 . The method of claim 1 , wherein the derivation function derives the set of challenges in an ordered form, and each of the pieces of response data is stored in association with an identifier specifying a different one of the challenges in said order, thus mapping different respective pieces of response data to different respective ones of the set of challenges derivable from the master challenge.

13 . The method of claim 1 , wherein the challenges of the set are derivable in a chained manner, a first of the set of challenges being derivable by applying the derivation function to the master challenge, and each successive challenge in said set being derivable by applying the derivation function to a preceding challenge in the set.

14 . The method of claim 1 , wherein the challenges of the set are derivable in a hierarchical manner, a first subset of the set of challenges being derivable by applying the derivation function to the master challenge, and each of one or more successive subsets being derivable by applying the derivation function to one of the challenges further back in the hierarchy.

15 . The method of claim 1 , wherein the derivation function or an indication thereof is also stored in the data store, thereby making the derivation function or indication thereof available to the one or more verifying parties.

16 . The method of claim 1 , wherein the derivation function is pre-known to at least one of the verifying parties and does not need to be made available or indicated to the at least one verifying party.

17 . The method of claim 1 , wherein:

the one or more verifying parties are a plurality of verifying parties;

the set of challenges is a plurality of challenges, and the set of responses is a respective plurality of responses; and the storing makes only a respective subset of one or more of the pieces of response data available to each of the verifying parties, with different subsets being made available to different ones of the verifying parties.

18 . The method of claim 17 , wherein the subsets are exclusive of one another.

19 . The method of claim 1 , wherein each of the response data comprises an explicit value of the respective response but are stored in the data store only in encrypted form.

20 . The method of claim 19 , wherein:

each of a plurality of subsets of one or more of response data records is individually encrypted, each subset requiring a different respective decryption key to decrypt; and

the different subsets are made available to different ones of the verifying parties by distributing different ones of the decryption keys to different verifying parties.

21 . The method of claim 1 , wherein each of the pieces of response data comprises only an attestation of the respective response, not an explicit value of the response, the attestation comprising a transformation of the respective response which does not disclose the response, but which enables a verifying party to verify the identity of the target by performing the same transformation on a further instance of the respective response returned by the target and comparing with the attestation.

22 . The method of claim 21 , wherein the transformation comprises a hash or double hash.

23 . Computer equipment comprising: memory comprising one or more memory units; and

a processing apparatus comprising one or more processing units, wherein the memory stores code arranged to run on the processing apparatus, the code being configured so as when run on the processing apparatus, the processing apparatus performs a method of enabling one or more verifying parties to verify an identity of a target comprising a target party or a device of the target party; the method comprising, in a set-up phase:

storing, in a data store, a respective piece of response data for each of a set of one or more responses resulting from a setting-up party inputting a respective set of one or more challenges into a physically undonable function (PUF) module comprising a PUF, to generate the one or more responses based on the PUF, wherein the respective piece of response data for each response comprises the respective response or data derived therefrom; and

storing an indication of the set of challenges in the data store, wherein the indication does not comprise a value of each of the challenges in the set, but rather instead, the indication comprises a master challenge from which the set of challenges is derivable by applying a derivation function to the master challenge, wherein the master challenge is stored in the data store in lieu of explicitly storing a respective challenge for every response in the set of one or more responses;

wherein the data store is arranged to make the master challenge and at least one of the pieces of response data available to the one or more verifying parties, thereby enabling the one or more verifying parties to derive the respective challenge from the master challenge using the derivation function, for the one or more verifying parties to verify the identity of the target in a subsequent verification phase.

24 . A computer program product embodied on a non-transitory computer-readable medium and configured so as, when run on one or more processors, the one or more processors perform a method of enabling one or more verifying parties to verify an identity of a target comprising a target party or a device of the target party; the method comprising, in a set-up phase:

storing, in a data store, a respective piece of response data for each of a set of one or more responses resulting from a setting-up party inputting a respective set of one or more challenges into a physically unclonable function (PUF) module comprising a physically unclonable function, PUF, to generate the one or more responses based on the PUF, wherein the respective piece of response data for each response comprises the respective response or data derived therefrom; and

storing an indication of the set of challenges in the data store, wherein the indication does not comprise a value of each of the challenges in the set, but rather instead, the indication comprises a master challenge from which the set of challenges is derivable by applying a derivation function to the master challenge, wherein the master challenge is stored in the data store in lieu of explicitly storing a respective challenge for every response in the set of one or more responses;

wherein the data store makes the master challenge and at least one of the pieces of response data available to the one or more verifying parties, thereby enabling the one or more verifying parties to derive the respective challenge from the master challenge using the derivation function, for the one or more verifying parties to verify the identity of the target in a subsequent verification phase.

25 . A computer-implemented method whereby a verifying party verifies an identity of a target comprising a target party or a device of the target party; the method comprising, by the verifying party:

accessing a data store that stores a set of response data records, each response data record comprising a respective piece of response data that comprises either: a) a value of a response resulting from inputting a respective challenge into a PUF module comprising a physically unclonable function (PUF) associated with the target, or b) an attestation comprising a transformation of the response, wherein the accessing of the data store comprises accessing one of the pieces of response data from the data store;

accessing a master challenge from the data store, and deriving the respective challenge of at least one of said set of response data records by applying a derivation function to the master challenge, wherein the master challenge is stored in the data store in lieu of explicitly storing a respective challenge for every response in the set of response data records;

sending to the target a request comprising the respective challenge to the target, and in response receiving back a further instance of the response;

performing a comparison and verifying the identity of the target on condition that the comparison results in a match, wherein the comparison comprises:

in the case of a) the stored value of the response matches the further instance, or in the case of b) the attestation matches the transformation applied to the further instance.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 26, 2025
From: WRIGHT, CRAIG STEVEN; DAVIES, JACK OWEN
To: NCHAIN LICENSING AG
Reel/Frame 072123/0244 →
Priority Claims (1)
GB 2015475 · Sep 30, 2020 · national
Continuity (1)
Related Publication 20240015033A1 · Jan 11, 2024
References Cited (131)
US 8699714B2 · Tuyls et al. · 2014 [cited by applicant]
US 8868923B1 · Hamlet et al. · 2014 [cited by applicant]
US 10050785B2 · Tuyls et al. · 2018 [cited by applicant]
US 10250708B1 · Carver et al. · 2019 [cited by applicant]
US 10256983B1 · Bauer et al. · 2019 [cited by applicant]
US 10554405B1 · Endress et al. · 2020 [cited by applicant]
US 11288736B1 · Jette et al. · 2022 [cited by applicant]
US 11531985B2 · Weight et al. · 2022 [cited by applicant]
US 20020101988A1 · Jones · 2002 [cited by applicant]
US 20030204743A1 · Devadas et al. · 2003 [cited by applicant]
US 20070125857A1 · Tuyls · 2007 [cited by examiner]
US 20090083833A1 · Ziola et al. · 2009 [cited by applicant]
US 20090282259A1 · Skoric · 2009 [cited by examiner]
US 20110066670A1 · Yu · 2011 [cited by examiner]
US 20120242459A1 · Lambert · 2012 [cited by applicant]
US 20130142329A1 · Bell et al. · 2013 [cited by applicant]
US 20150019441A1 · Brown et al. · 2015 [cited by applicant]
US 20150095240A1 · Specogna et al. · 2015 [cited by applicant]
US 20150154408A1 · Jakobsson · 2015 [cited by applicant]
US 20190080392A1 · Youb · 2019 [cited by applicant]
US 20190130391A1 · Wright et al. · 2019 [cited by applicant]
US 20190213371A1 · Endress · 2019 [cited by examiner]
US 20190312734A1 · Wentz et al. · 2019 [cited by applicant]
US 20190334730A1 · Endress et al. · 2019 [cited by applicant]
US 20190394047A1 · Karame et al. · 2019 [cited by applicant]
US 20200076624A1 · Cambou · 2020 [cited by applicant]
US 20200153627A1 · Wentz · 2020 [cited by applicant]
US 20200162271A1 · Cambou · 2020 [cited by applicant]
US 20200259653A1 · Endress et al. · 2020 [cited by applicant]
US 20200322132A1 · Covaci et al. · 2020 [cited by applicant]
US 20200344058A1 · Wang · 2020 [cited by examiner]
US 20210058233A1 · Lee et al. · 2021 [cited by applicant]
US 20210124817A1 · Todd et al. · 2021 [cited by applicant]
US 20210390549A1 · Rule et al. · 2021 [cited by applicant]
US 20220021526A1 · Dugardin · 2022 [cited by examiner]
US 20220086127A1 · Hinh · 2022 [cited by applicant]
US 20220147974A1 · Law et al. · 2022 [cited by applicant]
US 20220231841A1 · Delsuc et al. · 2022 [cited by applicant]
US 20220263668A1 · Autiosalo et al. · 2022 [cited by applicant]
US 20220286303A1 · Woo · 2022 [cited by applicant]
US 20230037023A1 · Iwamura et al. · 2023 [cited by applicant]
US 20230098747A1 · Vijayaraghavan · 2023 [cited by applicant]
CN 108369697A · 2018 [cited by applicant]
CN 109150972A · 2019 [cited by applicant]
CN 111371868A · 2020 [cited by applicant]
CN 111488624A · 2020 [cited by applicant]
EP 1221120A1 · 2002 [cited by applicant]
EP 1683298B1 · 2008 [cited by applicant]
EP 2779067A1 · 2014 [cited by applicant]
EP 2526505B1 · 2015 [cited by applicant]
EP 1815637B1 · 2016 [cited by applicant]
EP 3340212A1 · 2018 [cited by applicant]
EP 3716525A1 · 2020 [cited by applicant]
GB 2592980A1 · 2021 [cited by applicant]
JP 2007513396A · 2007 [cited by applicant]
JP 2007293703A · 2007 [cited by applicant]
JP 2008517508A · 2008 [cited by applicant]
JP 2011123909A · 2011 [cited by applicant]
JP 2019121885A · 2019 [cited by applicant]
KR 20210000485A · 2021 [cited by applicant]
WO 03090259A2 · 2003 [cited by applicant]
WO 2019116032A1 · 2019 [cited by applicant]
WO 2020178752A1 · 2020 [cited by applicant]
WO 2020183035A1 · 2020 [cited by applicant]
WO 2020240290A1 · 2020 [cited by applicant]
WO 2020240291A1 · 2020 [cited by applicant]
WO 2021059054A1 · 2021 [cited by applicant]
Combined Search and Examination Report under Sections 17 and 18(3) for Application No. GB2015477.9, mailed on Mar. 26, 2021, 8 pages. [cited by applicant]
Combined Search and Examination Report under Sections 17 and 18(3) for Application No. GB2015487.8, mailed on Mar. 26, 2021, 08 pages. [cited by applicant]
Combined Search and Examination Report under Sections 17 and 18(3) for Application No. GB2015508.1, mailed on Mar. 31, 2021, 05 pages. [cited by applicant]
Combined Search and Examination Report under Sections 17 and 18(3) for Application No. GB2015541.2, mailed on Jul. 30, 2021, 10 pages. [cited by applicant]
Guin U., et al., “Ensuring Proof-of-Authenticity of IoT Edge Devices Using Blockchain Technology,” IEEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and… [cited by applicant]
International Search report and Written Opinion issued in International Application No. PCT/EP2021/073964, mailed on Nov. 10, 2021, 14 pages. [cited by applicant]
International Search report and Written Opinion issued in International Application No. PCT/EP2021/073969, mailed on Dec. 2, 2021, 17 pages. [cited by applicant]
International Search report and Written Opinion issued in International Application No. PCT/EP2021/073986, mailed on Dec. 2, 2021, 18 pages. [cited by applicant]
International Search report and Written Opinion issued in International Application No. PCT/EP2021/073999, mailed on Dec. 8, 2021, 15 pages. [cited by applicant]
Islam M.N., et al., “Enabling IC Traceability via Blockchain Pegged to Embedded PUF,” ACM Transactions on Design Automation of Electronic Systems, Apr. 5, 2019, vol. 24, No. 3, 23 pages, Retrieved from the Internet: URL… [cited by applicant]
Analog Devices, “Embedded Security and 1-Wire” [Retrieved on Feb. 20, 2023], 2 pages, Retrieved from the Internet: URL: https://www.analog.com/en/product-category/embedded-security-and-1wire.html. [cited by applicant]
Ardis K., “Demystifying the Physically Unclonable Function (PUF),” Feb. 1, 2019, Embedded Computing Design, 7 pages, Retrieved from the Internet: URL: https://embeddedcomputing.com/technology/processing/semiconductor-ip… [cited by applicant]
Braeken A., “Puf Based Authentication Protocol for IoT,” Symmetry, MDPI, vol. 10, Aug. 20, 2018, 16 pages. [cited by applicant]
Bush S., “Chip Combines Secure Hash Algorithm and PUF to Protect IoT, Industrial and Medical,” Electronics Weekly, Apr. 8, 2019, 2 pages, Retrieved from the Internet: URL: https://www.electronicsweekly.com/news/products… [cited by applicant]
Combined Search and Examination Report under Sections 17 and 18(3) for Application No. GB2015475.3, mailed on Jul. 12, 2021, 12 pages. [cited by applicant]
Combined Search and Examination Report under Sections 17 and 18(3) for Application No. GB2015498.5, mailed on Mar. 25, 2021, 6 pages. [cited by applicant]
EE Journal, “ChipDNA: Defend your IoT Designs from Hackers,” YouTube, Dec. 4, 2017, 1 page, Retrieved from the Internet: URL: https://www.youtube.com/watch?v=awcbUYNbooQ. [cited by applicant]
Gao Y., et al., “PUF-FSM: A Controlled Strong PUF, ”IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2017, 5 pages, Retrieved from the Internet: URL: 10.1109/tcad.2017.2740297. [cited by applicant]
Gassend B., et al., “Controlled Physical Random Functions and Applications,” ACM Transactions on Information and System Security, Jan. 22, 2008, [Retrieved on Sep. 16, 2020], vol. 10, No. 4, pp. 22 pages. [cited by applicant]
Gassend B., et al., “Controlled Physical Random Functions, ”18th Annual Computer Security Applications Conference, Dec. 2002, [Retrieved on Sep. 16, 2020], 12 pages. [cited by applicant]
Gassend B., et al., “Silicon Physical Random Functions,”Proceedings of the 9th ACM conference on Computer and Communications Security, Nov. 18, 2002, [Retrieved on Sep. 16, 2020], 13 pages. [cited by applicant]
Herder C., et al., “Physical Unclonable Functions and Applications: A Tutorial, ”Proceedings of the IEEE, Aug. 2014, vol. 102, No. 8, pp. 1126-1141, Retrieved from the Internet: URL: 10.1109/jproc.2014.2320516. [cited by applicant]
Hou S., et al., “A Lightweight and Secure-Enhanced Strong PUF design on FPGA, ”IEICE Electronics Express, Dec. 2019, [Retrieved on Sep. 16, 2020], vol. 16, No. 24, 6 pages, Retrieved from the Internet: URL: 10.1587/elex… [cited by applicant]
Huang H., et al., “Bitcoin-Based Fair Payments for Outsourcing Computations of Fog Devices,” Future Generation Computer Systems, Jan. 2018, vol. 78, pp. 850-858, Retrieved from the Internet: URL: https://www.researchgat… [cited by applicant]
International Search report and Written Opinion issued in International Application No. PCT/EP2021/073961, mailed on Nov. 10, 2021, 13 pages. [cited by applicant]
International Search report and Written Opinion issued in International Application No. PCT/EP2021/073991, mailed on Feb. 28, 2022, 16 pages. [cited by applicant]
Intrinsic ID, “Protecting a Device's Root Secrets with SRAM PUF” an Intrinsic ID Whiteboard Video, YouTube, Jan. 13, 2020, https://www.youtube.com/watch?v=22x8QUcp8is. [cited by applicant]
Intrinsic ID, “SRAM PUF Technology,” IoT Security, [Retrieved on Sep. 16, 2020], 1 page, Retrieved from the Internet: URL: https://www.intrinsic-id.com/sram-puf/. [cited by applicant]
Intrinsic ID., “SRAM PUF: The Secure Silicon Fingerprint,” White Paper, 2017, 6 pages, Retrieved from the Internet: URL: https://www.semanticscholar.org/paper/SRAM-PUF-%3A-The-Secure-Silicon-Fingerprint/e823f6078233b3f9… [cited by applicant]
Maxim Integrated, “How ChipDNA PUF Technology Protects Your Secrets,” Jan. 28, 2019, YouTube, 1 page, https://www.youtube.com/watch?v=b2AucKwx9ec. [cited by applicant]
Mohanty S.P., et al., “PUFchain: Hardware-Assisted Blockchain for Sustainable Simultaneous Device and Data Security in the Internet of Everything (IoE),” arxiv.org, Sep. 14, 2019, 38 pages. [cited by applicant]
Mouser Electronics, “Maxim's DS2477 Secure I [cited by applicant]
Mouser Electronics, “Maxim Integrated DS2477 Secure I2C Coprocessor,” Mar. 8, 2019, 2 pages, Retrieved from the Internet: URL: https://eu.mouser.com/new/maxim-integrated/maxim-ds2477-coprocessor/. [cited by applicant]
Nakamoto S, “Bitcoin: A Peer-to-Peer Electronic Cash System,” Oct. 31, 2008, 6 pages, Retrieved from the Internet: URL: https://nakamotoinstitute.org/bitcoin/, on Feb. 18, 2020. [cited by applicant]
Ravikanth P.S., “Physical One-Way Functions,” Massachusetts Institute of Technology, Mar. 2001, 154 pages. [cited by applicant]
Ruhrmair U., et al., “PUFs at a Glance,” Design, Automation & Test in Europe Conference & Exhibition (Date), Mar. 2014, 6 pages, Retrieved from the Internet: URL: https://spqrlab1.github.io/papers/holcomb_PUFs_d… [cited by applicant]
Ruhrmair U., et al., “Modeling Attacks on Physical Unclonable Functions,” Proceedings of the 17th ACM Conference on Computer and Communications Security, Oct. 4, 2010, [Retrieved on Sep. 16, 2020], 11 pages. [cited by applicant]
Sutar S., et al., “Memory-Based Combination PUFs for Device Authentication in Embedded Systems,” IEEE Transactions on Multi-Scale Computing Systems, vol. 4 (4), Oct. 2018, pp. 793-810. [cited by applicant]
Wisiol N., et al., “Breaking the Lightweight Secure PUF: Understanding the Relation of Input Transformations and Machine Learning Resistance,” International Association for Cryptologic Research, retrieved from the Inter… [cited by applicant]
Zhang J., et al., “A PUF-FSM Binding Scheme for FPGA IP Protection and Pay-Per-Device Licensing,”IEEE Transactions on Information Forensics and Security, Jun. 2015, vol. 10, No. 6, pp. 1137-1150, Retrieved from the Inte… [cited by applicant]
Zhang W., “Simplified Payment Verification,” Aug. 25, 2020, 7 pages, Retrieved from the Internet: URL: https://medium.com/nchain/simplified-payment-verification-48ac60f1b26c. [cited by applicant]
Asif R., et al., “Proof-of-PUF Enabled Blockchain: Concurrent Data and Device Security for Internet-of-Energy,” Sensors, Dec. 23, 2020, vol. 21, No. 1,32 pages. [cited by applicant]
Bitstagram, “Bitcoin Genesis Block,” 2018, Retrieved from the Internet: https://bitstagram.bitdb.network/, 4 pages. [cited by applicant]
BSV Explorer, “Mainnet Summary,” Retrieved on Aug. 20, 2020, 2 pages, Retrieved from the Internet: URL: https://whatsonchain.com/. [cited by applicant]
Connolly D., “Bitcoin SV,” GitHub 2018, retrieved from the internet: https://github.com/bitcoin-sv/bitcoin-sv, 2 pages. [cited by applicant]
Dahlberg R., et al., “Efficient Sparse Merkle Trees Caching Strategies and Secure (Non-) Membership Proofs,” 2016, retrieved from the internet: https://eprint.iacr.org/2016/683.pdf, 16 pages. [cited by applicant]
Hearn M., et al., “Connection Bloom filtering,” Retrieved on Aug. 20, 2020, 10 pages, Retrieved from the Internet : URL: https://github.com/bitcoin/bips/wiki/Comments:BIP-0037. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/EP2022/050955 mailed May 13, 2022, 13 pages. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/EP2022/059690 mailed Jul. 29, 2022, 12 pages. [cited by applicant]
International Search report and Written Opinion issued in International Application No. PCT/EP2022/056543, mailed on Jun. 21, 2022, 14 pages. [cited by applicant]
Islam., M.N., et al., “Remote Configuration of Integrated Circuit Features and Firmware Management via Smart Contract,” 2019 IEEE International Conference on Blockchain (Blockchain), Jul. 14, 2019, pp. 325-331. [cited by applicant]
Keane S., “The Huawei Controversy: Everything You Need To Know,” Security, Feb. 22, 2019, retrieved from the internet: https://www.cnet.com/news/the-huawei-controversy-everything-you-need-to-know/, 1 page. [cited by applicant]
Longo R., et al., “Threshold Multi-Signature with an Offline Recovery Party,” IACR, International Association for Cryptologic Research, vol. 160305, [Retrieved on Jan. 7, 2020], 31 pages, Retrieved from the Internet: UR… [cited by applicant]
Merkle R.C., “Secrecy, Authentication, and Public Key Systems,” Information System Laboratory, Jun. 1979, Technical Report No. 1979-1, retrieved from the internet: http://www.ralphmerkle.com/papers/Thesis1979.pdf, 193 p… [cited by applicant]
Nakamoto S., “Bitcoin: A Peer-to-Peer Electronic Cash System,” 2009 [Oct. 31, 2008], Retrieved from the internet: https://bitcoin.org/bitcoin.pdf, 9 pages. [cited by applicant]
Obermaier J., et al., “An Embedded Key Management System for PUF-based Security Enclosures,” 7th Mediterranean Conference on Embedded Computing (MECO), Jun. 2018, 6 pages. [cited by applicant]
Relay R., “Hardware Wallets Explained,” Medium, Feb. 27, 2019, [Retrieved on: Jan. 27, 2021], 7 pages, Retrieved from the Internet: URL: https://medium.com/radartech/hardware-wallets-explained-da8bd93ce801. [cited by applicant]
Schrijen G-J., SRAM PUF: A Closer Look at the Most Reliable and Most Secure PUF, Intrinsic ID, 2020, 3 pages, Retrieved from the Internet: URL: https://www.design-reuse.com/articles/47782/sram-puf-a-closer-look-at-the-m… [cited by applicant]
Weather SV, Retrieved on Aug. 20, 2020, 2 pages, Retrieved from the Internet: URL: https://weathersv.app/find. [cited by applicant]
Wuille P., “Hierarchical Deterministic Wallets,” GitHub, Retrieved from the Internet: URL:https://github.com/bitcoin/bips/blob/master/bi p-0032, MediaWiki, Feb. 11, 2012, pp. 1-18. [cited by applicant]
Mars, Ayoub et al., Fair Exchange and Anonymous E-Commerce by Deploying Clone-Resistant Tokens. 2019 42nd International Convention on Information and Communication Technology, Electronics, and Microelectronics (MIPRO), … [cited by applicant]
Fuchita Y., “Special Feature: Innovation and Finance—Blockchain and Financial Transaction Innovation,” Nomura capital markets quarterly, Japan, Nomura Institute of Capital Markets Research, Nov. 1, 2015, vol. 19, No.2 (… [cited by applicant]
JP2023-519324 Office Action dated Jan. 20, 2026, 2 pages. [cited by applicant]
EP25213015.8 Extended European Search Report dated Jan. 28, 2026, 8 pages. [cited by applicant]