dWallet Labs

Happy to share that 2PC-MPC V2 was accepted to ACNS 2026 Congratulations to the authors: Offir Friedman, Avichai Marmor, Dolev Mutzari, Yehonatan Cohen Scaly and Yuval Spiizer

Happy to share that REFHE was accepted to Eurocrypt '26 Congratulations to the authors: Zvika Brakerski, Offir Friedman, Daniel Golan, Alon Gurny, Dolev Mutzari and Ohad Sheinfeld

12/12 REFHE is the result of work by @dWalletLabs cryptography team and reflects our broader mission: pushing the boundaries of cryptography to create a secure, programmable, private and decentralized world without compromising on the Zero-Trust principles of Web3. Paper link: eprint.iacr.org/2025/1449 🧵/end

11/12 We believe this is a foundational shift. REFHE reframes FHE as a platform for encrypted computation that mirrors the machine model - allowing us to reason about programs, not just circuits. It's the first step toward a real homomorphic ALU.

7/12 For example, to compute a > b homomorphically: 1. Subtract b from a 2. Bootstrap the result 3. Extract the most significant bit → gives you the result of the comparison This kind of operation would be painful in arithmetic schemes and bloated in boolean ones.

6/12 🔧 Bootstrapping in REFHE Our bootstrapping mechanism: - Recursively extracts encrypted bits µᵢ of the message during bootstrap - Enables boolean ops during bootstrapping - e.g. comparisons, bit shifts, masking

2/12 At its core, REFHE asks: Can we build an FHE scheme that behaves like a CPU ALU? That means: - Integer arithmetic (mod 2⁶⁴) - Logic ops like AND, OR, comparisons - Operations on encrypted values - Efficient bootstrapping All natively supported. Not simulated.

5/12 This has profound consequences: - The bits of the integer are just the coefficients of the polynomial - Noise scales like n^O(d) for depth-d circuits (vs 2^O(d) in prior Z₂ⁿ approaches) - Bootstrapping becomes a natural place to extract bit-level structure

4/12 REFHE starts from the BGV blueprint but makes two key architectural shifts: 1. We work over a non-cyclotomic ring: ℤ[x]/(xⁿ - x + 2) 2. We define the plaintext space as an ideal: ⟨x - 2⟩, giving us plaintexts ≅ Z₂ⁿ This lets us represent 64-bit values directly - with binary coefficients.

3/12 Why is this a big deal? Most existing schemes fall into one of two camps: - Arithmetic-focused (BGV, BFV, CKKS) - fast at math, awkward for logic - Boolean-focused (TFHE) - logic is native, but everything is bit-bloated Real programs use both. REFHE bridges this divide.

🧵1/12 We're excited to share REFHE: Fully Homomorphic ALU, our new paper introducing an FHE scheme that natively supports both arithmetic and logical operations on 64-bit machine words. This is a step toward treating FHE not as a circuit model - but as a real compute model.

Today we released our Threshold FHE paper - the first that can be used by nodes of a decentralized network for threshold decryption of FHE ciphertexts. We had the pleasure of working with Prof. Zvika Brakerski on this one. A single key insight enabled it all 🧵

Today we are publishing our Threshold FHE scheme, redefining cryptographic computation and bringing Web3 a step closer to true confidential compute without relying on hardware and trusted third parties. Our team consistently delivers the best threshold cryptography research, and this is no exception. Couldn’t be more proud of everyone as we’re celebrating another important milestone.

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.

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) eprint.iacr.org/2025/712 Here’s a high level overview, and why it’s a big deal. A thread 🧵