IP Library › Granted Patent US 12,659,141
Granted Patent B2
US 12,659,141 · App. 18/824,751 · Granted Jun 16, 2026

Verifiable polynomial function secret sharing

Inventors: Foo Yee Yeo (Singapore, SG); Nolan Ashvin Miranda (Winston-Salem, NC); Hannah Elizabeth Davis (Shakopee, MN); Jason Hwei Ming Ying (Singapore, SG)
Assignee: SEAGATE TECHNOLOGY LLC
H04L9/085H04L9/3026H04L9/3247
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,659,141
App. No.
18/824,751
Granted
Jun 16, 2026
Kind
B2
Abstract

A dealer receives a first addend function and a second addend function. A function client provides first validation parameters, each first validation parameter corresponding to a coefficient of the first addend function and a corresponding coefficient of the second addend function. The sum of the first addend function and the second addend function equals the polynomial function. The dealer generates a function share for each share party based on a sampling of first random polynomials and second random polynomials and generates second validation parameters for each share party based on the function shares. The dealer transmits the second validation parameters to the share parties and transmits each function share to a corresponding share party. Each function share is verifiable by the corresponding share party based on the second validation parameters and a signed concatenation of the first validation parameters.

Claims (34)

1 . A computing-processor-implemented method for polynomial function secret sharing by a dealer, wherein a polynomial function of a function client is shared by the dealer and is verifiable by multiple share parties and the function client generates a signed concatenation of first validation parameters, the computing-processor-implemented method comprising:

receiving, by the dealer, a first addend function and a second addend function, wherein a sum of the first addend function and the second addend function equals the polynomial function and each first validation parameter corresponds to a coefficient of the first addend function and a corresponding coefficient of the second addend function;

generating, by the dealer, a function share for each share party based on a sampling of first random polynomials and second random polynomials;

generating, by the dealer, second validation parameters for each share party based on the function shares, each second validation parameter for each share party corresponding to a coefficient of the first random polynomials or the second random polynomials;

transmitting, by the dealer, the second validation parameters to the share parties; and

transmitting, by the dealer, each function share to a corresponding share party, wherein each function share is verifiable by the corresponding share party as being a share of the polynomial function received by the dealer from the function client, verification being based on the second validation parameters and the signed concatenation of the first validation parameters.

2 . The computing-processor-implemented method of claim 1 , wherein a constant term in each of the first random polynomials equals a coefficient of the first addend function and a constant term in each of the second random polynomials equals a coefficient of the second addend function.

3 . The computing-processor-implemented method of claim 1 , wherein each function share includes evaluations of the first random polynomials and the second random polynomials corresponding to a corresponding one of the share parties.

4 . The computing-processor-implemented method of claim 1 , wherein each first validation parameter includes a first randomly generated base having an exponent equaling a coefficient of the first addend function and a second randomly generated base element having an exponent equaling a corresponding coefficient of the second addend function.

5 . The computing-processor-implemented method of claim 4 , wherein each second validation parameter includes the first randomly generated base having an exponent equaling a coefficient of the first random polynomials and a second randomly generated base element having an exponent equaling the corresponding coefficient of the second random polynomials.

6 . The computing-processor-implemented method of claim 1 , wherein a share party is configured to verify its function share based on the first validation parameters and the second validation parameters.

7 . The computing-processor-implemented method of claim 1 , wherein a reconstructor is configured to verify function share results generated by share parties based on the second validation parameters.

8 . A computing system for polynomial function secret sharing by a dealer, wherein a polynomial function of a function client is shared by the dealer and is verifiable by multiple share parties and the function client generates a signed concatenation of first validation parameters, the computing system comprising:

one or more hardware processors;

a communication interface executable by the one or more hardware processors and configured to receive a first addend function and a second addend function, wherein a sum of the first addend function and the second addend function equals the polynomial function and each first validation parameter corresponds to a coefficient of the first addend function and a corresponding coefficient of the second addend function;

a function share generator executable by the one or more hardware processors and configured to generate a function share for each share party based on a sampling of first random polynomials and second random polynomials; and

a validation parameter generator executable by the one or more hardware processors and configured to generate second validation parameters for each share party based on the function shares, each second validation parameter for each share party corresponding to a coefficient of the first random polynomials or the second random polynomials, wherein the communication interface is further configured to transmit the second validation parameters to the share parties and to transmit each function share to a corresponding share party, wherein each function share is verifiable by the corresponding share party as being a share of the polynomial function received by the dealer from the function client, verification being based on the second validation parameters and the signed concatenation of the first validation parameters.

9 . The computing system of claim 8 , wherein a constant term in each of the first random polynomials equals a coefficient of the first addend function and a constant term in each of the second random polynomials equals a coefficient of the second addend function.

10 . The computing system of claim 8 , wherein each function share includes evaluations of the first random polynomials and the second random polynomials corresponding to a corresponding one of the share parties.

11 . The computing system of claim 8 , wherein each first validation parameter includes a first randomly generated base element raised to an exponent equaling a coefficient of the first addend function and a second randomly generated base element raised to an exponent equaling a corresponding coefficient of the second addend function.

12 . The computing system of claim 11 , wherein each second validation parameter includes the first randomly generated base element raised to an exponent equaling a coefficient of the first random polynomials and a second randomly generated base element raised to an exponent equaling the corresponding coefficient of the second random polynomials.

13 . The computing system of claim 8 , wherein a share party is configured to verify its function share based on the first validation parameters and the second validation parameters.

14 . The computing system of claim 8 , wherein a reconstructor is configured to verify function share results generated by share parties based on the second validation parameters.

