A study of universal zero-knowledge proof circuit-based virtual machines that validate general operations & reduce transaction validation

نویسندگان

چکیده

Recently, blockchain technology accumulates and stores all transactions. Therefore, in order to verify the contents of transactions, data itself is compressed, but scalability limited. In addition, since a separate verification algorithm used for each type transaction, burden increases as size transaction increases. Existing cannot participate network because it does not become block sink by using server with low specification. Due this problem, time passes, becomes larger impossible except users abundant resources. paper, we studied zero knowledge proof general operation verification. system, design zero-knowledge circuit generator capable optimization verifier prover were also conducted. Also, developed an optimizing key generation. Based on these, was applied tested virtual machine so that can be universally blockchains.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

construction and validation of a computerized adaptive translation test (a receptive based study)

آزمون انطباقی رایانه ای (cat) روشی نوین برای سنجش سطح علمی دانش آموزان می باشد. در حقیقت آزمون های رایانه ای با سرعت بالایی به سمت و سوی جایگزین عملی برای آزمون های کاغذی می روند (کینگزبری، هاوسر، 1993). مقاله حاضر به دنبال آزمون انطباقی رایانه ای برای ترجمه می باشد. بدین منظور دو پرسشنامه مشتمل بر 55 تست ترجمه میان 102 آزمودنی و 10 مدرس زبان انگلیسی پخش گردید. پرسشنامه اول میان 102 دانشجوی س...

Software Watermarking as a Proof of Identity: A Study of Zero Knowledge Proof Based Software Watermarking

Software watermarking has been proposed as a way to prove ownership of software intellectual property in order to contain software piracy. In this paper, we propose a novel watermarking technique based on Zero Knowledge Proofs. The advantages are multi-fold. The watermark recognizer can now be distributed publicly. This helps in watermark being used as a proof for both authorship and authentica...

متن کامل

Study on Quantum Zero Knowledge Proof System

Zero-knowledge proof is a very interesting problem in modern cryptography, which attracts the attention of many cryptographers, and there are plenty of researches. It is one of the hot research field in cryptography. First, we made a simple introduction of zero-knowledge proof. Then we had given a perfect quantum zero knowledge proof system on a specific NP – complete problem "graph 3-coloring"...

متن کامل

Zero Knowledge and Circuit Minimization

We show that every problem in the complexity class SZK (Statistical Zero Knowledge) is efficiently reducible to the Minimum Circuit Size Problem (MCSP). In particular Graph Isomorphism lies in RP. This is the first theorem relating the computational power of Graph Isomorphism and MCSP, despite the long history these problems share, as candidate NP-intermediate problems.

متن کامل

Problem 1 : Zero Knowledge Proof

a. To check that the graph is represented correctly, Bob asks Alice to remove all the paper cups covering the endpoints of every edge. This reveals an isomorphism to the original graph, which Bob cannot check efficiently; thus, Bob also removes the paper cups corresponding to the green numbers, revealing the original labelling of the vertices. This reveals nothing about the vertex cover, but al...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computer Science and Information Systems

سال: 2021

ISSN: ['1820-0214', '2406-1018']

DOI: https://doi.org/10.2298/csis200322006j