Sciweavers

6251 search results - page 1056 / 1251
» Randomness, Computability, and Density
Sort
View
PET
2007
Springer
15 years 10 months ago
Anonymity in the Wild: Mixes on Unstructured Networks
Abstract. As decentralized computing scenarios get ever more popular, unstructured topologies are natural candidates to consider running mix networks upon. We consider mix network ...
Shishir Nagaraja
SACRYPT
2007
Springer
126views Cryptology» more  SACRYPT 2007»
15 years 10 months ago
Improved Side-Channel Collision Attacks on AES
Abstract. Side-channel collision attacks were proposed in [1] and applied to AES in [2]. These are based on detecting collisions in certain positions of the internal state after th...
Andrey Bogdanov
VLDB
2007
ACM
119views Database» more  VLDB 2007»
15 years 10 months ago
Integrity Auditing of Outsourced Data
An increasing number of enterprises outsource their IT services to third parties who can offer these services for a much lower cost due to economy of scale. Quality of service is ...
Min Xie, Haixun Wang, Jian Yin, Xiaofeng Meng
WAW
2007
Springer
120views Algorithms» more  WAW 2007»
15 years 10 months ago
Manipulation-Resistant Reputations Using Hitting Time
Popular reputation systems for linked networks can be manipulated by spammers who strategically place links. The reputation of node v is interpreted as the world’s opinion of vâ...
John E. Hopcroft, Daniel Sheldon
WDAG
2007
Springer
79views Algorithms» more  WDAG 2007»
15 years 10 months ago
A Simple Population Protocol for Fast Robust Approximate Majority
We describe and analyze a 3-state one-way population protocol to compute approximate majority in the model in which pairs of agents are drawn uniformly at random to interact. Given...
Dana Angluin, James Aspnes, David Eisenstat
« Prev « First page 1056 / 1251 Last » Next »