15 . One or more tangible processor-readable storage media embodied with instructions for executing on one or more processors and circuits of a computing device a process for polynomial function secret sharing by a dealer, wherein a polynomial function of a function client is shared by the dealer and is verifiable by multiple share parties and the function client generates a signed concatenation of first validation parameters, the process comprising:

receiving, by the dealer, a first addend function and a second addend function, wherein a sum of the first addend function and the second addend function equals the polynomial function and each first validation parameter corresponds to a coefficient of the first addend function and a corresponding coefficient of the second addend function;

generating, by the dealer, a function share for each share party based on a sampling of first random polynomials and second random polynomials;

generating, by the dealer, second validation parameters for each share party based on the function shares, each second validation parameter for each share party corresponding to a coefficient of the first random polynomials or the second random polynomials;

transmitting, by the dealer, the second validation parameters to the share parties; and

transmitting, by the dealer, each function share to a corresponding share party, wherein each function share is verifiable by the corresponding share party as being a share of the polynomial function received by the dealer from the function client, verification being based on the second validation parameters and the signed concatenation of the first validation parameters.

16 . The one or more tangible processor-readable storage media of claim 15 , wherein a constant term in each of the first random polynomials equals a coefficient of the first addend function and a constant term in each of the second random polynomials equals a coefficient of the second addend function.

17 . The one or more tangible processor-readable storage media of claim 15 , wherein each function share includes evaluations of the first random polynomials and the second random polynomials corresponding to a corresponding one of the share parties.

18 . The one or more tangible processor-readable storage media of claim 15 , wherein each first validation parameter includes a first randomly generated base element raised to an exponent equaling a coefficient of the first addend function and a second randomly generated base element raised to an exponent equaling a corresponding coefficient of the second addend function, and each second validation parameter includes the first randomly generated base element raised to an exponent equaling a coefficient of the first random polynomials and a second randomly generated base element raised to an exponent equaling the corresponding coefficient of the second random polynomials.

19 . The one or more tangible processor-readable storage media of claim 15 , wherein a share party is configured to verify its function share based on the first validation parameters and the second validation parameters.

20 . The one or more tangible processor-readable storage media of claim 15 , wherein a reconstructor is configured to verify function share results generated by share parties based on the second validation parameters.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 21, 2025
From: YEO, FOO YEE; MIRANDA, NOLAN ASHVIN; DAVIS, HANNAH ELIZABETH; YING, JASON HWEI MING
To: SEAGATE TECHNOLOGY LLC
Reel/Frame 072083/0926 →
Continuity (1)
Related Publication 20260067070A1 · Mar 5, 2026
References Cited (25)
US 5708714A · Lopez et al. · 1998 [cited by applicant]
US 6804805B2 · Rub · 2004 [cited by examiner]
US 7502467B2 · Brainard et al. · 2009 [cited by applicant]
US 7747865B2 · Krawczyk · 2010 [cited by applicant]
US 8983075B2 · D'Souza · 2015 [cited by applicant]
US 9485092B2 · Smets et al. · 2016 [cited by applicant]
US 9813243B1 · Triandopoulos et al. · 2017 [cited by applicant]
US 10326590B2 · Smith et al. · 2019 [cited by applicant]
US 10950144B2 · Ikarashi · 2021 [cited by applicant]
US 11323251B2 · Fries et al. · 2022 [cited by applicant]
US 11354199B2 · Basu et al. · 2022 [cited by applicant]
US 11695549B2 · Damiano et al. · 2023 [cited by applicant]
US 20140173270A1 · Matsuo · 2014 [cited by examiner]
US 20210028939A1 · Trevethan · 2021 [cited by examiner]
Boyle, Elette , et al., “Function Secret Sharing”, International Association for Cryptologic Research: Eurocrypt 2015, Part II, LNCS 9057, 2015, 337-367. [cited by applicant]
Boyle, Elette , et al., “Function Secret Sharing: Improvements and Extensions”, CCS '16: Proceedings of the 2016 ACM SIGSAC Conference on Computer Communications Security, Oct. 2016, 1292-1303. [cited by applicant]
Boyle, Elette , et al., “Secure computation with preprocessing via function secret sharing”, TCC, 2019, 341-371. [cited by applicant]
De Castro, Leo , et al., “Lightweight, maliciously secure verifiable function secret sharing”, Annual International Conference on the Theory and Applications of Cryptographic Techniques; Springer International Publishin… [cited by applicant]
Koshiba, Takeshi , “Fourier-based Function Secret Sharing with General Access Structure”, arXiv:1712.00735, Dec. 3, 2017. [cited by applicant]
Koshiba, Takeshi , “Fourier-based verifiable function secret sharing”, 2020 International Symposium on Information Theory and Its Applications (ISITA). IEEE, 2020, 442-446. [cited by applicant]
Kruglik, Stanislav , et al., “Verifiable information-theoretic function secret sharing”, IACR Cryptology ePrint Archive, Paper 2024/453; https://eprint.iacr.org/2024/453, 2024. [cited by applicant]
Luo, J. , “Efficient Threshold Function Secret Sharing With Information—Theoretic Security”, IEEE Access, vol. 8, Jan. 3, 2020, 6523-6532. [cited by applicant]
Miranda, Nolan , et al., “Function-private conditional disclosure of secrets and multi-evaluation threshold distributed point functions”, Cryptology and Network Security: 20th International Conference, CANS 2021; Spring… [cited by applicant]
Shamir, Adi , “How to share a secret”, Communications of the ACM, vol. 22, Issue 11, Nov. 1979, 612-613. [cited by applicant]
Wang, Frank , et al., “Splinter: Practical Private Queries on Public Data”, 14th {Usenix} Symposium on Networked Systems Design and Implementation, 2017. [cited by applicant]