Search Results - "Kilian, Joe"

The Security of the Cipher Block Chaining Message Authentication Code by Bellare, Mihir, Kilian, Joe, Rogaway, Phillip

“…Let F be some block cipher (eg., DES) with block length l. The cipher block chaining message authentication code (CBC MAC) specifies that an m-block message…”
Get full text

How to protect DES against exhaustive key search (an analysis of DESX) by KILIAN, Joe, ROGAWAY, Phillip

“…The block cipher \DESX is defined by \DESXk.k1.k2(x) = k2\xor \DESk (k1\xor x) , where \xor denotes bitwise exclusive-or. This construction was first suggested…”
Get full text

The Dynamic Universality of Sigmoidal Neural Networks by Kilian, Joe, Siegelmann, Hava T.

“…We investigate the computational power of recurrent neural networks that apply the sigmoid activation functionσ(x)=[2/(1+e−x)]−1. These networks are…”
Get full text

Asymptotic distribution for the birthday problem with multiple coincidences, via an embedding of the collision process by Arratia, Richard, Garibaldi, Skip, Kilian, Joe

“…We study the random variable B(c, n), which counts the number of balls that must be thrown into n equally‐sized bins in order to obtain c collisions. The…”
Get full text

Heuristics for Semirandom Graph Problems by Feige, Uriel, Kilian, Joe

“…We consider semirandom graph models for finding large independent sets, colorings, and bisections in graphs. These models generate problem instances by…”
Get full text

Secure spread spectrum watermarking for multimedia by Cox, I.J., Kilian, J., Leighton, F.T., Shamoon, T.

“…This paper presents a secure (tamper-resistant) algorithm for watermarking images, and a methodology for digital watermarking that may be generalized to audio,…”
Get full text

Zero Knowledge and the Chromatic Number by Feige, Uriel, Kilian, Joe

“…We present a new technique, inspired by zero-knowledge proof systems, for proving lower bounds on approximating the chromatic number of a graph. To illustrate…”
Get full text

Betting Boolean-style: a framework for trading in securities based on logical formulas by Fortnow, Lance, Kilian, Joe, Pennock, David M., Wellman, Michael P.

“…We develop a framework for trading in compound securities: financial instruments that pay off contingent on the outcomes of arbitrary statements in…”
Get full text

An efficient noninteractive zero-knowledge proof system for NP with general assumptions by KILIAN, J, PETRANK, E

“…We consider noninteractive zero-knowledge proofs in the shared random string model proposed by Blum et al. [5]. Until recently there was a sizable polynomial…”
Get full text

Communication vs. Computation by Harsha, Prahladh, Ishai, Yuval, Kilian, Joe, Nissim, Kobbi, Venkatesh, S.

Get full text

Finding OR in a noisy broadcast network by Feige, Uriel, Kilian, Joe

“…We consider a broadcast network of n processors in which each bit transmitted by each processor is received by each other processor via a noisy channel. Each…”
Get full text

Lower Bounds For Concurrent Zero Knowledge by Kilian, Joe, Rackoff, Charles, Petrank, Erez

Get full text

GUEST EDITOR'S FOREWORD by Cowen, Lenore, Fagin, Ronald, Kilian, Joe, Kleinberg, Jon

Get full text

Zero-knowledge sets by Micali, S., Rabin, M., Kilian, J.

“…We show how a polynomial-time 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…”
Get full text

On Concurrent and Resettable Zero-Knowledge Proofs for NP by Kilian, Joe, Petrank, Erez, Richardson, Ransom

“…A proof is concurrent zero-knowledge if it remains zero-knowledge when many copies of the proof are run in an asynchronous environment, such as the Internet…”
Get full text

Lower Bounds for Zero-knowledge on the Internet by Kilian, Joe, Petrank, Erez, Rackoff, Charles

“…We consider zero knowledge interactive proofs in a richer, more realistic communication environment. In this setting, one may simultaneously engage in many…”
Get full text

Zero-knowledge with log-space verifiers by Kilian, J.

“…Interactive proof systems are considered in which the best set of possible verifiers is restricted to the class of probabilistic log-space automata. A. Condon…”
Get full text

The organization of permutation architectures with bused interconnections by Kilian, J., Kipnis, S., Leiserson, C.E.

“…The problem of efficiently permuting data stored in VLSI chips in accordance with a predetermined set of permutations is explored. By connecting chips with…”
Get full text

On the complexity of bounded-interaction and noninteractive zero-knowledge proofs by Kilian, J.

“…We consider the basic cryptographic primitive known as zero-knowledge proofs on committed bits. In this primitive, a prover P commits to a set of bits, and…”
Get full text

Lower bounds for zero knowledge on the Internet by Kilian, J., Petrank, E., Rackoff, C.

“…We consider zero knowledge interactive proofs in a richer, more realistic communication environment. In this setting, one may simultaneously engage in many…”
Get full text