An Introduction to Zero-Knowledge

نویسنده

  • Thomas Ashton
چکیده

Zero-knowledge proofs are a well developed field of cryptography. To date however, overviews have assumed familiarity with cryptographic and number theoretic results that may not be familiar to the general reader, and practical issues involved in implementing such schemes have often been given little explanation. This article presents a general and practical zero-knowledge protocol with an explanation of relevant theoretical results. It is hoped that this will provide the reader with the background necessary to freely explore the field.

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

ثبت نام

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

منابع مشابه

Commitment Schemes and Zero-Knowledge Protocols

This article is an introduction to two fundamental primitives in cryptographic protocol theory: commitment schemes and zero-knowledge protocols, and a survey of some new and old results on their existence and the connection between them. 1 What’s in this article? This article contains an introduction to two fundamental primitives in cryptographic protocol theory: commitment schemes and zero-kno...

متن کامل

Commitment Schemes and Zero - Knowledge Protocols ( 2007 ) Ivan Damg̊ard and Jesper Buus

This article is an introduction to two fundamental primitives in cryptographic protocol theory: commitment schemes and zero-knowledge protocols, and a survey of some new and old results on their existence and the connection between them. 1 What’s in this article? This article contains an introduction to two fundamental primitives in cryptographic protocol theory: commitment schemes and zero-kno...

متن کامل

Commitment Schemes and Zero - Knowledge Protocols ( 2008 ) Ivan Damg̊ard

This article is an introduction to two fundamental primitives in cryptographic protocol theory: commitment schemes and zero-knowledge protocols, and a survey of some new and old results on their existence and the connection between them. 1 What’s in this article? This article contains an introduction to two fundamental primitives in cryptographic protocol theory: commitment schemes and zero-kno...

متن کامل

The Complexity of Zero Knowledge

We give an informal introduction to zero-knowledge proofs, and survey their role both in the interface between complexity theory and cryptography and as objects of complexity-theoretic study in their own right.

متن کامل

Σ - Protocols Continued & Introduction to Zero Knowledge

A Σ-protocol for proving equality of the discrete logarithm of two pairs of numbers is presented and used in an electronic voting scheme originally proposed in [CGS97]. Further, the notion of zero knowledge is introduced and a modified (1-bit challenge) version of Schnorr’s identification scheme is shown to be zero knowledge. 1 Proving Discrete Logarithm Equality

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005