Results 1  10
of
491
Semantic priming and retrieval from lexical memory: Evidence for facilitatory and inhibitory processes
 Memory & Cognition
"... Prior to each visually presented target letter string in a speeded wordnonword classification task, either BIRD, BODY, BUILDING, or xxx appeared as a priming event. When the target was a word, it was (a) a name of a type of bird on most BiRDprime trials; (b) a name of part of a building on most BO ..."
Abstract

Cited by 482 (3 self)
 Add to MetaCart
Prior to each visually presented target letter string in a speeded wordnonword classification task, either BIRD, BODY, BUILDING, or xxx appeared as a priming event. When the target was a word, it was (a) a name of a type of bird on most BiRDprime trials; (b) a name of part of a building on most
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 480 (20 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
Publickey Cryptosystems Provably Secure against Chosen Ciphertext Attacks
 In Proc. of the 22nd STOC
, 1995
"... We show how to construct a publickey cryptosystem (as originally defined by Diffie and Hellman) secure against chosen ciphertext attacks, given a publickey cryptosystem secure against passive eavesdropping and a noninteractive zeroknowledge proof system in the shared string model. No such secure ..."
Abstract

Cited by 284 (19 self)
 Add to MetaCart
We show how to construct a publickey cryptosystem (as originally defined by Diffie and Hellman) secure against chosen ciphertext attacks, given a publickey cryptosystem secure against passive eavesdropping and a noninteractive zeroknowledge proof system in the shared string model
Optimal Asymmetric Encryption
, 1994
"... Given an arbitrary kbit to kbit trapdoor permutation f and a hash function, we exhibit an encryption scheme for which (i) any string z of length slightly less than k bits can be encrypted as where r= is a simple probabilistic encoding of z depending on the hash function; and (ii) the scheme ca ..."
Abstract

Cited by 275 (14 self)
 Add to MetaCart
Given an arbitrary kbit to kbit trapdoor permutation f and a hash function, we exhibit an encryption scheme for which (i) any string z of length slightly less than k bits can be encrypted as where r= is a simple probabilistic encoding of z depending on the hash function; and (ii) the scheme
Optimal Asymmetric Encryption – How to Encrypt with RSA
, 1995
"... Given an arbitrary kbit to kbit trapdoor permutation f and a hash function, we exhibit an encryption scheme for which (i) any string x of length slightly less than k bits can be encrypted as f(rx), where rx is a simple probabilistic encoding of x depending on the hash function; and (ii) the scheme ..."
Abstract

Cited by 224 (21 self)
 Add to MetaCart
Given an arbitrary kbit to kbit trapdoor permutation f and a hash function, we exhibit an encryption scheme for which (i) any string x of length slightly less than k bits can be encrypted as f(rx), where rx is a simple probabilistic encoding of x depending on the hash function; and (ii
Open and Closed String Interpretation of SUSY CFT’s on Branes with Boundaries
"... We consider certain supersymmetric configurations of intersecting branes and branes ending on branes and analyze the duality between their open and closed string interpretation. The examples we study are chosen such that we have the lower dimensional brane realizing an n + 1 dimensional conformal fi ..."
Abstract

Cited by 144 (15 self)
 Add to MetaCart
We consider certain supersymmetric configurations of intersecting branes and branes ending on branes and analyze the duality between their open and closed string interpretation. The examples we study are chosen such that we have the lower dimensional brane realizing an n + 1 dimensional conformal
Vulnerability of SSL to ChosenPlaintext Attack
, 2004
"... The Secure Sockets Layer (SSL) protocol is widely used for securing communication over the Internet. When utilizing block ciphers for encryption, the SSL standard mandates the use of the cipher block chaining (CBC) mode of encryption which requires an initialization vector (IV) in order to encryp ..."
Abstract

Cited by 16 (1 self)
 Add to MetaCart
to encrypt. Although the initial IV used by SSL is a (pseudo)random string which is generated and shared during the initial handshake phase, subsequent IVs used by SSL are chosen in a deterministic, predictable pattern; in particular, the IV of a message is taken to be the final ciphertext block
Derandomizing from Random Strings
"... In this paper we show that BPP is truthtable reducible to the set of Kolmogorov random strings RK. It was previously known that PSPACE, and hence BPP is Turingreducible to RK. The earlier proof relied on the adaptivity of the Turingreduction to find a Kolmogorovrandom string of polynomial length ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
used as advice are not much more useful than randomly chosen strings. 1
String Recognition on Anonymous Rings
 in proceedings of 20th International Symposium on Mathematical Foundations of Computer Science, Prague, Chech Republic, July/Sep
, 1994
"... We consider the problem of recognizing whether a given binary string of length n is equal (up to rotation) to the input of an anonymous oriented ring of n processors. Previous algorithms for this problem have been "global" and do not take into account "local" patterns occurrin ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
are given which depend on the period of the string. For the case of a randomly chosen string, an optimal algorithm for the problem is given.
ChosenCipher Security of EPOC2
, 2001
"... At Eurocrypt’98, Okamoto and Uchiyama presented a new trapdoor (oneway) function based on factoring [5], while Fujisaki and Okamoto, at CRYPTO’99, showed a generic conversion from just oneway encryption to chosenciphertext secure encryption in the random oracle model [3]. We point out here that ..."
Abstract
 Add to MetaCart
At Eurocrypt’98, Okamoto and Uchiyama presented a new trapdoor (oneway) function based on factoring [5], while Fujisaki and Okamoto, at CRYPTO’99, showed a generic conversion from just oneway encryption to chosenciphertext secure encryption in the random oracle model [3]. We point out here
Results 1  10
of
491