Results 1  10
of
747,388
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
Concurrent ZeroKnowledge
 IN 30TH STOC
, 1999
"... Concurrent executions of a zeroknowledge protocol by a single prover (with one or more verifiers) may leak information and may not be zeroknowledge in toto. In this paper, we study the problem of maintaining zeroknowledge We introduce the notion of an (; ) timing constraint: for any two proces ..."
Abstract

Cited by 177 (18 self)
 Add to MetaCart
interactive proofs and perfect concurrent zeroknowledge arguments for every language in NP . We also address the more specific problem of Deniable Authentication, for which we propose several particularly efficient solutions. Deniable Authentication is of independent interest, even in the sequential case
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
complexity assumptions, which hold for example if the Discrete Logarithm Problem is hard, we construct: ffl Resettable ZeroKnowledge proofsystems for NP with nonconstant number of rounds. ffl Fiveround Resettable WitnessIndistinguishable proofsystems for NP. ffl Fourround Resettable ZeroKnowledge
Perfect ZeroKnowledge Arguments for NP Using any OneWay Permutation
 Journal of Cryptology
, 1998
"... "Perfect zeroknowledge arguments" is a cryptographic primitive which allows one polynomialtime player to convince another polynomialtime player of the validity of an NP statement, without revealing any additional information (in the informationtheoretic sense). Here the security achi ..."
Abstract

Cited by 64 (6 self)
 Add to MetaCart
to implement zeroknowledge arguments based on specific algebraic assumptions. In this paper, we show a general construction, which can be based on any oneway permutation. The result is obtained by a construction of an informationtheoretic secure bitcommitment protocol. The protocol is efficient (both
Perfect ZeroKnowledge Arguments for NP Can Be Based on General Complexity Assumptions (Extended Abstract)
 JOURNAL OF CRYPTOLOGY
, 1998
"... "Zeroknowledge arguments" is a fundamental cryptographic primitive which allows one polynomialtime player to convince another polynomialtime player of the validity of an NP statement, without revealing any additional information in the informationtheoretic sense. Despite their practi ..."
Abstract

Cited by 42 (11 self)
 Add to MetaCart
their practical and theoretical importance, it was only known how to implement zeroknowledge arguments based on specific algebraic assumptions; basing them on a general complexity assumption was open since their introduction in 1986 [BCC, BC, CH]. In this paper, we finally show a general construction, which can
DecisionTheoretic Planning: Structural Assumptions and Computational Leverage
 JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH
, 1999
"... Planning under uncertainty is a central problem in the study of automated sequential decision making, and has been addressed by researchers in many different fields, including AI planning, decision analysis, operations research, control theory and economics. While the assumptions and perspectives ..."
Abstract

Cited by 510 (4 self)
 Add to MetaCart
Planning under uncertainty is a central problem in the study of automated sequential decision making, and has been addressed by researchers in many different fields, including AI planning, decision analysis, operations research, control theory and economics. While the assumptions
Concurrent ZeroKnowledge Proofs for NP
, 2001
"... A proof is concurrent zeroknowledge if it remains zeroknowledge when many copies of the proof are run in an asynchronous environment, such as the Internet. It is known that zeroknowledge is not necessarily preserved in such an environment [26, 31, 5]. Designing concurrent zeroknowledge proofs ..."
Abstract
 Add to MetaCart
is a fundamental issue in the study of zeroknowledge since known zeroknowledge protocols cannot be run in a realistic modern computing environment. In this paper we rst show that there exists a concurrent zeroknowledge proof system for all languages in NP. Our proof system is the rst zeroknowledge
On the Composition of ZeroKnowledge Proof Systems
 SIAM Journal on Computing
, 1990
"... : The wide applicability of zeroknowledge interactive proofs comes from the possibility of using these proofs as subroutines in cryptographic protocols. A basic question concerning this use is whether the (sequential and/or parallel) composition of zeroknowledge protocols is zeroknowledge too. We ..."
Abstract

Cited by 214 (15 self)
 Add to MetaCart
execution. We present lower bounds on the round complexity of zeroknowledge proofs, with significant implications to the parallelization of zeroknowledge protocols. We prove that 3round interactive proofs and constantround ArthurMerlin proofs that are blackbox simulation zeroknowledge exist only
Rethinking individualism and collectivism: Evaluation of theoretical assumptions and metaanalyses
 Psychological Bulletin
, 2002
"... Are Americans more individualistic and less collectivistic than members of other groups? The authors summarize plausible psychological implications of individualism–collectivism (INDCOL), metaanalyze crossnational and withinUnited States INDCOL differences, and review evidence for effects of IN ..."
Abstract

Cited by 484 (9 self)
 Add to MetaCart
Are Americans more individualistic and less collectivistic than members of other groups? The authors summarize plausible psychological implications of individualism–collectivism (INDCOL), metaanalyze crossnational and withinUnited States INDCOL differences, and review evidence for effects of INDCOL on selfconcept, wellbeing, cognition, and relationality. European Americans were found to be both more individualistic—valuing personal independence more—and less collectivistic—feeling duty to ingroups less—than others. However, European Americans were not more individualistic than African Americans, or Latinos, and not less collectivistic than Japanese or Koreans. Among Asians, only Chinese showed large effects, being both less individualistic and more collectivistic. Moderate INDCOL effects were found on selfconcept and relationality, and large effects were found on attribution and cognitive style. To contemporary Americans, being an individualist is not only a good thing; it is a quintessentially American thing. However, the term individualism itself appears to have its roots outside of the North American continent, namely in the French Revolution. It appears that individualism was first used to describe the negative
Interleaved ZeroKnowledge
, 1999
"... We introduce the notion of Interleaved ZeroKnowledge (iZK), a new security measure for cryptographic protocols which strengthens the classical notion of zeroknowledge, in a way suitable for multiple concurrent executions in an asynchronous environment like the internet. We prove that iZK protoc ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
rounds. The protocols are in the public key model: the verifier is assumed to have a public key associated with it. This implies, concurrent constantround zeroknowledge computationallysound proofs for NP in the public key model, without resorting to any timing assumptions. Analogously, we define Interleaved
Results 1  10
of
747,388