Where results make sense

About us   |   Why use us?   |   Reviews   |   PR   |   Contact us

Topic: Zero knowledge proofs

    Note: these results are not from the primary (high quality) database.

Zero-knowledge proof - Wikipedia, the free encyclopedia Zero-knowledge proofs are not proofs in the mathematical sense of the term because there is some small probability (called the soundness error) that a cheating prover will be able to convince the verifier of a false statement. This application of zero-knowledge proofs was first used in the ground-breaking paper of Goldreich, Micali, and Wigderson on secure multiparty computation. A zero-knowledge password proof is a special kind of zero-knowledge proof of knowledge that addresses the limited size of passwords. en.wikipedia.org /wiki/Zero-knowledge_proof   (2257 words)

Reference for Topics in Commitment Scheme and Zero Knowledge Protocols Alfredo De Santis, Giuseppe Persiano : Zero-Knowledge Proofs of Knowledge Without Interaction (Extended Abstract). , Dror Lapidot, Adi Shamir: Multiple Non-Interactive Zero Knowledge Proofs Based on a Single Random String (Extended Abstract). , Erez Petrank, Gábor Tardos: Probabilistically Checkable Proofs with Zero Knowledge. www.comsec.uwaterloo.ca /~jiangshq/cz.html   (2257 words)

DIMACS Mixer Series In order to achieve these results, we formulate and investigate the problem of randomness-efficient error reduction for two-round public-coin witness-indistinguishable proofs, non-interactive witness-indistinguishable proofs, and non-interactive zero-knowledge proofs, which generalizes the analogue and well-studied problem for BPP computation. We investigate quantitative aspects of randomness in two types of proof systems for NP, motivated by cryptographic applications: two-round public-coin witness-indistinguishable proof systems and non-interactive zero-knowledge proof systems. The LAD classification models are constructed by applying discriminant analysis in the pattern space (or "knowledge space"). dimacs.rutgers.edu /Events/2002/mix1-abstracts.html   (583 words)

Zero-Knowledge (a tutorial by Oded Goldreich) This result is a powerful tool in the design of cryptographic protocols, because it enables to force parties to behave according to a predetermined protocol (i.e., the protocol requires parties to provide zero-knowledge proofs of the correctness of their secret-based actions, without revealing these secrets). Other topics treated in the full version of the tutorial (but not in its oral presentation) include proofs of knowledge, Non-Interactive Zero-Knowledge proofs, Statistical Zero-Knowledge, Knowledge Complexity, and the resettability of a party's random-tape. This belief has been refuted recently by a zero-knowledge argument (for NP) that has important properties that are unachievable by black-box simulation. www.wisdom.weizmann.ac.il /~oded/zk-tut02.html   (583 words)

Low bandwidth zero knowledge authentication protocol and device patent In a conventional security framework, it is assumed that the imposter can make multiple attacks on the prover, Feige et al., "Zero knowledge proofs of identity," Journal of Cryptology, Vol. adapted the concepts of zero knowledge to the application of authentication and proofs of knowledge. The honest-verifier zero knowledge protocol has a weaker security guarantee than the general zero knowledge protocol because it is possible that a dishonest verifier can extract the secret. www.freshpatents.com /Low-bandwidth-zero-knowledge-authentication-protocol-and-device-dt20050317ptan20050058288.php   (583 words)

Abstracts of Joseph Y. Halpern's Publications While the intuition underlying a zero knowledge proof system is that no ``knowledge'' is leaked by the prover to the verifier, researchers are just beginning to analyze such proof systems in terms of formal notions of knowledge. We show that, in a precise sense, any nontrivial weak interactive proof must be a proof about the prover's knowledge, and show that, under natural conditions, the notions of interactive proofs of knowledge defined by Tompa and Woll [1987] and Fiat, Feige, and Shamir [1987] are instances of weak interactive proofs. We consider the common-knowledge paradox raised in Knowledge and common knowledge in a distributed environment common knowledge is necessary for coordination, but common knowledge is unattainable in the real world because of temporal imprecision. www.cs.cornell.edu /home/halpern/abstract.html   (17980 words)

