RT @ycscaly: Today we released our Threshold FHE paper - the first that can be used by nodes of a decentralized network for threshold decry….

RT @omersadika: Today we are publishing our Threshold FHE scheme, redefining cryptographic computation and bringing Web3 a step closer to t….

11/ Our scheme is scalable: supporting thousands of participants, DKG and reconfiguration in minutes (should happen once every > 24 hours) and sub-second decryption!.

10/ Our scheme is reconfigurable: allowing participants (think: node operators) to join and leave, and still participate in decryption. This is crucial to enable permissionless setups of threshold networks where parties join and leave at will.

9/ It is publicly verifiable, and with f<n/3, admits Guaranteed Output Delivery (GOD) - meaning that as long as less than a 1/3 of the parties are malicious, the decryption is guranteed to succeed, a really difficult and useful trait to achieve!.

8/ Our scheme is blockchain compatible: It is realized over an asynchronous network and only utilizes reliable broadcast.

7/ Our scheme is generic: it can work under any t-out-of-n setting and for any FHE scheme. Importantly, we solve a key-issue here with t=2/3 which is commonly used for consensus, and no scheme known to us has been able to achieve a practical, scalable solution for.

6/ This makes it the first threshold FHE scheme that can be used for decentralized networks, and the first to allow building permissionless threshold decryption networks and many other solutions.

5/ Our scheme is ultra-fast and scalable, achieving sub-second threshold decryption for hundreds to thousands of participants, and can seamlessly integrate with a PoS consensus algorithm.

4/ Existing Threshold FHE implementations are not suitable for permissionless decentralized network, can’t support a large number of participants, and don’t support use cases that require high scale and high performance.

3/ In traditional Web2 FHE use cases, the user holds the decryption key and is the only one who can decrypt the data. However, many Web3 use cases require the decryption key to not be held by a single user, but rather be decentralized across many parties so no one can.

2/ In Web3, FHE is being heavily researched to perform actions on a public blockchain without revealing private user data. However, a major piece of FHE viability in Web3 is missing - Threshold FHE.

1/ What is FHE? Fully Homomorphic Encryption is a cryptographic method that allows computations to be performed on encrypted data without decrypting it. It is considered to be the holy grail in data privacy and security, and has many exciting use cases in AI, finance,.

Excited to release our Threshold FHE paper!. In this work we achieve, for the first time, a real-world applicable threshold scheme for any FHE scheme (including CKKS, BGV, BFV, TFHE). Here’s a high level overview, and why it’s a big deal. A thread 🧵.

RT @omersadika: Implementing a TSS scheme in a distributed setting is a massive undertaking, and even teams who invested millions of dollar….

RT @Aeon_HQ: Fully decentralized wallets are no longer theoretical—they now surpass existing solutions. The latest 2PC-MPC v2 research from….

RT @NanakNihal: This is an incredible improvement. The asynchronicity, weighted shares, and permissionless joining and exiting are make it….

RT @omersadika: It is very technical, but I recommend anyone who cares about the future of interoperability to read this thread, read our n….

10/ This version of 2PC-MPC is designed to be more practical for real-world blockchain environments, and specifically is the backbone of @ikadotxyz and dWallets. It reduces overhead, improves security, and enhances decentralization without compromising efficiency. For technical.

9/ Robust Functionality for Existing and New Use Cases. We support Hierarchical Deterministic wallets (BIP32), and allow for soft key derivation, so all major existing custody use case designs are supported. Our new protocol also enables, for the first time, a clear framework to.