{"title":"零知识参数和公钥加密","authors":"A. Desantis, Giovanni DiCrescenzo","doi":"10.1006/INCO.1995.1121","DOIUrl":null,"url":null,"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.","PeriodicalId":54524,"journal":{"name":"Quantum Information & Computation","volume":"241 1","pages":"23-40"},"PeriodicalIF":0.7000,"publicationDate":"1995-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Zero-knowledge arguments and public-key cryptography\",\"authors\":\"A. Desantis, Giovanni DiCrescenzo\",\"doi\":\"10.1006/INCO.1995.1121\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":54524,\"journal\":{\"name\":\"Quantum Information & Computation\",\"volume\":\"241 1\",\"pages\":\"23-40\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"1995-08-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Quantum Information & Computation\",\"FirstCategoryId\":\"101\",\"ListUrlMain\":\"https://doi.org/10.1006/INCO.1995.1121\",\"RegionNum\":4,\"RegionCategory\":\"物理与天体物理\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Quantum Information & Computation","FirstCategoryId":"101","ListUrlMain":"https://doi.org/10.1006/INCO.1995.1121","RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
Zero-knowledge arguments and public-key cryptography
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.
期刊介绍:
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.