Results 1  10
of
12,202
Transactional memory and the birthday paradox
 In Proceedings of the Nineteenth ACM Symposium on Parallel Algorithms and Architectures
"... Transactional Memory (TM) has been proposed as an alternative implementation of mutual exclusion that avoids many of the drawbacks of locks (e.g., deadlock, reliance on the programmer to associate shared data with locks, priority inversion, and failures of threads while holding locks). TM enables th ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
Transactional Memory (TM) has been proposed as an alternative implementation of mutual exclusion that avoids many of the drawbacks of locks (e.g., deadlock, reliance on the programmer to associate shared data with locks, priority inversion, and failures of threads while holding locks). TM enables the programmer to denote atomic regions (transactions) that are executed optimistically; if a conflict is detected, the thread is rolled back to the beginning of the transaction. A Software Transactional Memory (STM) implements speculative execution (so that a roll back can be performed) and conflict detection by adding additional code to the application. In an STM that tracks mutual exclusion at a word or cacheline granularity, an ownership table is used to keep track of which transactions currently have read and write permissions to which regions of memory. Memory addresses are mapped to ownership table entries by hashing the memory address. A frequently proposed design for ownership tables (used in previous STM and hybrid hardware/software TM proposals) is that of a tagless table, where read and write permissions are granted at the granularity of all addresses that map to a given ownership table entry. When two transactions have memory accesses that map to the same ownership table entry, the tagless nature of this organization requires the STM to conservatively
Brief Announcement: Transactional Memory and the Birthday Paradox
 In 19th ACM Symposium on Parallelism in Algorithms and Architectures
, 2007
"... have been proposed using tagless ownership tables, where read and write permissions are granted at the granularity of all addresses that map to a given ownership table entry. This optimization to reduce overhead potentially results in false conflicts. Using address traces from a multithreaded progra ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
foundation that is also responsible for the (naively) unintuitive statistical result generally referred to as the “Birthday Paradox. ” We present an analytical model based on random population of an ownership table by concurrently executing transactions that correctly predicts the trends in measured data
Birthday Paradox for Energy Conservation in Sensor Networks
"... Abstract — Recent advances in technology have made lowpower wireless sensor networks feasible. Energy saving is one of the key design issues in sensor networks. There has been some work in trying to save energy in sensor and ad hoc networks, using approaches like switching to sleep mode or transmis ..."
Abstract
 Add to MetaCart
propose a novel approach for energy conservation using the well known Birthday Paradox, for scheduling transition from idle to sleep mode. We tradeoff latency for a significant reduction in the amount of expended energy. This strategy provides some tunable parameters for the system, which can be used
Breaking H 2MAC Using Birthday Paradox
"... Abstract. H 2MAC was proposed to increase efficiency over HMAC by omitting its outer key, and keep the advantage and security of HMAC at the same time. However, as pointed out by the designer, the security of H 2MAC also depends on the secrecy of the intermediate value (the equivalent key) of the ..."
Abstract
 Add to MetaCart
) of the inner hashing. In this paper, we propose an efficient method to break H 2MAC, by using a generalized birthday attack to recover the equivalent key, under the assumption that the underlying hash function is secure (weak collision resistance). We can successfully recover the equivalent key of H 2MAC
A space efficient streaming algorithm for triangle counting using the birthday paradox
 KDD
"... We design a space efficient algorithm that approximates the transitivity (global clustering coefficient) and total triangle count with only a single pass through a graph given as a stream of edges. Our procedure is based on the classic probabilistic result, the birthday paradox. When the transitivi ..."
Abstract

Cited by 17 (2 self)
 Add to MetaCart
We design a space efficient algorithm that approximates the transitivity (global clustering coefficient) and total triangle count with only a single pass through a graph given as a stream of edges. Our procedure is based on the classic probabilistic result, the birthday paradox. When
Extending Birthday Paradox Theory to Estimate the Number of Tags in RFID Systems
, 2014
"... The main objective of Radio Frequency Identification systems is to provide fast identification for tagged objects. However, there is always a chance of collision, when tags transmit their data to the reader simultaneously. Collision is a timeconsuming event that reduces the performance of RFID syst ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
to be estimated. Therefore, an accurate tag estimation method has an important role in increasing the efficiency and overall performance of the tag identification process. In this paper, we propose a novel estimation technique for DFSA anticollision algorithms that applies birthday paradox theory to estimate
A Birthday Paradox for Markov chains, with an optimal bound for collision in the Pollard Rho Algorithm for Discrete Logarithm
"... We show a Birthday Paradox for selfintersections of Markov chains with uniform stationary distribution. As an application, we analyze Pollard’s Rho algorithm for finding the discrete logarithm in a cyclic group G and find that, if the partition in the algorithm is given by a random oracle, then wit ..."
Abstract

Cited by 10 (5 self)
 Add to MetaCart
We show a Birthday Paradox for selfintersections of Markov chains with uniform stationary distribution. As an application, we analyze Pollard’s Rho algorithm for finding the discrete logarithm in a cyclic group G and find that, if the partition in the algorithm is given by a random oracle
On the Security of Randomized CBCMAC Beyond the Birthday Paradox Limit  A New Construction
 Fast Software Encryption ’02, Lecture Notes in Computer Science
, 2001
"... . In this paper, we study the security of randomized CBC{MACs and propose a new construction that resists birthday paradox attacks and provably reaches full security. The proof is done in a new security model that may be of independent interest to study the security of randomized functions. The size ..."
Abstract

Cited by 32 (1 self)
 Add to MetaCart
. In this paper, we study the security of randomized CBC{MACs and propose a new construction that resists birthday paradox attacks and provably reaches full security. The proof is done in a new security model that may be of independent interest to study the security of randomized functions
applicable to MDx, SHA1, SHA2, and SHA3
"... Generic collision attacks on narrowpipe hash functions faster than birthday paradox, ..."
Abstract
 Add to MetaCart
Generic collision attacks on narrowpipe hash functions faster than birthday paradox,
Results 1  10
of
12,202