Results 1  10
of
3,836
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 101 (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
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 16 (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.
Random Early Detection Gateways for Congestion Avoidance.
 IEEELACM Transactions on Networking,
, 1993
"... AbstractThis paper presents Random Early Detection (RED) gateways for congestion avoidance in packetswitched networks. The gateway detects incipient congestion by computing the average queue size. The gateway could notify connections of congestion either by dropping packets arriving at the gatewa ..."
Abstract

Cited by 2716 (31 self)
 Add to MetaCart
by many active connections with a wide range of roundtrip times, tolerances of delay, throughput requirements, etc. Decisions about the duration and magnitude of transient congestion to be allowed at the gateway are best made by the gateway itself. The method of monitoring the average queue size
Improving roundtrip time estimates in reliable transport protocols
 ACM Transactions on Computer Systems
, 1987
"... As a reliable, endtoend transport protocol, the Transmission Control Protocol (TCP) uses positive acknowledgements and retransmission to guarantee delivery. TCP implementations are expected to measure and adapt to changing roundtrip delay so that their retransmission behavior balances user throug ..."
Abstract

Cited by 240 (0 self)
 Add to MetaCart
if the roundtrip time it measures is for an original transmission or a retransmission of a datagram. Many existing TCP implementations do not handle this problem correctly. Furthermore, the problem of retransmission ambiguity is also a characteristic of other major transport protocols, including 0S1 TP4
Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches
, 1999
"... In combinatorial auctions, multiple goods are sold simultaneously and bidders may bid for arbitrary combinations of goods. Determining the outcome of such an auction is an optimization problem that is NPcomplete in the general case. We propose two methods of overcoming this apparent intractability. ..."
Abstract

Cited by 288 (9 self)
 Add to MetaCart
, marketbased approach. It sets up a virtual multiround auction in which a virtual agent represents each original bid bundle and places bids, according to a fixed strategy, for each good in that bundle. We show through experiments on synthetic data that (a) our first method finds optimal allocations
Social Comparisons and ProSocial Behavior: Testing “Conditional Cooperation” in a Field Experiment
 American Economic Review
, 2004
"... Many important activities, such as charitable giving, voting, and paying taxes, are difficult to explain by the narrow selfinterest hypothesis. In a large number of laboratory experiments, the selfinterest hypothesis was rejected with respect to contributions to public goods (e.g., John O. Ledyard ..."
Abstract

Cited by 240 (15 self)
 Add to MetaCart
Many important activities, such as charitable giving, voting, and paying taxes, are difficult to explain by the narrow selfinterest hypothesis. In a large number of laboratory experiments, the selfinterest hypothesis was rejected with respect to contributions to public goods (e.g., John O
Modeling TCP latency
 in IEEE INFOCOM
, 2000
"... Abstract—Several analytic models describe the steadystate throughput of bulk transfer TCP flows as a function of round trip time and packet loss rate. These models describe flows based on the assumption that they are long enough to sustain many packet losses. However, most TCP transfers across toda ..."
Abstract

Cited by 235 (8 self)
 Add to MetaCart
Abstract—Several analytic models describe the steadystate throughput of bulk transfer TCP flows as a function of round trip time and packet loss rate. These models describe flows based on the assumption that they are long enough to sustain many packet losses. However, most TCP transfers across
Data Gathering Algorithms in Sensor Networks Using Energy Metrics
 IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
, 2002
"... Sensor webs consisting of nodes with limited battery power and wireless communications are deployed to collect useful information from the field. Gathering sensed information in an energy efficient manner is critical to operating the sensor network for a long period of time. In [12], a data collecti ..."
Abstract

Cited by 226 (2 self)
 Add to MetaCart
station, thus reducing the amount of energy spent per round. Simulation results show that PEGASIS performs better than LEACH by about 100 to 200 percent when 1 percent, 25 percent, 50 percent, and 100 percent of nodes die for different network sizes and topologies. For many applications, in addition
Results 1  10
of
3,836