Event Horizon Labs Research Work.


Our purpose is the protection of digital signing keys, across all important cryptographic protocols. We have therefore been investigating the best possible ways to split these keys to reduce their exposure to a single point of failure, whilst keeping optimal response time and usability.

We adopt an engineer’s point of view, producing code implementations and Proof Of Concepts early on in the process. Yet we consider theoretical research absolutely vital to provide a solid foundation to our technologies.

We therefore keep up to date with the latest developments of cryptographic research and base our own work on robust theoretical premises.

As a result of this innovation method, we produce theoretical papers, to expose our ideas and exchange with other cryptographers on ways to improve them.

You will find below the documents we have produced, available for you to download.

Multiparty protocol for the Elliptic Curve Digital Signing Algorithm: an engineering approach

In this paper we focus on a promising field of research for digital signing protection: the splitting of ECDSA signing keys through multiparty computation (MPC). All existing MPC implementations of EC digital signing base their constructs on threshold signing. We decided to reconsider the entire digital signing process, making threshold a parameter of the equation, rather than a pre-requisite. We propose solutions from an engineering perspective and take a pragmatic approach to devising algorithms adapted to different security requirements.

Through this document, we advance several research propositions so that we may forge a strong working relationship with the academic world and will submit all our models for full academic peer review.

Ultimately, we hope that some of the ideas and discussion points we bring forward will contribute to both theoretical and engineering knowledge improvement.

Academic Research - State of the Art

Several key contributions to multiparty computation applied to digital signing, from Shamir’s foundational work on secret sharing between non trusted parties, to distributed ECDSA, RSA shared key creation or Post-Quantum encryption

How to Share a Secret ( Shamir A., 1979)

Adi Shamir quote: “In this paper we show how to divide data D into n pieces in such a way that D is easily reconstructable from any k pieces, but even complete knowledge of k - 1 pieces reveals absolutely no information about D. This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces. Key Words and Phrases: cryptography, key management, interpolation”

Download Paper (PDF 200kb)
The Knowledge Complexity of Interactive Proof Systems”, (Golwasser S., Micali S. and Rackoffs C., 1989)

This foundational article defines the concept of zero-knowledge proof (ZKP): a cryptographic approach that allows one validating party, called ”the prover” to verify a claim made by another party without the prover disclosing any supporting information. This will allow to control that partial secrets exchanged between the parties do respect the protocol specifications.

Download Paper (PDF 4.6mb)
Distributed Key Generation and Applications to Cryptocurrency Custody (Lindell Y., Nof A., Ranellucci S., 2019)

Yehuda Lindell quote: “In this paper, we present the first truly practical full threshold ECDSA signing protocol that has both fast signing and fast key distribution. This solves a years-old open problem, and opens the door to practical uses of threshold ECDSA signing that are in demand today. There is growing practical interest in such solutions, but prior to our work these could not be deployed today due to the need for distributed key generation.”

Download Paper (PDF 650kb)
Fast Multiparty Threshold ECDSA with Fast Trustless Setup (Gennaro R., Goldfeder S, 2019)

Alongside the Lindell, Noff and Rannelucci article, the Gennaro/Goldfeder algorithm is the most advanced research work to solve multiparty ECDSA. Our Research work uses several key elements demonstrated in both papers. A threshold signature scheme enables distributed signing among n players such. Rosario Gennaro quote: “While there exist previous threshold schemes for the ECDSA signature scheme, we present the first protocol that supports multiparty signatures for any t ≤ n with efficient, dealerless key generation. Our protocol is faster than previous solutions and significantly reduces the communication complexity as well.”

Download Paper (PDF 500kb)

Download our Tech Paper

Download our Tech Paper to learn more about our product and how it works.