Abstract. In 1992, A. Hiltgen [1] provided the first constructions of provably (slightly) secure cryptographic primitives, namely feebly one-way functions. These functions are pro...
We introduce transaction rate limiters, new mechanisms that limit (probabilistically) the maximum number of transactions a user of a peer-to-peer system can do in any given period...
Marcos Kawazoe Aguilera, Mark Lillibridge, Xiaozho...
We study the problem of finding frequent itemsets in a continuous stream of transactions. The current frequency of an itemset in a stream is defined as its maximal frequency ove...
— This paper describes the Open P2P tracing system which aims to improve the research community’s understanding of P2P file sharing systems by providing continuous and up-todat...
Traditionally, product models often have a rigid nature, both with respect to the manner in which they are initially tailored to clients, and to the way they are maintained over t...
Tibor Bosse, Fiemke Both, Mark Hoogendoorn, Jan Tr...