Delphi: Sharing Assessments of Cryptographic Assumptions
Share on

We’re extremely pleased to be able to introduce ‘Delphi: sharing assessments of cryptographic assumptions’, an advanced research initiative developed by Jeroen van de Graaf and Arjen K. Lenstra.

Almost all practical cryptographic protocols are based on computational or ad-hoc assumptions. Assessing the strengths of these assumptions is therefore a key factor in evaluating the risks of the systems using them. Discussions around these assumptions are often limited to taking place during coffee breaks of major crypto-conferences, or confined to isolated groups. Our goal is to make these discussions explicit and public, gathering the knowledge of hundreds of experts.

To this end we developed **Delphi**, an online questionnaire to document researchers' opinions and beliefs about the strengths of the most important assumptions. All responses received will be made accessible on our website, and we also intend to consolidate these responses and publish the results.

The current paper addresses classical cryptographic assumptions, whereas Delphi 2, a separate questionnaire dedicated to Ethereum, zkSNARKs, zk-friendly hash functions, and similar primitives, is currently under development. Since many of these primitives are relatively new and haven't been subject to the test of time, this joint effort to compare primitives should be of great help to our community.

The paper is published on the Cryptology ePrint Archive: https://eprint.iacr.org/2024/157

Jeroen van de Graaf is Senior Cryptographer at ZKM and Associate Professor at Universidade Federal de Minas Gerais.

Delphi: A brand new cryptographic research initiative by Jeroen van de Graaf & Arjen K. Lenstra.


More articles
The ‘WHY’ of ZKM
Historically, the greatest technological and corporate endeavors have been driven by a purpose that extends beyond the immediate objective of profit maximization. The companies run by Elon Musk are a great example. Consider SpaceX's ultimate mission to make humanity a multi-planetary species, or the objectives of Tesla,
Traditional STARK vs Circle STARK
STARK (Scalable Transparent Argument of Knowledge) is a kind of proof system introduced in 2018 by Eli Ben-Sasson and his colleagues, offering better scalability and transparency than traditional SNARK systems. STARK operates by transforming complex computations into arithmetic circuits, which are then represented as polynomial evaluation problems. To conceal intermediate results during computation, polynomial commitments are employed while allowing the verifier to sample and check these results. By applying low-degree extensions, intricate computations are reduced to verifying low-degree polynomials, before the efficient interactive proof protocol, FRI, is used to check if a polynomial has a low degree. This technology has broad applications in enabling privacy preservation and verifiable computations.
Delphi: Sharing Assessments of Cryptographic Assumptions

We’re extremely pleased to be able to introduce ‘Delphi: sharing assessments of cryptographic assumptions’, an advanced research initiative developed by Jeroen van de Graaf and Arjen K. Lenstra.

Almost all practical cryptographic protocols are based on computational or ad-hoc assumptions. Assessing the strengths of these assumptions is therefore a key factor in evaluating the risks of the systems using them. Discussions around these assumptions are often limited to taking place during coffee breaks of major crypto-conferences, or confined to isolated groups. Our goal is to make these discussions explicit and public, gathering the knowledge of hundreds of experts.

To this end we developed **Delphi**, an online questionnaire to document researchers' opinions and beliefs about the strengths of the most important assumptions. All responses received will be made accessible on our website, and we also intend to consolidate these responses and publish the results.

The current paper addresses classical cryptographic assumptions, whereas Delphi 2, a separate questionnaire dedicated to Ethereum, zkSNARKs, zk-friendly hash functions, and similar primitives, is currently under development. Since many of these primitives are relatively new and haven't been subject to the test of time, this joint effort to compare primitives should be of great help to our community.

The paper is published on the Cryptology ePrint Archive: https://eprint.iacr.org/2024/157

Jeroen van de Graaf is Senior Cryptographer at ZKM and Associate Professor at Universidade Federal de Minas Gerais.

Delphi: A brand new cryptographic research initiative by Jeroen van de Graaf & Arjen K. Lenstra.