IP Library › Granted Patent US 12,256,023
Granted Patent B2
US 12,256,023 · App. 18/382,427 · Granted Mar 18, 2025

Computer implemented method and system for obtaining digitally signed data

Inventor: Craig Steven Wright (London, GB)
Assignee: NCHAIN LICENSING AG
H04L9/3252H04L9/085H04L9/3066H04L9/3239H04L9/50H04L2209/16
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,256,023
App. No.
18/382,427
Granted
Mar 18, 2025
Kind
B2
Abstract

A method of obtaining digitally signed data is disclosed. The method comprises sending first data (e 2 ) from at least one of a plurality of first participants to at least one second participant, wherein the first data is based on second data (e) accessible to at least one said first participant, and the second data is inaccessible to the or each said second participant. A digital signature (s 1 ) of the first data is received from at least one said second participant, and the digital signature of the first data is processed, by a plurality of the first participants, to provide shares of a digital signature (s) of the second data, wherein the digital signature of said second data is accessible by means of a threshold number of said shares and is inaccessible to less than said threshold number of shares.

Claims (52)

1. A method of obtaining digitally signed data, the method comprising:

(a) sending first data from at least one of a plurality of first participants to at least one second participant, wherein:

said first data is a blinded version of second data, wherein said second data is accessible to at least one said first participant and inaccessible to said at least one second participant,

said first data is generated by means of a threshold sharing scheme using shares of said first data, and

each share of said first data includes shares of a plurality of first secret values shared among said plurality of said first participants;

(b) receiving, from at least one said second participant, a digital signature of said first data;

(c) processing said digital signature of said first data, by a plurality of said first participants, to provide, using a calculation having said digital signature of said first data as an input, shares of a digital signature of said second data, wherein:

said digital signature of said second data is generated by a threshold sharing scheme using said shares of said digital signature of said second data, and

each share of said digital signature of said second data includes shares of a plurality of said first secret values;

(d) at the plurality of first participants, generating a plurality of updated secret values using the plurality of first secret values; and

(e) repeating steps (a)-(c) using the updated secret values instead of the first secret values.

2. The method according to claim 1 , wherein each updated secret value is generated by adding a zero share to a first secret value.

3. The method according to claim 1 , wherein shares of said plurality of first secret values are shared among said plurality of said first participants by means of joint random secret sharing (JRSS).

4. The method according to claim 1 , wherein each share of said digital signature of said second data includes at least one first masking share, shared among said plurality of first participants by means of joint zero secret sharing (JZSS).

5. The method according to claim 1 , wherein each share of said first data includes at least one second masking share, shared among said plurality of first participants by means of joint zero secret sharing (JZSS).

6. The method according to claim 1 , wherein the digital signature of the first data is generated by means of shares of said digital signature of said first data, shared among a plurality of said second participants, wherein said digital signature of said first data is accessible by means of a threshold number of said shares and is inaccessible to less than said threshold number of said shares.

7. The method according to claim 6 , wherein each share of said digital signature of said first data includes shares of a plurality of second secret values, shared among a plurality of said second participants by means of joint random secret sharing (JRSS).

8. The method according to claim 7 , further comprising:

receiving, from at least one said second participant, third data based on said second secret values.

9. The method according to claim 7 , wherein each share of said digital signature of said first data includes at least one third masking share, shared among said plurality of said second participants by means of joint zero secret sharing (JZSS).

10. The method according to claim 1 , wherein the second data is a message.

11. The method according to claim 1 , wherein the second data is a hash value of a message.

12. The method according to claim 1 , wherein the first data is a blockchain transaction.

13. The method according to claim 1 , wherein at least one said digital signature is based on a cryptography system having a homomorphic property.

14. The method according to claim 13 , wherein at least one said digital signature is based on an elliptic curve cryptography system.

15. A computer-implemented system for obtaining digitally signed data comprising:

a processor; and memory including executable instructions that, as a result of execution by the processor, cause the computer-implemented system to perform a method of:

(a) sending first data from at least one of a plurality of first participants to at least one second participant, wherein:

said first data is a blinded version of second data, wherein said second data is accessible to at least one said first participant and inaccessible to said at least one second participant,

said first data is generated by means of a threshold sharing scheme using shares of said first data, and

each share of said first data includes shares of a plurality of first secret values shared among said plurality of said first participants;

(b) receiving, from at least one said second participant, a digital signature of said first data;

(c) processing said digital signature of said first data, by a plurality of said first participants, to provide, using a calculation having said digital signature of said first data as an input, shares of a digital signature of said second data, wherein:

said digital signature of said second data is generated by a threshold sharing scheme using said shares of said digital signature of said second data, and

each share of said digital signature of said second data includes shares of a plurality of said first secret values;

