Results 1  10
of
2,591,767
Noninteractive ZeroKnowledge
 SIAM J. COMPUTING
, 1991
"... This paper investigates the possibility of disposing of interaction between prover and verifier in a zeroknowledge proof if they share beforehand a short random string. Without any assumption, it is proven that noninteractive zeroknowledge proofs exist for some numbertheoretic languages for which ..."
Abstract

Cited by 216 (19 self)
 Add to MetaCart
This paper investigates the possibility of disposing of interaction between prover and verifier in a zeroknowledge proof if they share beforehand a short random string. Without any assumption, it is proven that noninteractive zeroknowledge proofs exist for some numbertheoretic languages
The Definition of Standard ML
, 1990
"... I generated this file on October 12, 2002, from a backup dated May 2, 1991, since no original dvi file was available in the backup. I had to change two occurrences of>From to From in the source files (apparently corruption caused by a mail program). Furthermore, I had to edit the ..."
Abstract

Cited by 1721 (48 self)
 Add to MetaCart
I generated this file on October 12, 2002, from a backup dated May 2, 1991, since no original dvi file was available in the backup. I had to change two occurrences of>From to From in the source files (apparently corruption caused by a mail program). Furthermore, I had to edit the
The Complexity of Perfect ZeroKnowledge
, 1987
"... A Perfect ZeroKnowledge interactive proof system convinces a verifier that a string is in a language without revealing any additional knowledge in an informationtheoretic sense. We show that for any language that has a perfect zeroknowledge proof system, its complement has a short interactive pro ..."
Abstract

Cited by 95 (3 self)
 Add to MetaCart
A Perfect ZeroKnowledge interactive proof system convinces a verifier that a string is in a language without revealing any additional knowledge in an informationtheoretic sense. We show that for any language that has a perfect zeroknowledge proof system, its complement has a short interactive
Resettable zeroknowledge
, 2000
"... We introduce the notion of Resettable ZeroKnowledge (rZK), a new security measure for cryptographic protocols which strengthens the classical notion of zeroknowledge. In essence, an rZK protocol is one that remains zero knowledge even if an adversary can interact with the prover many times, each ..."
Abstract

Cited by 80 (6 self)
 Add to MetaCart
, each time resetting the prover to its initial state and forcing it to use the same random tape. All known examples of zeroknowledge proofs and arguments are trivially breakable in this setting. Moreover, by definition, all zeroknowledge proofs of knowledge are breakable in this setting. Under general
Learning the Kernel Matrix with SemiDefinite Programming
, 2002
"... Kernelbased learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points. The embedding is performed implicitly, by specifying the inner products between each pair of points in the embedding space. This information ..."
Abstract

Cited by 780 (22 self)
 Add to MetaCart
is contained in the socalled kernel matrix, a symmetric and positive definite matrix that encodes the relative positions of all points. Specifying this matrix amounts to specifying the geometry of the embedding space and inducing a notion of similarity in the input spaceclassical model selection
ZeroKnowledge Sets
, 2003
"... We show how a polynomialtime prover can commit to an arbitrary finite set S of strings so that, later on, he can, for any string x, reveal with a proof whetherÜËorÜ�Ë, without revealing any knowledge beyond the verity of these membership assertions. Our method is non interactive. Given a public ran ..."
Abstract

Cited by 58 (0 self)
 Add to MetaCart
random string. Our scheme is very efficient; no reasonable prior way to achieve our desiderata existed. Our new primitive immediately extends to providing zeroknowledge “databases.”
The JPEG still picture compression standard
 Communications of the ACM
, 1991
"... This paper is a revised version of an article by the same title and author which appeared in the April 1991 issue of Communications of the ACM. For the past few years, a joint ISO/CCITT committee known as JPEG (Joint Photographic Experts Group) has been working to establish the first international c ..."
Abstract

Cited by 1128 (0 self)
 Add to MetaCart
compression standard for continuoustone still images, both grayscale and color. JPEG’s proposed standard aims to be generic, to support a wide variety of applications for continuoustone images. To meet the differing needs of many applications, the JPEG standard includes two basic compression methods, each
Fair zeroknowledge
 In Proc. Theory of Cryptography Conference
, 2005
"... where every proof is guaranteed to be “zeroknowledge for all verifiers.” That is, if an honest verifier accepts a fair zeroknowledge proof, then he is assured that all other verifiers also learn nothing more than the verity of the statement in question, even if they maliciously collude with a chea ..."
Abstract

Cited by 39 (13 self)
 Add to MetaCart
cheating prover. We construct Fair ZeroKnowledge systems based on standard complexity assumptions (specifically, the quadratic residuosity assumption) and an initial, onetime use of a physically secure communication channel (specifically, each verifier sends the prover a private message in an envelope
Random Oracles are Practical: A Paradigm for Designing Efficient Protocols
, 1995
"... We argue that the random oracle model  where all parties have access to a public random oracle  provides a bridge between cryptographic theory and cryptographic practice. In the paradigm we suggest, a practical protocol P is produced by first devising and proving correct a protocol P R for the ..."
Abstract

Cited by 1643 (75 self)
 Add to MetaCart
encryption, signatures, and zeroknowledge proofs.
Towards a Standard Upper Ontology
, 2001
"... The Suggested Upper Merged Ontology (SUMO) is an upper level ontology that has been proposed as a starter document for The Standard Upper Ontology Working Group, an IEEEsanctioned working group of collaborators from the fields of engineering, philosophy, and information science. The SUMO provides d ..."
Abstract

Cited by 576 (21 self)
 Add to MetaCart
and the relations between them. Categories & Descriptors  I.2.4 [Knowledge Representation Formalisms and Methods]: Artificial Intelligence  representations (procedural and rulebased), semantic networks. General Terms  Documentation, Languages, Standardization, Theory. Keywords  Ontologies
Results 1  10
of
2,591,767