Marina Blanton

TL;DR: The analysis showed that previous studies have utilized inconsistent criteria to define Internet addicts, applied recruiting methods that may cause serious sampling bias, and examined data using primarily exploratory rather than confirmatory data analysis techniques to investigate the degree of association rather than causal relationships among variables.

TL;DR: The security of the scheme is based on pseudorandom functions, without reliance on the Random Oracle Model, and it is shown how to handle extensions proposed by Crampton [2003] of the standard hierarchies to “limited depth” and reverse inheritance.

TL;DR: This study provides an in-depth and comprehensive analysis of internet addiction through a meta-synthesis of qualitative studies on excessive Internet use published during the period of 1996-2006.

TL;DR: This tutorial provides a comprehensive coverage of SMC techniques, starting from precise definitions and fundamental techniques and includes the-state-of-the-art protocols for oblivious transfer (OT) and OT extension in the presence of semi-honest and malicious users.

TL;DR: This work is the first to achieve a worst- and average-case number of bit operations for key derivation that is exponentially better than the depth of a balanced hierarchy (double-exponentially better if the hierarchy is unbalanced); this is achieved with only a constant increase in the space for the hierarchy.