A Complete Problem for Statistical Zero Knowledge Simpler proofs of many of the previously known results about statistical zero knowledge, such as the Fortnow and Aiello--Håstad upper bounds on the complexity of SZK and Okamoto's result that SZK is closed under complement. Strong closure properties of SZK which amount to constructing statistical zero-knowledge proofs for complex assertions built out of simpler assertions already shown to be in SZK. We propose the use of complete problems to unify and extend the study of statistical zero knowledge. www.eecs.harvard.edu /~salil/papers/complete-abs.html   (17980 words)

Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes - Camenisch, Stadler (ResearchIndex) The main building blocks of our protocols are statistical zero-knowledge proofs of knowledge that... 82 Statistical zero knowledge protocols to prove modular polyno.. 94 Proofs of partial knowledge and simplified design of witness.. citeseer.lcs.mit.edu /151801.html   (17980 words)

Non-Interactive Zero Knowledge - Storming Media Without any assumption, we prove that non-interactive zero- knowledge proofs exist for some number theoretic languages for which no efficient algorithm is known. If deciding quadratic residuosity (modulo composite integers whose factorization is not known) is computationally hard, we show that the NP-complete language of satisfiability also possesses noninteractive zero-knowledge proofs. Abstract: We investigate the possibility of disposing of interaction between Prover and Verifier in a zero-knowledge proof if they share beforehand a short random string. www.stormingmedia.us /89/8962/A896222.html   (17980 words)

20010701110020010701pet In this talk, we present a concurrent zero-knowledge proof for all languages in NP with a poly-logarithmic round complexity: specifically, a bit more than $\log^2 k$ rounds given at most $k$ concurrent proofs. Richardson and Kilian have shown that there exists a concurrent zero-knowledge proof for any language in NP, but with round complexity **polynomial** in the maximum number of concurrent proofs. Finally, we show that a simple modification of our proof is a resettable zero-knowledge proof for NP, with the same number of rounds; previously known protocols required a polynomial number of rounds. www.math.technion.ac.il /~techm/20010701110020010701pet   (103 words)

h1130 Computational Complexity (11/30/98) bsy's Explanation of Zero Knowledge Proofs ---------------------------------------------------------------------------- Abstractly, a zero-knowledge proof is an interactive proof with a prover and a verifier, where the prover convinces the verifier of a statement (with high probability) without revealing any information about how to go about proving that statement. Such zero-knowledge proofs can be used for authentication -- the value of v can be generated from a randomly chose s, and v is widely published. Our zero-knowledge proof will consist of rounds of interaction which shows that the prover knows a square root of a published number, where we do not reveal any new information about the square root. www-cs.engr.ccny.cuny.edu /~csmma/cs5726/h1130   (678 words)

CPSC 467b Lecture Notes, Week 10 We have seen several examples of zero knowledge proofs but no careful definition of what it means to be "zero knowledge". What's different in the zero knowledge proof example is that Bob has a way to check the validity of the parts that he gets during the protocol. What we do want to capture by the notion of zero knowledge is that Bob learns nothing that might be useful in turning an intractable computation into a tractable one. zoo.cs.yale.edu /classes/cs467/2005s/attach/ln_week10.html   (3425 words)

Su04Maharaj.html  Such proofs, whenever they exist are called zero-knowledge proofs. It turns out that zero-knowledge proof systems have further reaching applications than solving engineering problems.  The main result I want to present is a method for constructing zero-knowledge proof systems for every language in the complexity class NP. www.math.columbia.edu /~ums/abstracts/Su04Maharaj.html   (240 words)

Cover Pages: PML: Proof Markup Language for Semantic Web Services. But even in the context of hybrid reasoning systems, few are the eorts to create a general representation of proofs rather than a representation that is able to conciliate few reasoner-specific representations. The Knowledge Systems Lab (KSL) conducts research in the core Artificial Intelligence areas of knowledge representation and reasoning, within the Department of Computer Science at Stanford University. In addition, each reasoner can store and maintain some of the system's knowledge, using its own specialized representations that support faster inference about the particular kinds of information for which it is specialized. xml.coverpages.org /ni2004-01-16-a.html   (240 words)

