PUBLIC-RANDOMNESS IN PUBLIC-KEY CRYPTOGRAPHY

被引:0
|
作者
DESANTIS, A
PERSIANO, G
机构
[1] UNIV SALERNO,DIPARTIMENTO INFORMAT & APPL,I-84081 SALERNO,ITALY
[2] HARVARD UNIV,AIKEN COMP LAB,CAMBRIDGE,MA 02138
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
In this work we investigate the power of Public Randomness in the context of Public-key cryptosystems. 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 the first completely non-interactive implementation of Oblivious Transfer. Our implementation is also secure against receivers with unlimited computational power. We propose the first implementation of non-interactive nature for Perfect Zero-Knowledge in the dual model of Brassard, Crepeau, and Chaum for all NP-languages.
引用
收藏
页码:46 / 62
页数:17
相关论文
共 50 条