(d) at the plurality of first participants, generating a plurality of updated secret values using the plurality of first secret values; and

(e) repeating steps (a)-(c) using the updated secret values instead of the first secret values.

16. The computer-implemented system according to claim 15 , wherein each updated secret value is generated by adding a zero share to a first secret value.

17. The computer-implemented system according to claim 15 , wherein shares of said plurality of first secret values are shared among said plurality of said first participants by means of joint random secret sharing (JRSS).

18. A non-transitory computer-readable storage medium for obtaining digitally signed data, having stored thereon executable instructions that, as a result of being executed by a processor of a computer system, cause the computer system to at least perform a method of:

(a) sending first data from at least one of a plurality of first participants to at least one second participant, wherein:

said first data is a blinded version of second data, wherein said second data is accessible to at least one said first participant and inaccessible to said at least one second participant,

said first data is generated by means of a threshold sharing scheme using shares of said first data, and

each share of said first data includes shares of a plurality of first secret values shared among said plurality of said first participants;

(b) receiving, from at least one said second participant, a digital signature of said first data;

(c) processing said digital signature of said first data, by a plurality of said first participants, to provide, using a calculation having said digital signature of said first data as an input, shares of a digital signature of said second data, wherein:

said digital signature of said second data is generated by a threshold sharing scheme using said shares of said digital signature of said second data, and

each share of said digital signature of said second data includes shares of a plurality of said first secret values;

(d) at the plurality of first participants, generating a plurality of updated secret values using the plurality of first secret values; and

(e) repeating steps (a)-(c) using the updated secret values instead of the first secret values.

19. The non-transitory computer-readable storage medium according to claim 18 , wherein each updated secret value is generated by adding a zero share to a first secret value.