Redirecting Click here to go to: 2.1.8 What are interactive proofs and zero-knowledge proofs? We will promptly redirect you to your requested page, or if you prefer, click the link below. www.rsasecurity.com /rsalabs/faq/2-1-8.html   (47 words)

Nicola Abbagnano - DIZIONARIO DI FILOSOFIA: Voce: Filosofia Properly speaking, there are in philosophy neither definitions - which are constructions of concepts - nor axioms - that is, evident truths, nor demonstrations - that is, apodeictic proofs. An integral part of the interpretation of the origin of knowledge is the belief that even to use it to man's advantage (advantage that in this case is "salvation") is dictated or prescribed by a divine revelation or enlightenment. A) According to the first alternative, knowledge is a revelation or a divine gift, which one or more men have been granted, and that is transmitted by tradition among a privileged group of men (caste, sect, or church). www.nicolaabbagnano.it /archivio_di/a_14.htm   (10049 words)

Thesis proposal Some basic knowledge of combinatorics and the analysis of the running time of computer algorithms is helpful, but not a requirement as it can be acquired during the project. To prove his knowledge of the general solution method, Tartaglia did not have to reveal his secret, i.e., the formula. A knowledge of C++ or a similar programming language (e.g., Java) is also advisable. www.esat.kuleuven.ac.be /cosic/thesis/zk_ip_en.html   (10049 words)

The Anhinga Project -- Research Topics -- Security -- Zero Knowledge Proofs One very important characteristic of zero knowledge proofs is that the verifier learns nothing from the prover except that he or she knows the secret. Zero Knowledge Proofs allow one party to prove its knowledge of a secret to another party without ever revealing the secret itself. In theory, Zero Knowledge Proofs (ZKPs) provide an elegant solution to one of the most challenging aspects of security in ad hoc wireless networks--node identification. www.cs.rit.edu /~anhinga/topics/Zkp.shtml   (10049 words)

Machine Learning In response to the difficulties of encoding ever-increasing volumes of knowledge in modern AI systems, many researchers have recently turned their attention to machine learning as a means to overcome the knowledge acquisition bottleneck. Machine learning of grammars finds a variety of applications in syntactic pattern recognition, adaptive intelligent agents, diagnosis, computational biology, systems modelling, prediction, natural language acquisition, data mining and knowledge discovery. The notes concentrate on the important ideas in machine learning---it is neither a handbook of practice nor a compendium of theoretical proofs. www.aaai.org /AITopics/html/machine.html   (2951 words)

Knowledge Networks are the synergistic combination of enabling infrastructures including information infrastructure (e.g. computers, databases and digital libraries, computer-based user tools, visualization engines) connected through communication network Mathematicians are attempting to build computer systems that effectively represent mathematical knowledge, and that enable the construction of databases of mathematical results and mechanically checked proofs in forms that are readable and usable by people. Given its long experience with how this process of acculturation and distributed intelligence occurs in the scientific enterprise, NSF is positioned to aid in the development of the technological infrastructures, collaborative activities, and human communities needed for knowledge networking across in society as a whole. Multidisciplinary knowledge networking efforts will fail unless we understand and provide for the learning environments that enable skill sets, conceptual models, and values to be rapidly shared across disparate fields. www.scd.ucar.edu /info/FORMS/KNP1-6.html   (2951 words)

Zero Knowledge Proofs Zero knowledge proofs are a method of proving a piece of information is known without revealing what that information is. Suppose Alice knows some piece of information. Alice wants to prove to Bob that she knows, but doesn't want to tell Bob directly. www.cs.virginia.edu /~pev5b/writing/academic/thesis/node8.html   (2951 words)

Salil Vadhan's PhD Thesis Obtaining simpler proofs of most previously known results about statistical zero knowledge, such as: Okamoto's result that SZK is closed under complement; the Fortnow and Aiello--Håstad upper bounds on the complexity of SZK ; and Okamoto's result that every statistical zero-knowledge proof can be transformed into a public-coin one. Transforming any statistical zero-knowledge proof against an honest verifier (i.e., a verifier that follows the specified protocol) into one which is zero knowledge even against cheating verifiers that deviate arbitrarily from the specified protocol. They also simplify the study of statistical zero knowledge, as questions about the entire class SZK can be reduced to examining these two particular complete problems. www.eecs.harvard.edu /~salil/papers/phdthesis-abs.html   (2951 words)

