IP Library › Granted Patent US 12,250,316
Granted Patent B2
US 12,250,316 · App. 18/172,748 · Granted Mar 11, 2025

Methods and systems for selecting an optimal proof system for zero-knowledge and other proofs

Inventors: Aaron B. Greenblatt (Redwood City, CA); Francesca Scire-Scappuzzo (Lexington, MA); Soham Bhattacharya (San Jose, CA); Sahil Mahendrakar (Nashua, NH); Saloni Gupta (Cupertino, CA)
Assignee: Turbo Protocol, Inc.
H04L9/3221H04L9/008
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,250,316
App. No.
18/172,748
Granted
Mar 11, 2025
Kind
B2
Abstract

Methods and systems are presented for generating a zero-knowledge, or other, proof for a prover (user) in need of specialized services for generating a zero-knowledge proof. The prover transmits a proof request comprising a witness and a statement to an orchestrator. The orchestrator determines an optimal zero-knowledge proof system for the particular statement and witness. It then transmits the proof request to a prover network with the optimal proof system to generate a zero-knowledge proof in an efficient manner. The proof is then transmitted back to the orchestrator and/or published or otherwise made available.

Claims (54)

1. A method of generating a zero-knowledge proof, the method comprising:

receiving a request for a proof of a statement, the request comprising the statement, a witness, and a user-specified parameter;

analyzing, for each candidate proof system of a plurality of candidate proof systems, the statement and the witness to determine an amount of memory required for a potential proof,

evaluating, for each candidate proof system of the plurality of candidate proof systems, the statement and the witness to determine a computational requirement for the potential proof,

selecting a selected proof system from the candidate proof systems based on the analyzing and the evaluating, the potential proof from the selected proof system satisfying the user-specified parameter;

transmitting the statement and the witness to a prover computer network for execution of the selected proof system;

receiving the proof of the statement; and

making the proof available to a client computer.

2. The method of claim 1 , wherein the candidate proof systems include a zero succinct non-interactive argument of knowledge (SNARK) proof system and a scalable transparent argument of knowledge (STARK) proof system.

3. The method of claim 2 , further comprising:

ascertaining from the statement and the witness that generating the potential proof in any proof system of the candidate proof systems would require computing sequential and different tasks,

wherein the selected proof system is the SNARK proof system.

4. The method of claim 2 , wherein the SNARK proof systems include a rank-1 constraint system (R1CS) proof system and a permutations over Lagrange-bases for oecumenical noninteractive arguments of knowledge (PLONK) proof system.

5. The method of claim 2 , further comprising:

ascertaining from the statement and the witness that generating the potential proof in any proof system of the candidate proof systems would require computing repetitive and parallel tasks including recursion,

wherein the selected proof system is the STARK proof system.

6. The method of claim 2 , wherein the STARK proof system employs an arithmetic intermediate representation (AIR) step.

7. The method of claim 1 , wherein the user-specified parameter includes a user-specified do-not-exceed amount of memory for the proof.

8. The method of claim 1 , wherein the user-specified parameter includes a user specified lowest computational requirement.

9. The method of claim 1 , wherein the amount of memory required for the proof for each candidate proof system is determined by inputting the statement, the witness, and an attribute for each proof system into a first predictive function.

10. The method of claim 1 , further comprising:

detecting an amount of load that candidate prover computer networks are handling; and

selecting the prover computer network from among the candidate prover computer networks based on the detecting.

11. The method of claim 1 , wherein the prover computer network comprises a graphics processing unit (GPU), a field-programmable gate array (FPGA), an application-specific integrated circuit (ASIC), a central processing unit (CPU), or any combination thereof.

12. The method of claim 1 , further comprising:

encrypting the witness through a homomorphic encryption.

13. The method of claim 1 , further comprising:

determining that the statement can be broken into chunks that can be processed in parallel; and

dividing the statement into the chunks before the transmitting.

14. The method of claim 1 , further comprising:

converting, by the prover computer network, the statement into an arithmetic circuit.

15. The method of claim 14 , further comprising:

sending, by the prover computer network, the arithmetic circuit to a trusted setup, wherein the trusted setup generates a randomness.

16. The method of claim 1 , wherein making the proof available includes storing the statement and the proof in a blockchain, in a decentralized storage network, or on a centralized cloud storage.

