Results 1  10
of
860,148
The pseudorandomness of manyround LaiMassey scheme
"... Abstract. In this paper we prove beyondbirthdaybound for the (strong) pseudorandomness of manyround LaiMassey scheme. Motivated by Hoang and Rogaway’s analysis of generalized Feistel networks, we use the coupling technology from Markov chain theory and prove that for any > 0, with enough rou ..."
Abstract
 Add to MetaCart
Abstract. In this paper we prove beyondbirthdaybound for the (strong) pseudorandomness of manyround LaiMassey scheme. Motivated by Hoang and Rogaway’s analysis of generalized Feistel networks, we use the coupling technology from Markov chain theory and prove that for any > 0, with enough
How many rounds can Random Selection handle?∗
"... The construction of zeroknowledge proofs can be greatly simplified if the protocol is only required be secure against the honest verifier. Damg̊ard, Goldreich and Wigderson invented a Random Selection technique to transform a publiccoin honest verifier zeroknowledge protocol to a general zerokn ..."
Abstract
 Add to MetaCart
knowledge protocol. Though all the three variants of Zero Knowledge, i.e. Perfect ZeroKnowledge(PZK), Statistical ZeroKnowledge(SZK), Computational ZeroKnowledge(CZK) can be handled, their method, however, only applies to constantround protocols. Later, Goldreich, Sahai and Vadhan extended the transformation
BlackBox Concurrent ZeroKnowledge Requires (almost) Logarithmically Many Rounds
 SIAM Journal on Computing
, 2002
"... We show that any concurrent zeroknowledge protocol for a nontrivial language (i.e., for a language outside BPP), whose security is proven via blackbox simulation, must use at least ~ \Omega\Gamma/10 n) rounds of interaction. This result achieves a substantial improvement over previous lower bound ..."
Abstract

Cited by 105 (9 self)
 Add to MetaCart
We show that any concurrent zeroknowledge protocol for a nontrivial language (i.e., for a language outside BPP), whose security is proven via blackbox simulation, must use at least ~ \Omega\Gamma/10 n) rounds of interaction. This result achieves a substantial improvement over previous lower
Similarity estimation techniques from rounding algorithms
 In Proc. of 34th STOC
, 2002
"... A locality sensitive hashing scheme is a distribution on a family F of hash functions operating on a collection of objects, such that for two objects x, y, Prh∈F[h(x) = h(y)] = sim(x,y), where sim(x,y) ∈ [0, 1] is some similarity function defined on the collection of objects. Such a scheme leads ..."
Abstract

Cited by 436 (6 self)
 Add to MetaCart
sensitive hashing scheme for a collection of subsets with the set similarity measure sim(A, B) = A∩B A∪B . We show that rounding algorithms for LPs and SDPs used in the context of approximation algorithms can be viewed as locality sensitive hashing schemes for several interesting collections of objects
The Security of ManyRound LubyRackoff PseudoRandom Permutations
, 2003
"... Luby and Rackoff showed how to construct a (super)pseudorandom permutation {0, 1} from some number r of pseudorandom functions f0; 1g . Their construction, motivated by DES, consists of a cascade of r Feistel permutations. A Feistel permutation 1for a pseudorandom function f is de ned as (L; R) ! ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
Luby and Rackoff showed how to construct a (super)pseudorandom permutation {0, 1} from some number r of pseudorandom functions f0; 1g . Their construction, motivated by DES, consists of a cascade of r Feistel permutations. A Feistel permutation 1for a pseudorandom function f is de ned as (L; R) ! (R; L f(R)), where L and R are the left and right part of the input and denotes bitwise XOR or, in this paper, any other group operation on . The only nontrivial step of the security proof consists of proving that the cascade of r Feistel permutations with independent uniform random functions f0; 1g , denoted 2n , is indistinguishable from a uniform random permutation f0; 1g by any computationally unbounded adaptive distinguisher making at most O(2 combined chosen plaintext/ciphertext queries for any c < , where is a security parameter.
Vivaldi: A Decentralized Network Coordinate System
 In SIGCOMM
, 2004
"... Largescale Internet applications can benefit from an ability to predict roundtrip times to other hosts without having to contact them first. Explicit measurements are often unattractive because the cost of measurement can outweigh the benefits of exploiting proximity information. Vivaldi is a simp ..."
Abstract

Cited by 593 (5 self)
 Add to MetaCart
Largescale Internet applications can benefit from an ability to predict roundtrip times to other hosts without having to contact them first. Explicit measurements are often unattractive because the cost of measurement can outweigh the benefits of exploiting proximity information. Vivaldi is a
Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming
 Journal of the ACM
, 1995
"... We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds the solution ..."
Abstract

Cited by 1231 (13 self)
 Add to MetaCart
We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds
GPFS: A SharedDisk File System for Large Computing Clusters
 In Proceedings of the 2002 Conference on File and Storage Technologies (FAST
, 2002
"... GPFS is IBM's parallel, shareddisk file system for cluster computers, available on the RS/6000 SP parallel supercomputer and on Linux clusters. GPFS is used on many of the largest supercomputers in the world. GPFS was built on many of the ideas that were developed in the academic community ove ..."
Abstract

Cited by 518 (3 self)
 Add to MetaCart
GPFS is IBM's parallel, shareddisk file system for cluster computers, available on the RS/6000 SP parallel supercomputer and on Linux clusters. GPFS is used on many of the largest supercomputers in the world. GPFS was built on many of the ideas that were developed in the academic community
UNet: A UserLevel Network Interface for Parallel and Distributed Computing
 In Fifteenth ACM Symposium on Operating System Principles
, 1995
"... The UNet communication architecture provides processes with a virtual view of a network interface to enable userlevel access to highspeed communication devices. The architecture, implemented on standard workstations using offtheshelf ATM communication hardware, removes the kernel from the communi ..."
Abstract

Cited by 596 (17 self)
 Add to MetaCart
, as well as novel abstractions like Active Messages can be implemented efficiently. A UNet prototype on an 8node ATM cluster of standard workstations offers 65 microseconds roundtrip latency and 15 Mbytes/sec bandwidth. It achieves TCP performance at maximum network bandwidth and demonstrates
Equationbased congestion control for unicast applications
 SIGCOMM '00
, 2000
"... This paper proposes a mechanism for equationbased congestion control for unicast traffic. Most besteffort traffic in the current Internet is wellserved by the dominant transport protocol, TCP. However, traffic such as besteffort unicast streaming multimedia could find use for a TCPfriendly cong ..."
Abstract

Cited by 832 (29 self)
 Add to MetaCart
single roundtrip time. We use both simulations and experiments over the Internet to explore performance. We consider equationbased congestion control a promising avenue of development for congestion control of multicast traffic, and so an additional motivation for this work is to lay a sound basis
Results 1  10
of
860,148