Resettably-Sound Zero-Knowledge and its Applications First, we construct resettable zero-knowledge arguments of knowledge for NP, using a natural relaxation of the definition of arguments (and proofs) of knowledge. We note that, under the standard definition of proof of knowledge, it is impossible to obtain resettable zero-knowledge arguments of knowledge for languages outside BPP. Second, we construct a constant-round resettable zero-knowledge argument for NP in the public-key model, under the assumption that collision-free hash functions exist. www.weizmann.ac.il /mathusers/boaz/Papers/rszk.html   (2951 words)

bsy's Explanation of Zero Knowledge Proofs Such zero knowledge proofs can be used for authentication-- the value of Abstractly, a zero knowledge proof is an interactive proof with a prover and a verifier, where the prover convinces the verifier of a statement (with high probability) without revealing any information about how to go about proving that statement. Our zero knowledge proof will consist of rounds of interaction which shows that the prover knows a square root of a published number, where we do not reveal any new information about the square root. www.cs.cmu.edu /afs/cs.cmu.edu/user/bsy/www/ZKP.html   (2951 words)

Non-Interactive Zero Knowledge - Blum, De Santis, Micali, Persiano (ResearchIndex) 31 : Multiple non-interactive zero knowledge proofs based on a single random string (context) - Feige, Lapidot et al. 487 The Knowledge Complexity of Interactive ProofSystems (context) - Goldwasser, Micali et al. Non-Interactive Zero Knowledge - Blum, De Santis, Micali, Persiano (ResearchIndex) citeseer.lcs.mit.edu /blum91noninteractive.html   (2951 words)

Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions In this paper we show how to construct noninteractive zero knowledge proofs for any NP statement under general (rather than number theoretic) assumptions, and how to enable polynomially many provers to give polynomially many such proofs based on a single random string. Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions: SIAM Journal on Computing Vol. Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions epubs.siam.org /sam-bin/dbq/article/23001   (2951 words)

Slashdot Zero-Knowledge Open-Sources Linux Client I have no idea if any part of Zero Knowledge Inc.'s sytems use zero knowledge proofs or whether they just chose it for its cool name and vague relevancy. It's used to give "zero knowledge" to other parties who might be in the transaction who are not authorized. Blah blah, I work at zero knowledge, the opinions here are my own not my employers. slashdot.org /articles/00/10/23/1516237.shtml   (2951 words)

CEU Academic Archive - Zero Knowledge Proofs We start with the sock pairing protocol, and touch resettable zero knowledge. Central European University Academic Archive is running on GNU EPrints archive-creating software, which generates eprints archives that are compliant with the Open Archives Protocol for Metadata Harvesting OAI 1.1 and 2.0. ceu.archives.ceu.hu /archive/00001013   (2951 words)

CIS: Zero-Knowledge Proofs Zero-knowledge proofs were introduced by Goldwasser, Micali and Rackoff in The Knowledge Complexity of Interactive Proof Systems (SIAM J. of Comuting, January 1989). The wide applicability of zero-knowledge was demonstrated in Proofs that Yield Nothing But their Validity or All Languages in NP have Zero-Knowledge Proofs, coauthored by Goldreich, Micali and Wigderson [JACM, July 1991]. Zero-knowledge proofs are probabilistic and interactive proofs that efficiently demonstrate membership in the language without conveying any additional knowledge. theory.lcs.mit.edu /~cis/zk/zk.html   (2951 words)

Security Forums Dot Com :: View topic - Zero knowledge definitions / additive zero knowledge Hi, I have been trying to understand the following types of zero knowledge proofs.. BTW I have been working on the concept of 'additive' zero knowledge, which is roughly defined in the following papers: I would be grateful if someone could explain their meaning in layman terms: www.security-forums.com /forum/viewtopic.php?t=24964   (2951 words)

Try your search on: Qwika (all wikis)

About us   |   Why use us?   |   Reviews   |   Press   |   Contact us   Copyright © 2005-2007 www.factbites.com Usage implies agreement with terms.