Zero-knowledge arguments and public-key cryptography

IF 0.7 4区物理与天体物理 Q3 COMPUTER SCIENCE, THEORY & METHODS

Quantum Information & Computation Pub Date : 1995-08-15 DOI:10.1006/INCO.1995.1121

A. Desantis, Giovanni DiCrescenzo

引用次数: 11

Abstract

Abstract In this work we consider the Diffie-Hellman public-key model in which an additional short random string is shared by all users. This. which we call Public-Key Public-Randomness (PKPR) model, is very powerful, as we show that it supports simple non-interactive implementations of important cryptographic primitives. We give a noninteractive implementation of Oblivious Transfer in the PKPR model. Our implementation is secure against receivers with unlimited computational power. Building on this result, we show that all languages in NP have Perfect Zero-Knowledge Arguments in the PKPR model.

查看原文本刊更多论文

零知识参数和公钥加密

在本文中，我们考虑了一个额外的短随机字符串被所有用户共享的Diffie-Hellman公钥模型。这一点。我们称之为公钥公共随机性(Public-Key Public-Randomness, PKPR)模型，它非常强大，因为我们证明了它支持重要加密原语的简单非交互式实现。我们给出了PKPR模型中遗忘转移的非交互实现。我们的实现对于具有无限计算能力的接收器是安全的。在此结果的基础上，我们证明了NP中的所有语言在PKPR模型中都具有完美的零知识参数。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Quantum Information & Computation 物理-计算机：理论方法

CiteScore

1.70

自引率

0.00%

发文量

审稿时长

3.3 months

期刊介绍： Quantum Information & Computation provides a forum for distribution of information in all areas of quantum information processing. Original articles, survey articles, reviews, tutorials, perspectives, and correspondences are all welcome. Computer science, physics and mathematics are covered. Both theory and experiments are included. Illustrative subjects include quantum algorithms, quantum information theory, quantum complexity theory, quantum cryptology, quantum communication and measurements, proposals and experiments on the implementation of quantum computation, communications, and entanglement in all areas of science including ion traps, cavity QED, photons, nuclear magnetic resonance, and solid-state proposals.