Results 1  10
of
41,810
Interactive Locking, ZeroKnowledge PCPs, and Unconditional Cryptography
, 2010
"... Motivated by the question of basing cryptographic protocols on stateless tamperproof hardware tokens, we revisit the question of unconditional twoprover zeroknowledge proofs for NP. We show that such protocols exist in the interactive PCP model of Kalai and Raz (ICALP ’08), where one of the prove ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
Motivated by the question of basing cryptographic protocols on stateless tamperproof hardware tokens, we revisit the question of unconditional twoprover zeroknowledge proofs for NP. We show that such protocols exist in the interactive PCP model of Kalai and Raz (ICALP ’08), where one
NonMalleable Cryptography
 SIAM Journal on Computing
, 2000
"... The notion of nonmalleable cryptography, an extension of semantically secure cryptography, is defined. Informally, in the context of encryption the additional requirement is that given the ciphertext it is impossible to generate a different ciphertext so that the respective plaintexts are related. ..."
Abstract

Cited by 490 (21 self)
 Add to MetaCart
. The same concept makes sense in the contexts of string commitment and zeroknowledge proofs of possession of knowledge. Nonmalleable schemes for each of these three problems are presented. The schemes do not assume a trusted center; a user need not know anything about the number or identity of other
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
: 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
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
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
On Efficient ZeroKnowledge PCPs
"... Abstract. We revisit the question of ZeroKnowledge PCPs, studied by Kilian, Petrank, and Tardos (STOC ’97). A ZKPCP is defined similarly to a standard PCP, except that the view of any (possibly malicious) verifier can be efficiently simulated up to a small statistical distance. Kilian et al. obtai ..."
Abstract
 Add to MetaCart
. The existence of ZKPCPs for NP with efficient oracles and arbitrary polynomialtime malicious verifiers was left open. This question is motivated by the recent line of work on cryptography using tamperproof hardware tokens: an efficient ZKPCP (for any language) is equivalent to a statistical zeroknowledge
ZeroKnowledge Arguments and PublicKey Cryptography
, 1995
"... In this work we consider the DiffieHellman Publickey model in which an additional short random string is shared by all users. This, which we call PublicKey PublicRandomness (PKPR) model, is very powerful as we show that it supports simple noninteractive implementations of important cryptographi ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
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 ZeroKnowledge Arguments in the PKPR model. 1
HonestVerifier Statistical ZeroKnowledge Equals General Statistical ZeroKnowledge
 In Proceedings of the 30th Annual ACM Symposium on Theory of Computing
, 1998
"... We show how to transform any interactive proof system which is statistical zeroknowledge with respect to the honestverifier, into a proof system which is statistical zeroknowledge with respect to any verifier. This is done by limiting the behavior of potentially cheating verifiers, without using ..."
Abstract

Cited by 48 (16 self)
 Add to MetaCart
We show how to transform any interactive proof system which is statistical zeroknowledge with respect to the honestverifier, into a proof system which is statistical zeroknowledge with respect to any verifier. This is done by limiting the behavior of potentially cheating verifiers, without using
Investor psychology and security market under and overreactions
 Journal of Finance
, 1998
"... We propose a theory of securities market under and overreactions based on two wellknown psychological biases: investor overconfidence about the precision of private information; and biased selfattribution, which causes asymmetric shifts in investors ’ confidence as a function of their investment ..."
Abstract

Cited by 661 (38 self)
 Add to MetaCart
We propose a theory of securities market under and overreactions based on two wellknown psychological biases: investor overconfidence about the precision of private information; and biased selfattribution, which causes asymmetric shifts in investors ’ confidence as a function of their investment outcomes. We show that overconfidence implies negative longlag autocorrelations, excess volatility, and, when managerial actions are correlated with stock mispricing, publiceventbased return predictability. Biased selfattribution adds positive shortlag autocorrelations ~“momentum”!, shortrun earnings “drift, ” but negative correlation between future returns and longterm past stock market and accounting performance. The theory also offers several untested implications and implications for corporate financial policy. IN RECENT YEARS A BODY OF evidence on security returns has presented a sharp challenge to the traditional view that securities are rationally priced to ref lect all publicly available information. Some of the more pervasive anoma
Wireless Communications
, 2005
"... Copyright c ○ 2005 by Cambridge University Press. This material is in copyright. Subject to statutory exception and to the provisions of relevant collective licensing agreements, no reproduction of any part may take place without the written permission of Cambridge University ..."
Abstract

Cited by 1129 (32 self)
 Add to MetaCart
Copyright c ○ 2005 by Cambridge University Press. This material is in copyright. Subject to statutory exception and to the provisions of relevant collective licensing agreements, no reproduction of any part may take place without the written permission of Cambridge University
Results 1  10
of
41,810