20. The non-transitory computer-readable storage medium according to claim 18 , wherein said shares of said plurality of first secret values are shared among said plurality of said first participants by means of joint random secret sharing (JRSS).

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 20, 2023
From: WRIGHT, CRAIG
To: NCHAIN HOLDINGS LTD
Reel/Frame 065300/0181 →
CHANGE OF NAME Recorded Oct 20, 2023
From: NCHAIN HOLDINGS LTD
To: NCHAIN LICENSING AG
Reel/Frame 065304/0369 →
Priority Claims (2)
GB 1800706 · Jan 16, 2018 · national
WO PCT/IB2018/050264 · Jan 16, 2018 · international
Continuity (2)
Continuation 16962800
Related Publication 20240154819A1 · May 9, 2024
References Cited (42)
US 9049011B1 · Agrawal · 2015 [cited by applicant]
US 9753964B1 · Marshall et al. · 2017 [cited by applicant]
US 10050779B2 · Alness et al. · 2018 [cited by applicant]
US 20040139029A1 · Zhang et al. · 2004 [cited by applicant]
US 20070192607A1 · Canard et al. · 2007 [cited by applicant]
US 20110213975A1 · Somniotti et al. · 2011 [cited by applicant]
US 20130346755A1 · Nguyen et al. · 2013 [cited by applicant]
US 20170063559A1 · Wallrabenstein · 2017 [cited by applicant]
US 20170324545A1 · Brandenburger et al. · 2017 [cited by applicant]
US 20170339163A1 · Alhothaily et al. · 2017 [cited by applicant]
US 20180203916A1 · Rafsky et al. · 2018 [cited by applicant]
US 20190035018A1 · Nolan et al. · 2019 [cited by applicant]
US 20190138753A1 · Wallrabenstein · 2019 [cited by applicant]
US 20190205125A1 · van Schaik · 2019 [cited by applicant]
CN 106127079A · 2016 [cited by applicant]
“Bitcoin Blind Signatures,” GitHub.com, https://github.com/oleganza/bitcoin-papers/blob/master/BitcoinBlindSignatures.md, Jul. 2, 2018, 6 pages. [cited by applicant]
Andreev, “Bitcoin-Papers,” retrieved from https://github.com/oleganza/bitcoin-papers/blob/943eae200e1587db82e5df09c8554a8c944dc043/BitcoinBlindSignatures.md, Mar. 10, 2015, 10 pages. [cited by applicant]
Antonopoulos, “Mastering Bitcoin—Unlocking Digital Cryptocurrencies,” O'Reilly Media, Inc., Dec. 20, 2014, 282 pages. [cited by applicant]
Bresson et al. “Threshold Ring Signatures and Applications to Ad-hoc Groups,” retrieved from http://web.cs.ucdavis.edu/˜franklin/ecs289/2010/bresson_etal_2002.pdf, 2002, 24 pages. [cited by applicant]
Chow et al. “Two Improved Partially Blind Signature Schemes from Bilinear Pairings,” retrieved from https://eprint.acr.org/2004/108.pdf, 2004, 18 pages. [cited by applicant]
Dahshan et al., “A Threshold Blind Digital Signature Scheme Using Elliptic Curve Dlog-Based Cryptosystem,” IEEE 81st Vehicular Technology Conference, 2015, 5 pages. [cited by applicant]
Gennaro et al., “Robust Threshold DSS Signatures,” International Conference on the Theory and Applications of Cryptographic Techniques, 1996, 33 pages. [cited by applicant]
Goldfeder et al., “Securing Bitcoin Wallets via a New DSA/ECDSA threshold signature scheme,” manuscript, https://www.cs.princeton.edu/˜stevenag/threshold_sigs.pdf, 2015 [retrieved Jun. 21, 2018], 26 pages. [cited by applicant]
Goldfeder et al., “Securing Bitcoin wallets via threshold signatures” Princeton's Center for Information Technology Policy, Mar. 28, 2014, 11 pages. [cited by applicant]
Goldfeder et al., “Securing Bitcoin wallets via threshold signatures,” retrieved from http://www.cs.princeton.edu/˜stevenag/bitcoin_threshold_signatures.pdf, Jun. 3, 2014, 11 pages. [cited by applicant]
Green et al., “Strength in Numbers: Threshold ECDSA to Protect Keys in the Cloud,” Worcester Polytechnic Institute, retrieved from https://eprint.iacr.org/2015/1169.pdf, 2015, 19 pages. [cited by applicant]
Heilman et al., “Blindly Signed Contracts: Anonymous On-Blockchain and Off-Blockchain Bitcoin Transactions,” International Conference on Financial Cryptography and Data Security, Feb. 22, 2016, 15 pages. [cited by applicant]
Horster et al. “Blind Multisignature Schemes and Their Relevance to Electronic Voting,” University of Technology Chemnitz-Zwickau, Aug. 1995, 9 pages. [cited by applicant]
Ibrahim et al., “A robust threshold elliptic curve digital signature providing a new verifiable secret sharing scheme,” 2003 IEEE 46th Midwest Symposium on Circuits and Systems 1:276-280, Dec. 30, 2003, 6 pages. [cited by applicant]
International Search Report and Written Opinion for Application No. PCT/IB2019/050178, mailed Mar. 14, 2019, filed Jan. 10, 2019. [cited by applicant]
Jena et al. “A Novel Untraceable Blind Signature Based on Elliptic Curve Discrete Logarithm Problem,” International Journal of Computer Science and Network Security, 7(6): Jun. 2007, 7 pages. [cited by applicant]
Kuchta et al. “Rerandomizable Threshold Blind Signatures,” retrieved from https://link.springer.com/chapter/10.1007%2F978-3-319-27998-5_5, 2014, 20 pages. [cited by applicant]
Maxwell, “IRC Chat Logs,” retrieved from https://download.wpsoftware.net/bitcoin/wizards/2014-02-17.html, Feb. 17, 2015, 6 pages. [cited by applicant]
Maxwell, “Protocol or Paper for Joint Random Secret Sharing,” Bitcoin Talk, retrieved from https://bitcointalk.org/index.php?topic=983665.5, Mar. 9, 2015, 3 pages. [cited by applicant]
Miao et al., “Secure Multi-Server-Aided Data Deduplication in Cloud Computing,” Pervasive and Mobile Computing, 2015, 9 pages. [cited by applicant]
Nakamoto, “Bitcoin: A Peer-to-Peer Electronic Cash System,” Bitcoin, Oct. 31, 2008, https://bitcoin.org/bitcoin. pdf, 9 pages. [cited by applicant]
Oleganza et al. “CoreBitcoin,” retrieved from https://github.com/oleganza/CoreBitcoin/blob/master/CoreBitcoin/BTCBlindSignature.m, Dec. 15, 2015, 10 pages. [cited by applicant]
Satoshi et al., “Connection Limits,” Bitcoin Forum, Aug. 9, 2010, https://bitcointalk.org/index.php?topic=741.0;prev_next=prev, 2 pages. [cited by applicant]
Sun et al. “Threshold Proxy Signatures,” IEE Proceedings Computers and Digital Technique, 146(5): Sep. 22, 1999, pp. 259-263. [cited by applicant]
UK Commercial Search Report mailed May 11, 2018, Patent Application No. GB1800706.2, 7 pages. [cited by applicant]
UK IPO Search Report mailed Jul. 5, 2018, Patent Application No. GB1800706.2, 9 pages. [cited by applicant]
Wu et al. “Secure Joint Bitcoin Trading with Partially Blind Threshold Signatures,” retrieved from https://link.springer.com/article/10.1007%2Fs00500-015-1997-6, Jun. 2017, 15 pages. [cited by applicant]