Theory of Cryptography

A probabilistically checkable proof (PCP) system enables proofs to be verified in time polylogarithmic in the length of a classi-cal proof. Computationally sound (CS) proofs improve upon PCPs by additionally shortening the length of the transmitted proof to be poly-logarithmic in the length of the...

全面介紹

Saved in:
書目詳細資料
其他作者: Canetti, Ran
格式: 圖書
語言:English
出版: Springer 2017
主題:
005
在線閱讀:http://repository.vnu.edu.vn/handle/VNU_123/27032
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: Vietnam National University, Hanoi
語言: English
id oai:112.137.131.14:VNU_123-27032
record_format dspace
spelling oai:112.137.131.14:VNU_123-270322020-07-14T04:03:17Z Theory of Cryptography Canetti, Ran Computer Science 005 A probabilistically checkable proof (PCP) system enables proofs to be verified in time polylogarithmic in the length of a classi-cal proof. Computationally sound (CS) proofs improve upon PCPs by additionally shortening the length of the transmitted proof to be poly-logarithmic in the length of the classical proof. In this paper we explore the ultimate limits of non-interactive proof systems with respect to time and space efficiency. We present a proof system where the prover uses space polynomial in the space of a classical prover and time essentially linear in the time of a classical prover, while the verifier uses time and space that are essentially constant. Further, this proof system iscomposable: there is an algorithm for merging two proofs of lengthkinto a proof of the conjunction of the original two theorems in time polynomial ink, yielding a proof of length exactlyk. We deduce the existence of our proposed proof system by way of a natural new assumption about proofs of knowledge. In fact, a main contribution of our result is showing that knowledge can be “traded” for time and space efficiency in noninteractive proof systems. We motivate this result with an explicit construction of noninteractive CS proofs of knowledge in the random oracle model. 2017-04-12T09:02:41Z 2017-04-12T09:02:41Z 2008 Book 9783540785231 http://repository.vnu.edu.vn/handle/VNU_123/27032 en 656 p. application/pdf Springer
institution Vietnam National University, Hanoi
building VNU Library & Information Center
country Vietnam
collection VNU Digital Repository
language English
topic Computer Science
005
spellingShingle Computer Science
005
Theory of Cryptography
description A probabilistically checkable proof (PCP) system enables proofs to be verified in time polylogarithmic in the length of a classi-cal proof. Computationally sound (CS) proofs improve upon PCPs by additionally shortening the length of the transmitted proof to be poly-logarithmic in the length of the classical proof. In this paper we explore the ultimate limits of non-interactive proof systems with respect to time and space efficiency. We present a proof system where the prover uses space polynomial in the space of a classical prover and time essentially linear in the time of a classical prover, while the verifier uses time and space that are essentially constant. Further, this proof system iscomposable: there is an algorithm for merging two proofs of lengthkinto a proof of the conjunction of the original two theorems in time polynomial ink, yielding a proof of length exactlyk. We deduce the existence of our proposed proof system by way of a natural new assumption about proofs of knowledge. In fact, a main contribution of our result is showing that knowledge can be “traded” for time and space efficiency in noninteractive proof systems. We motivate this result with an explicit construction of noninteractive CS proofs of knowledge in the random oracle model.
author2 Canetti, Ran
author_facet Canetti, Ran
format Book
title Theory of Cryptography
title_short Theory of Cryptography
title_full Theory of Cryptography
title_fullStr Theory of Cryptography
title_full_unstemmed Theory of Cryptography
title_sort theory of cryptography
publisher Springer
publishDate 2017
url http://repository.vnu.edu.vn/handle/VNU_123/27032
_version_ 1680964113676632064