17. A non-transitory computer-readable medium for generating a zero-knowledge proof, the medium comprising instructions stored thereon, that when executed on a processor, perform operations comprising:

receiving a request for a proof of a statement, the request comprising the statement, a witness, and a user-specified parameter;

analyzing, for each candidate proof system of a plurality of candidate proof systems, the statement and the witness to determine an amount of memory required for a potential proof,

evaluating, for each candidate proof system of the plurality of candidate proof systems, the statement and the witness to determine a computational requirement for the potential proof,

selecting a selected proof system from the candidate proof systems based on the analyzing and the evaluating, the potential proof from the selected proof system satisfying the user-specified parameter;

transmitting the statement and the witness to a prover computer network for execution of the selected proof system;

receiving the proof of the statement; and

making the proof available to a client computer.

18. The medium of claim 17 , wherein the candidate proof systems include a zero succinct non-interactive argument of knowledge (SNARK) proof system and a scalable transparent argument of knowledge (STARK) proof system.

19. A system for generating a zero-knowledge proof, the system comprising:

one or more processors; and

a memory storing instructions that, when executed by the one or more processors, cause the one or more processors to perform operations comprising:

receiving a request for a proof of a statement, the request comprising the statement, a witness, and a user-specified parameter;

analyzing, for each candidate proof system of a plurality of candidate proof systems, the statement and the witness to determine an amount of memory required for a potential proof,

evaluating, for each candidate proof system of the plurality of candidate proof systems, the statement and the witness to determine a computational requirement for the potential proof,

selecting a selected proof system from the candidate proof systems based on the analyzing and the evaluating, the potential proof from the selected proof system satisfying the user-specified parameter;

transmitting the statement and the witness to a prover computer network for execution of the selected proof system;

receiving the proof of the statement; and

making the proof available to a client computer.

20. The system of claim 19 , wherein the candidate proof systems include a zero succinct non-interactive argument of knowledge (SNARK) proof system and a scalable transparent argument of knowledge (STARK) proof system.

