Post-Quantum VRF and its Applications in Future-Proof Blockchain System
- URL: http://arxiv.org/abs/2109.02012v1
- Date: Sun, 5 Sep 2021 07:10:41 GMT
- Title: Post-Quantum VRF and its Applications in Future-Proof Blockchain System
- Authors: Zengpeng Li, Teik Guan Tan, Pawel Szalachowski, Vishal Sharma,
Jianying Zhou
- Abstract summary: A verifiable random function (VRF) is a powerful pseudo-random function that provides a non-interactively public verifiable proof for the correctness of its output.
We propose a generic compiler to obtain the post-quantum VRF from the simple VRF solution using symmetric-key primitives.
We show potential applications of a quantum-secure VRF, such as quantum-secure decentralized random beacon and lottery-based proof of stake consensus blockchain protocol.
- Score: 13.386254282693335
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: A verifiable random function (VRF in short) is a powerful pseudo-random
function that provides a non-interactively public verifiable proof for the
correctness of its output. Recently, VRFs have found essential applications in
blockchain design, such as random beacons and proof-of-stake consensus
protocols. To our knowledge, the first generation of blockchain systems used
inherently inefficient proof-of-work consensuses, and the research community
tried to achieve the same properties by proposing proof-of-stake schemes where
resource-intensive proof-of-work is emulated by cryptographic constructions.
Unfortunately, those most discussed proof-of-stake consensuses (e.g., Algorand
and Ouroborous family) are not future-proof because the building blocks are
secure only under the classical hard assumptions; in particular, their designs
ignore the advent of quantum computing and its implications. In this paper, we
propose a generic compiler to obtain the post-quantum VRF from the simple VRF
solution using symmetric-key primitives (e.g., non-interactive zero-knowledge
system) with an intrinsic property of quantum-secure. Our novel solution is
realized via two efficient zero-knowledge systems ZKBoo and ZKB++,
respectively, to validate the compiler correctness. Our proof-of-concept
implementation indicates that even today, the overheads introduced by our
solution are acceptable in real-world deployments. We also demonstrate
potential applications of a quantum-secure VRF, such as quantum-secure
decentralized random beacon and lottery-based proof of stake consensus
blockchain protocol.
Related papers
- The Latency Price of Threshold Cryptosystem in Blockchains [52.359230560289745]
We study the interplay between threshold cryptography and a class of blockchains that use Byzantine-fault tolerant (BFT) consensus protocols.
Existing approaches for threshold cryptosystems introduce a latency overhead of at least one message delay for running the threshold cryptographic protocol.
We propose a mechanism to eliminate this overhead for blockchain-native threshold cryptosystems with tight thresholds.
arXiv Detail & Related papers (2024-07-16T20:53:04Z) - Scalable Zero-Knowledge Proofs for Verifying Cryptographic Hashing in Blockchain Applications [16.72979347045808]
Zero-knowledge proofs (ZKPs) have emerged as a promising solution to address the scalability challenges in modern blockchain systems.
This study proposes a methodology for generating and verifying ZKPs to ensure the computational integrity of cryptographic hashing.
arXiv Detail & Related papers (2024-07-03T21:19:01Z) - Coding-Based Hybrid Post-Quantum Cryptosystem for Non-Uniform Information [53.85237314348328]
We introduce for non-uniform messages a novel hybrid universal network coding cryptosystem (NU-HUNCC)
We show that NU-HUNCC is information-theoretic individually secured against an eavesdropper with access to any subset of the links.
arXiv Detail & Related papers (2024-02-13T12:12:39Z) - Quantum-Secure Hybrid Blockchain System for DID-based Verifiable Random Function with NTRU Linkable Ring Signature [1.4792750204228]
We present a smart contract-based Verifiable Random Function (VRF) model, addressing the shortcomings of existing systems.
To enhance our VRF's robustness, we employ post-quantum Ring-LWE encryption for generating pseudo-random sequences.
We show the security and privacy advantages of our proposed VRF model with the approximated estimation of overall temporal and spatial complexities.
arXiv Detail & Related papers (2024-01-30T11:17:25Z) - Generative AI-enabled Blockchain Networks: Fundamentals, Applications,
and Case Study [73.87110604150315]
Generative Artificial Intelligence (GAI) has emerged as a promising solution to address challenges of blockchain technology.
In this paper, we first introduce GAI techniques, outline their applications, and discuss existing solutions for integrating GAI into blockchains.
arXiv Detail & Related papers (2024-01-28T10:46:17Z) - Private and Secure Post-Quantum Verifiable Random Function with NIZK Proof and Ring-LWE Encryption in Blockchain [1.4792750204228]
We present a blockchain-based Verifiable Random Function (VRF) scheme addressing some limitations of classical VRF constructions.
To enhance our VRF's secure randomness, we adopt post-quantum Ring-LWE encryption for pseudo-random sequences.
Our results exhibit a 98.86% pass rate over 11 test cases, with an average p-value of 0.5459 from 176 total tests.
arXiv Detail & Related papers (2023-11-20T12:56:50Z) - Entropy Accumulation under Post-Quantum Cryptographic Assumptions [4.416484585765028]
In device-independent (DI) quantum protocols, the security statements are oblivious to the characterization of the quantum apparatus.
We present a flexible framework for proving the security of such protocols by utilizing a combination of tools from quantum information theory.
arXiv Detail & Related papers (2023-07-02T12:52:54Z) - Quantum Proofs of Deletion for Learning with Errors [91.3755431537592]
We construct the first fully homomorphic encryption scheme with certified deletion.
Our main technical ingredient is an interactive protocol by which a quantum prover can convince a classical verifier that a sample from the Learning with Errors distribution in the form of a quantum state was deleted.
arXiv Detail & Related papers (2022-03-03T10:07:32Z) - Device-Independent-Quantum-Randomness-Enhanced Zero-Knowledge Proof [25.758352536166502]
Zero-knowledge proof (ZKP) is a fundamental cryptographic primitive that allows a prover to convince a verifier of the validity of a statement.
As an efficient variant of ZKP, non-interactive zero-knowledge proof (NIZKP) adopting the Fiat-Shamir is essential to a wide spectrum of applications.
arXiv Detail & Related papers (2021-11-12T13:36:43Z) - Quantum Multi-Solution Bernoulli Search with Applications to Bitcoin's
Post-Quantum Security [67.06003361150228]
A proof of work (PoW) is an important cryptographic construct enabling a party to convince others that they invested some effort in solving a computational task.
In this work, we examine the hardness of finding such chain of PoWs against quantum strategies.
We prove that the chain of PoWs problem reduces to a problem we call multi-solution Bernoulli search, for which we establish its quantum query complexity.
arXiv Detail & Related papers (2020-12-30T18:03:56Z) - Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel.
We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries.
We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
arXiv Detail & Related papers (2020-10-15T17:55:31Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.