Assignments (3)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 21, 2025
From: TURBO PROTOCOL, INC.
To: GREENBLATT, AARON B.
Reel/Frame 070592/0782 →
CHANGE OF NAME Recorded Aug 13, 2024
From: IRONMILL, INC.
To: TURBO PROTOCOL, INC.
Reel/Frame 068585/0502 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 22, 2023
From: GREENBLATT, AARON B.; SCIRE-SCAPPUZZO, FRANCESCA; BHATTACHARYA, SOHAM; MAHENDRAKAR, SAHIL; GUPTA, SALONI
To: IRONMILL, INC.
Reel/Frame 062771/0871 →
Continuity (2)
Provisional Application 63313533 · Feb 24, 2022
Related Publication 20230269083A1 · Aug 24, 2023
References Cited (116)
US 7353396B2 · Micali · 2008 [cited by examiner]
US 11080412B1 · Moore · 2021 [cited by examiner]
US 11245528B1 · Greco · 2022 [cited by examiner]
US 20200076602A1 · Redpath · 2020 [cited by examiner]
US 20200076615A1 · Redpath · 2020 [cited by examiner]
US 20210144006A1 · Ma · 2021 [cited by examiner]
US 20220239489A1 · Maruyama · 2022 [cited by examiner]
US 20230269083A1 · Greenblatt · 2023 [cited by examiner]
US 20240129126A1 · Baeza-Yates · 2024 [cited by examiner]
“Avalanche Platform”, Avalanche Dev Docs, Available online at: https://docs.avax.network/overview/getting-started/avalanche-platform, Accessed from Internet on Mar. 24, 2023, 2 pages. [cited by applicant]
“Awesome—a Curated List of Amazing Homomorphic Encryption Libraries, Software and Resources”, Available online at: https://github.com/jonaschn/awesome-he, Accessed from Internet on Mar. 24, 2023, pp. 1-6. [cited by applicant]
“AWS Lambda Run Code Without Thinking About Servers or Clusters”, Serverless Computing—AWS Lambda —Amazon Web Services, Available online at: https://aws.amazon.com/lambda/, Accessed from Internet on Mar. 24, 2023, pp. 1… [cited by applicant]
“Bridging the Governance Gap: Interoperability for Blockchain and Legacy Systems”, Centre for the Fourth Industrial Revolution, Dec. 2020, 40 pages. [cited by applicant]
“Decentralized Social Networking Protocol (DSNP)”, Project Liberty, Available Online at: [email protected] www.projectliberty.io, Oct. 2020, 26 pages. [cited by applicant]
“ERC-20 Token Standard”, Available online at: https://ethereum.org/en/developers/docs/standards/tokens/erc-20/, Jan. 20, 2023, 6 pages. [cited by applicant]
“Ethereum Name Service”, Available online at: https://ens.domains/, Accessed from Internet on Mar. 25, 2023, 7 pages. [cited by applicant]
“Facebook Building Own Fiber Network to Link Data Centers”, Data Center Knowledge, News and Analysis for the Data Center Industry, May 24, 2017, pp. 1-5. [cited by applicant]
“From AIRs to RAPs—How PLONK-style Arithmetization Works”, Available online at: https://hackmd.io/@aztec-network/plonk-arithmetiization-air, May 2021, pp. 1-8. [cited by applicant]
“Groth16”, Available online at: https://www.zeroknowledgeblog.com/index.php/groth 16, 2016, 5 pages. [cited by applicant]
“Hardware Acceleration for Zero Knowledge Proofs”, Paradigm, Apr. 13, 2022, pp. 1-7. [cited by applicant]
“How Do Trusted Setups Work?”, Available online at: https://vitalik.ca/general/2022/03/14/trustedsetup.html, Mar. 14, 2022, pp. 1-7. [cited by applicant]
“ITP499—Blockchain”, Information Technology Program, Units: 3, 2017, pp. 1-7. [cited by applicant]
“Kubernetes”, Available online at: https://kubernetes.io, Accessed from Internet on Mar. 24, 2023, 6 pages. [cited by applicant]
“Plonky2: Fast Recursive Arguments with PLONK and FRI”, Polygon Zero Team, Sep. 7, 2022, 16 pages. [cited by applicant]
“Practical Secure Computation”, Available online at: https://securecomputation.org/projects.html, Accessed from Internet on Mar. 24, 2023, pp. 1-2. [cited by applicant]
“Productionizing and Scaling Python ML Workloads Simply”, Ray, Available Online at: https://www.ray.io/, Accessed from Internet on Mar. 25, 2023, 7 pages. [cited by applicant]
“Render Token (RNDR) Whitepaper”, Available online at: https://www.securities.io/render-whitepaper/, Aug. 28, 2017, 10 pages. [cited by applicant]
“The Sui Smart Contracts Platform”, The MystenLabs Team, Available Online at: [email protected], Mar. 22, 2022, 11 pages. [cited by applicant]
“TPM 2.0 Library”, Trusted Computing Group, Available online at: https://trustedcomputinggroup.org/resource/tpm-library-specification/, Accessed from Internet on Mar. 25, 2023, 11 pages. [cited by applicant]
“Zero Knowledge Proof—FPGA or GPU?”, Trapdoor-Tech, Available online at: https://trapdoortech.medium.com/zero-knowledge-proof-fpga-or-gpu-97b96ffbf0f, Sep. 7, 2022, pp. 1-13. [cited by applicant]
“ZK Whiteboard Sessions”, Available online at: https://zkhack.dev/whiteboard/, Accessed from Internet on Mar. 25, 2023, pp. 1-7. [cited by applicant]
Abadi et al., “Deep Learning with Differential Privacy”, CCS '16: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, Oct. 24, 2016, 14 pages. [cited by applicant]
Adler et al., “Astraea: a Decentralized Blockchain Oracle”, 2018 IEEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social C… [cited by applicant]
Al-Bassam , “LazyLedger: A Distributed Data Availability Ledger With Client-Side Smart Contracts”, Department of Computer Science, Jun. 8, 2019, 15 pages. [cited by applicant]
Alqahtani , “Snowflake to Avalanche: a Novel Metastable Consensus Protocol Family for Cryptocurrencies”, Available online at: [email protected], May 16, 2018, 21 pages. [cited by applicant]
Anderson et al., “SETI@home an Experiment in Public-Resource Computing”, Communications of the ACM, vol. 45, No. 11, Nov. 2002, pp. 56-61. [cited by applicant]
Androulaki et al., “Hyperledger Fabric: A Distributed Operating System for Permissioned Blockchains”, EuroSys '18: Proceedings of the Thirteenth EuroSys Conference, Apr. 23-26, 2018, 15 pages. [cited by applicant]
Asanović et al., “Instruction Sets Should Be Free: The Case For RISC-V”, Technical Report No. UCB/EECS-2014-146, Electrical Engineering and Computer Sciences, Aug. 6, 2014, 7 pages. [cited by applicant]
Babai et al., “Checking Computations in Polylogarithmic Time”, STOC '91: Proceedings of the twenty-third annual ACM symposium on Theory of Computing, Jan. 1991, pp. 21-31. [cited by applicant]
Backus , “Minimum Viable Decentralization”, The Wayback Machine, Available online at: https://web.archive.org/web/20191127141547/https://medium.com/@jbackus/minimum, Jul. 27, 2018, pp. 1-9. [cited by applicant]
Benarroch et al., “Community Proposal: A Benchmarking Framework for (Zero-Knowledge) Proof Systems”, Available online at: https://docs.zkproof.org/pages/standards/accepted-workshop3/proposal-benchmarking.pdf, Apr. 9, 20… [cited by applicant]
Benet , “IPFS—Content Addressed, Versioned, P2P File System”, Available online at: https://arxiv.org/pdf/1407.3561.pdf, Jul. 14, 2014, 11 pages. [cited by applicant]
Benhamouda et al., “Supporting Private Data on Hyperledger Fabric with Secure Multiparty Computation”, 2018 IEEE International Conference on Cloud Engineering (IC2E), Apr. 17-20, 2018, 8 pages. [cited by applicant]
Bitansky et al., “From Extractable Collision Resistance to Succinct Non-Interactive Arguments of Knowledge, and Back Again”, ITCS '12: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, Nov. … [cited by applicant]
Bogdanov et al., “Sharemind: a Framework for Fast Privacy-preserving Computations”, Conference: Computer Security—ESORICS 2008, 13th European Symposium on Research in Computer Security, Oct. 2008, 23 pages. [cited by applicant]
Bowe et al., “Recursive Proof Composition without a Trusted Setup”, Electric Coin Company, Sep. 11, 2019, 31 pages. [cited by applicant]
Brakerski , “Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP”, Proceedings of the 32nd Annual Cryptology Conference on Advances in Cryptology—CRYPTO 2012, Aug. 2012, 20 pages. [cited by applicant]
Breidenbach et al., “Chainlink 2.0: Next Steps In The Evolution Of Decentralized Oracle Networks”, v1.0, Apr. 15, 2021, 136 pages. [cited by applicant]
Buterin , “Exploring Elliptic Curve Pairings”, Available online at: https://medium.com/@VitalikButerin/exploring-elliptic-curve-pairings-c73c1864e627, Jan. 16, 2017, pp. 1-11. [cited by applicant]
Buterin , “Quadratic Arithmetic Programs: from Zero to Hero”, Available online at: https://medium.com/@VitalikButerin/quadratic-arithmetic-programs-from-zero-to-hero-f6d558cea649, Dec. 12, 2016, pp. 1-15. [cited by applicant]
Buterin , “ZK-SNARKs: Under the Hood”, Available online at: https://medium.com/@VitalikButerin/zk-snarks-under-the-hood-b33151a013f6, Feb. 3, 2017, pp. 1-8. [cited by applicant]
Cai et al., “A Truth-Inducing Sybil Resistant Decentralized Blockchain Oracle”, 2020 2nd Conference on Blockchain Research & Applications for Innovative Networks and Services (BRAINS), Sep. 28-30, 2020, 8 pages. [cited by applicant]
Canetti et al., “Adaptively Secure Multi-Party Computation”, STOC '96: Proceedings of the twenty-eighth annual ACM symposium on Theory of Computing, Jul. 1, 1996, pp. 639-648. [cited by applicant]
Chen et al., “A Review of zk-SNARKs”, Cryptography and Security, May 16, 2022, 34 pages. [cited by applicant]
Cheon et al., “Homomorphic Encryption for Arithmetic of Approximate Numbers”, International Conference on the Theory and Application of Cryptology and Information Security, Nov. 30, 2017, 23 pages. [cited by applicant]
Damgard et al., “Multiparty Computation from Somewhat Homomorphic Encryption”, International Association for Cryptologic Research, Aug. 19, 2012, 46 pages. [cited by applicant]
Demmler et al., “ABY—A Framework for Efficient Mixed-Protocol Secure Two-Party Computation”, Conference: Network and Distributed System Security Symposium, Feb. 7, 2015, 15 pages. [cited by applicant]
Ellis et al., “ChainLink—A Decentralized Oracle Network”, v1.0, Sep. 4, 2017, 38 pages. [cited by applicant]
Fan et al., “Somewhat Practical Fully Homomorphic Encryption”, Computer Science, Mathematics, Mar. 22, 2012, 19 pages. [cited by applicant]
Franz et al., “CBMC-GC: An ANSI C Compiler for Secure Two-Party Computations”, International Conference on Compiler Construction, Apr. 2014, 5 pages. [cited by applicant]
Gabizon et al., “PlonK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge”, Available online at: https://ia.cr/2019/953, Aug. 17, 2022, 34 pages. [cited by applicant]
Gong et al., “Analysis and Comparison of the Main Zero-knowledge Proof Scheme”, 2022 International Conference on Big Data, Information and Computer Network (BDICN), Jan. 20-22, 2022, pp. 366-372. [cited by applicant]
Groth , “On the Size of Pairing-based Non-interactive Arguments”, Annual International Conference on the Theory and Applications of Cryptographic Techniques, Apr. 28, 2016, 25 pages. [cited by applicant]
Hastings et al., “SoK: General Purpose Compilers for Secure Multi-Party Computation”, 2019 IEEE Symposium on Security and Privacy (SP), May 19-23, 2019, 18 pages. [cited by applicant]
Hopwood et al., “Zcash Protocol Specification”, Version 2022.3.8 [NU5], Sep. 15, 2022, 221 pages. [cited by applicant]
Jette et al., “SLURM: Simple Linux Utility for Resource Management”, Conference: SLURM: Simplex Linux Utility for Resource Management, Jun. 23, 2003, 27 pages. [cited by applicant]
Johnson et al., “The Elliptic Curve Digital Signature Algorithm (ECDSA)”, International Journal of Information Security, Aug. 23, 1999, 55 pages. [cited by applicant]
Kairouz et al., “Advances and Open Problems in Federated Learning”, Foundations and Trends in Machine Learning, vol. 4, No. 1, Mar. 9, 2021, 76 pages. [cited by applicant]
Kalodner et al., “Arbitrum: Scalable, Private Smart Contracts”, Open access to the Proceedings of the 27th USENIX Security Symposium is sponsored by USENIX, Aug. 15-17, 2018, pp. 1353-1370. [cited by applicant]
Kim et al., “Flipping Bits in Memory Without Accessing Them: An Experimental Study of DRAM Disturbance Errors”, 2014 ACM/IEEE 41st International Symposium on Computer Architecture (ISCA), Jun. 2014, pp. 1-12. [cited by applicant]
Konstantopoulos , “How Does Optimism's Rollup Really Work”, Paradigm Research, Jan. 29, 2021, pp. 1-20. [cited by applicant]
Kosba et al., “Hawk: The Blockchain Model of Cryptography and Privacy-Preserving Smart Contracts”, 2016 IEEE Symposium on Security and Privacy, Sep. 7, 2018, 31 pages. [cited by applicant]
Lee et al., “Practical Verifiable Computation by Using a Hardware-Based Correct Execution Environment”, IEEE Access, vol. 20, Nov. 30, 2020, p. 216689-216706. [cited by applicant]
Liang et al., “When HTTPS Meets CDN: A Case of Authentication in Delegated Service”, IEEE Symposium on Security and Privacy, Available online at: https://www.ieee-security.org/TC/SP2014/papers/WhenHTTPSMeetsCDN_c_ACaseo… [cited by applicant]
Liu et al., “ObliVM: A Programming Framework for Secure Computation”, 2015 IEEE Symposium on Security and Privacy, Jul. 17, 2015, pp. 359-376. [cited by applicant]
Lopez-Alt et al., “On-the-Fly Multiparty Computation on the Cloud via Multikey Fully Homomorphic Encryption”, STOC '12: Proceedings of the forty-fourth annual ACM symposium on Theory of computing, May 2012, 73 pages. [cited by applicant]
Lu et al., “HoneyBadgerMPC and AsynchroMix: Practical Asynchronous MPC and its Application to Anonymous Communication”, CCS '19: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, Nov… [cited by applicant]
Marin , “Nexus: A Next-Generation Decentralized Oracle Network and Extended Smart Contract Platform”, Available Online at: https://uploads-ssl.webflow.com/623ab3aba271ea70267a3162/625507683e8e423a2f256853_Nexus-Whitepap… [cited by applicant]
Matlala et al., “Setup Ceremonies”, In the Art of Zero Knowledge, Jun. 30, 2021, 17 pages. [cited by applicant]
Matney et al., “Ex-meta Employees Raise $200m From A16z, Tiger, Multicoin to Realize Facebook's Crypto Dreams”, Techcrunch, Mar. 15, 2022, 9 pages. [cited by applicant]
Maymounkov et al., “Kademlia: A Peer-to-Peer Information System Based on the XOR Metric”, International Workshop on Peer-to-Peer Systems, Oct. 10, 2002, pp. 53-65. [cited by applicant]
Mofrad et al., “A Comparison Study of Intel SGX and AMD Memory Encryption Technology”, Association for Computing Machinery, Available online at: https://doi.org/10.1145/3214292.3214301, Jun. 2, 2018, 8 pages. [cited by applicant]
Mood et al., “Frigate: A Validated, Extensible, and Efficient Compiler and Interpreter for Secure Computation”, 2016 IEEE European Symposium on Security and Privacy (EuroS&P), Mar. 21-24, 2016, 16 pages. [cited by applicant]
Movahedi et al., “Privacy-Preserving Randomized Controlled Trials: A Protocol for Industry Scale Deployment”, CCSW '21: Proceedings of the 2021 on Cloud Computing Security Workshop, Aug. 11, 2021, 13 pages. [cited by applicant]
Nakamoto , “Bitcoin: A Peer-to-Peer Electronic Cash System”, Available online at: https://www.microstrategy.com/en/bitcoin/documents/bitcoin-a-peer-to-peer-electronic-cash-system, Oct. 31, 2008, pp. 1-9. [cited by applicant]
Nakamura et al., “A Privacy-preserving Outsourcing Scheme for Zero-knowledge Proof Generation”, Journal of Information Processing, vol. 30, Feb. 2022, pp. 151-154. [cited by applicant]
Parno et al., “Pinocchio: Nearly Practical Verifiable Computation”, Communications of the ACM, vol. 59, No. 2, May 19-22, 2013, 16 pages. [cited by applicant]
Poelstra et al., “Confidential Assets”, International Conference on Financial Cryptography and Data Security, Feb. 10, 2019, 21 pages. [cited by applicant]
Raj et al., “fTPM: A Firmware-based TPM 2.0 Implementation”, Microsoft Research, Nov. 9, 2015, 23 pages. [cited by applicant]
Rastogi , “WYSTERIA: A Programming Language for Generic, Mixed-Mode Multiparty Computations”, 2014 IEEE Symposium on Security and Privacy, Nov. 2014, 42 pages. [cited by applicant]
Reitwiebner , “zkSNARKs in a Nutshell”, Aug. 24, 2018, 15 pages. [cited by applicant]
Rekhter et al., “A Border Gateway Protocol 4 (BGP-4)”, Network Working Group, Category: Standards Track, rfc4271, Jan. 2006, 104 pages. [cited by applicant]
Russinovich et al., “CCF: A Framework for Building Confidential Verifiable Replicated Services”, Microsoft Research & Microsoft Azure, Apr. 2019, 17 pages. [cited by applicant]
Sardar et al., “Towards Formalization of Enhanced Privacy ID (EPID)-Based Remote Attestation in Intel SGX”, 23rd Euromicro Conference on Digital System Design (DSD), Apr. 2020, 5 pages. [cited by applicant]
Sasson et al., “Scalable, Transparent, and Post-quantum Secure Computational Integrity”, Available online at: https://eprint.iacr.org/2018/046.pdf, Mar. 6, 2018, 83 pages. [cited by applicant]
Schoenmakers et al., “Trinocchio: Privacy-Preserving Outsourcing by Distributed Veri able Computation”, International Conference on Applied Cryptography and Network Security, Jun. 9, 2016, 33 pages. [cited by applicant]
Schuster et al., “VC3: Trustworthy Data Analytics in the Cloud Using SGX”, 2015 IEEE Symposium on Security and Privacy, May 17-21, 2015, pp. 38-54. [cited by applicant]
Shamis et al., “IA-CCF: Individual Accountability for Permissioned Ledgers”, USENIX Association, 19th USENIX Symposium on Networked Systems Design and Implementation, Apr. 4-6, 2022, pp. 466-491. [cited by applicant]
Songhori et al., “TinyGarble: Highly Compressed and Scalable Sequential Garbled Circuits”, 2015 IEEE Symposium on Security and Privacy, May 17-21, 2015, pp. 411-428. [cited by applicant]
Tal et al., “The Graph: A Decentralized Query Protocol for Blockchains”, International Conference on Inventive Research in Computing Applications, Mar. 21, 2018, 12 pages. [cited by applicant]
Tramer et al., “Slalom: Fast, Verifiable and Private Execution of Neural Networks in Trusted Hardware”, Published as a conference paper at ICLR 2019, Feb. 27, 2019, 19 pages. [cited by applicant]
Wagstaff et al., “Subspace: A Solution to the Farmer's Dilemma”, Available online at: https://assets.website-files.com/61526a2af87a54e565b0ae92/617759c00edd0e3bd279aa29_Subspace_%20A%20solution%20to%20the%20farmer%27s%2… [cited by applicant]
Wen et al., “Learning Structured Sparsity in Deep Neural Networks”, 30th Conference on Neural Information Processing Systems, Aug. 12, 2016, 9 pages. [cited by applicant]
Wiggers , “OpenAI's massive GPT-3 model is impressive, but size isn't everything”, VentureBeat, Available online at: https://venturebeat.com/ai/ai-machine-learning-openai-gpt-3-size-isnt-everything/, Jun. 1, 2020, 6 pag… [cited by applicant]
Winter et al., “Madaline Rule 11: A Training Algorithm for Neural Networks”, International Conference on Neural Networks, Jul. 24-27, 1988, pp. 1-401-1-408. [cited by applicant]
Wood , “Ethereum: A Secure Decentralised Generalised Transaction Ledger”, EIP-150 Revision, Sep. 30, 2017, pp. 1-34. [cited by applicant]
Yakovenko , “Solana: a New Architecture for a High Performance Blockchain V0.8.13”, Available online at: [email protected], Nov. 20, 2020, 32 pages. [cited by applicant]
Yeluri et al., “Trusted Docker Containers and Trusted VMs in OpenStack”, Intel, Jun. 30, 2022, 16 pages. [cited by applicant]
Yin et al., “HotStuff: BFT Consensus with Linearity and Responsiveness”, PODC '19: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, Jul. 29-Aug. 2, 2019, pp. 347-356. [cited by applicant]
Zaharia et al., “Spark: Cluster Computing with Working Sets”, HotCloud'10: Proceedings of the 2nd USENIX conference on Hot topics in cloud computing, Jun. 22, 2010, 7 pages. [cited by applicant]
Zahur et al., “Obliv-C: A Language for Extensible Data-Oblivious Computation”, Available online at: https://ia.cr/2015/1153, Nov. 30, 2015, 20 pages. [cited by applicant]
Zhang et al., “DECO: Liberating Web Data Using Decentralized Oracles for TLS”, CCS '20, Virtual Event, USA, Session 6D: Web Security, Nov. 9-13, 2020, pp. 1919-1938. [cited by applicant]
Zhang et al., “PICCO: A General-Purpose Compiler for Private Distributed Computation”, CCS '13: Proceedings of the 2013 ACM SIGSAC Conference on Computer & Communications Security, Nov. 4, 2013, pp. 813-825. [cited by applicant]
Zhang et al., “PipeZK: Accelerating Zero-Knowledge Proof with a Pipelined Architecture”, 2021 ACM/IEEE 48th Annual International Symposium on Computer Architecture (ISCA), Jun. 14-18, 2021, 12 pages. [cited by applicant]
Zyskind et al., “Decentralizing Privacy: Using Blockchain to Protect Personal Data”, 2015 IEEE Security and Privacy Workshops, May 21-22, 2015, pp. 180-184. [cited by applicant]
Zyskind et al., “Enigma: Decentralized Computation Platform with Guaranteed Privacy”, Cryptography and Security (cs.CR), Jun. 10, 2015, 14 pages. [cited by applicant]