• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1237
  • 167
  • 137
  • 109
  • 83
  • 70
  • 38
  • 38
  • 36
  • 21
  • 18
  • 12
  • 12
  • 12
  • 12
  • Tagged with
  • 2380
  • 641
  • 556
  • 520
  • 508
  • 352
  • 332
  • 308
  • 299
  • 235
  • 234
  • 218
  • 210
  • 199
  • 183
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
541

Oblivion on the Web: an Inquiry of User Needs and Technologies

Novotny, Alexander, Spiekermann, Sarah 04 1900 (has links) (PDF)
Unlimited retention of personal information on the web may harm individuals: employers can find youthful indiscretions on social media, and incorrectly low credit scores may haunt individuals for a lifetime. Currently, Europe revives the "right to erasure" as a first step towards a forgetting web. Early technologies implementing oblivion suffer from vulnerabilities and narrowly assume that users require information to be erased after a pre-determined time. But little is known about users' actual oblivion needs. A first study shows that users desire control over disclosed personal information to reduce pre-disclosure privacy concerns, and to delete harmful information after disclosure. In the long run, users have a need for dissociating from obsolete information that represents their past identity. A second study analyses whether oblivion-enhancing technologies (OETs) currently deployed in online services satisfy users' needs. While not all services give users assurance that disclosed information can be erased again, most provide users with some active control. But to manage the increasing volume of personal information stored, users would also require "intelligent" support with oblivion. Intelligent agents that keep track of disclosed information long-term could automatically safeguard users from information relating to a past episode in life surfacing unexpectedly. (authors' abstract)
542

On Achieving Secure Message Authentication for Vehicular Communications

Zhang, Chenxi January 2010 (has links)
Vehicular Ad-hoc Networks (VANETs) have emerged as a new application scenario that is envisioned to revolutionize the human driving experiences, optimize traffic flow control systems, etc. Addressing security and privacy issues as the prerequisite of VANETs' development must be emphasized. To avoid any possible malicious attack and resource abuse, employing a digital signature scheme is widely recognized as the most effective approach for VANETs to achieve authentication, integrity, and validity. However, when the number of signatures received by a vehicle becomes large, a scalability problem emerges immediately, where a vehicle could be difficult to sequentially verify each received signature within 100-300 ms interval in accordance with the current Dedicated Short Range Communications (DSRC) protocol. In addition, there are still some unsolved attacks in VANETs such as Denial of Service (Dos) attacks, which are not well addressed and waiting for us to solve. In this thesis, we propose the following solutions to address the above mentioned security related issues. First of all, to address the scalability issues, we introduce a novel roadside unit (RSU) aided message authentication scheme, named RAISE, which makes RSUs responsible for verifying the authenticity of messages sent from vehicles and for notifying the results back to vehicles. In addition, RAISE adopts the k-anonymity property for preserving user privacy, where a message cannot be associated with a common vehicle. Secondly, we further consider the situation that RSUs may not cover all the busy streets of a city or a highway in some situations, for example, at the beginning of a VANETs' deployment period, or due to the physical damage of some RSUs, or simply for economic considerations. Under these circumstances, we further propose an efficient identity-based batch signature verification scheme for vehicular communications. The proposed scheme can make vehicles verify a batch of signatures once instead of one after another, and thus it efficiently increases vehicles' message verification speed. In addition, our scheme achieves conditional privacy: a distinct pseudo identity is generated along with each message, and a trust authority can trace a vehicle's real identity from its pseudo identity. In order to find invalid signatures in a batch of signatures, we adopt group testing technique which can find invalid signatures efficiently. Lastly, we identify a DoS attack, called signature jamming attack (SJA), which could easily happen and possibly cause a profound vicious impact on the normal operations of a VANET, yet has not been well addressed in the literature. The SJA can be simply launched at an attacker by flooding a significant number of messages with invalid signatures that jam the surrounding vehicles and prevent them from timely verifying regular and legitimate messages. To countermeasure the SJA, we introduces a hash-based puzzle scheme, which serves as a light-weight filter for excluding likely false signatures before they go through relatively lengthy signature verification process. To further minimize the vicious effect of SJA, we introduce a hash recommendation mechanism, which enables vehicles to share their information so as to more efficiently thwart the SJA. For each research solution, detailed analysis in terms of computational time, and transmission overhead, privacy preservation are performed to validate the efficiency and effectiveness of the proposed schemes.
543

Privacy and the internet : differences in perspectives

Janz, Linda, University of Lethbridge. Faculty of Arts and Science January 1997 (has links)
This study examined results of a World Wide Web survey that used the framework of domain theory of moral development to examine attitudes of Internet users assuming perspectives of victims, aggressors and bystanders toward privacy issues. The effect of a monetary incentive was tested on two perspectives; effects of three moderating variables, employment status, newsgroup/mailing list membership and culture, were also tested. In the process of examing interactions, an evaluation determined if changes in attitudes indicated movement along a morality continuum. Results show that victims are more concerned than aggressors, and bystanders take a moralizing stance regardless of domain. Results of the monetary incentive test suggest that privacy is for sale. Employed respondents are more concerned than non-employed respondents; membership has little effect. Effects of culture do not support the hypotheses. Implications are that moral judgements are a function of perspective and domain, allowing flexibility along a morality continuum due to situational deviations. / xii, 112 leaves ; 28 cm.
544

Security Issues in Heterogeneous Data Federations

Leighton, Gregory Unknown Date
No description available.
545

The social significance of home networking : public surveillance and social management

Wilson, Kevin G., 1952- January 1985 (has links)
This thesis analyzes the social significance of the integration of the home into computer networks. The social significance of home networking is grasped when these systems are understood in their relationship to emerging forms of electronic social control. The thesis establishes this connection through an analysis of structural trends in the videotex industry which demonstrates the value to the corporate sector of cybernetic information generated by interactive systems. The North American tradition of privacy policy is reviewed and demonstrated as inadequate for the protection of personal privacy in home networking. It is further shown that privacy policy does not represent an adequate theorization of social control in computer networking, since it does not account for practices of aggregate social control, which have been termed in the thesis "social management," so vital to the cybernetic economy of late capitalism. Finally, the thesis argues that current conceptual frameworks and policy mechanisms cannot assure the socially beneficial development of home networking, given the tendency towards the integration of such systems into structures of social control.
546

Watching workers: a critical review of the law regarding electronic employee monitoring in non-unionized workplaces in Canada

Bueckert, Melanie R. 15 September 2008 (has links)
This thesis addresses the topic of electronic employee monitoring in non-unionized workplaces in Canada. Electronic employee monitoring is defined as including (1) the use of electronic devices to review and evaluate employees’ performance; (2) ‘electronic surveillance’; and (3) employers’ use of computer forensics. Detailed consideration is given to a variety of technologies, including computer, internet and e-mail monitoring, location awareness technologies (such as global positioning systems and radio frequency identification), as well as biometrics, and the developing case law surrounding these innovations. Analogies are drawn to the jurisprudence developing with respect to unionized workplaces and under statutory unjust dismissal regimes. This analysis leads to the conclusion that legislative reform is necessary, either through (1) the creation of parallel private sector privacy regimes, such as those in British Columbia and Alberta, mirroring existing federal legislation; (2) amendments to existing employment standards legislation; or (3) the enactment of a stand-alone surveillance statute.
547

THE MISMANGEMENT OF MARITAL DISCLOSURES IN THE REAL HOUSEWIVES OF BEVERLY HILLS

Campbell, Randi Cariella 01 January 2012 (has links)
Reality television is unique from other television programming because its format is less scripted than typical entertainment television programs, but not as candid as documentary style shows. Aspects of cast members’ private lives are publicly aired as “real.” The consequences for airing one’s private life in the public sphere are unclear. This may be especially important to study when the private disclosures reveal activities that may be unethical, immoral, illegal, or abusive. Petronio’s (date) communication privacy management theory was used to examine the martial disclosures that occurred between Taylor and Russell Armstrong, cast members of the reality television show The Real Housewives of Beverly Hills. Two seasons of the show were analyzed and coded according to the five suppositions of CPM. Results revealed several aspects of Walker’s cycle of violence theory being played out in the public sphere without consequence. Additionally, co-ownership of information appeared to constitute a license to gossip freely about private disclosures shared in confidence between certain individuals with any and all other cast members.
548

Audit Games

Sinha, Arunesh 01 July 2014 (has links)
Modern organizations (e.g., hospitals, banks, social networks, search engines) hold large volumes of personal information, and rely heavily on auditing for enforcement of privacy policies. These audit mechanisms combine automated methods with human input to detect and punish violators. Since human audit resources are limited, and often not sufficient to investigate all potential violations, current state-of-the -art audit tools provide heuristics to guide human effort. However, numerous reports of privacy breaches caused by malicious insiders bring to question the effectiveness of these audit mechanisms. Our thesis is that effective audit resource allocation and punishment levels can be efficiently computed by modeling the audit process as a game between a rational auditor and a rational or worst-case auditee. We present several results in support of the thesis. In the worst-case adversary setting, we design a game model taking into account organizational cost of auditing and loss from violations. We propose the notion of low regret as a desired audit property and provide a regret minimizing audit algorithm that outputs an optimal audit resource allocation strategy. The algorithm improves upon prior regret bounds in the partial information setting. In the rational adversary setting, we enable punishments by the auditor, and model the adversary's utility as a trade-off between the benefit from violations and loss due to punishment when detected. Our Stackelberg game model generalizes an existing deployed security game model with punishment parameters. It applies to natural auditing settings with multiple auditors where each auditor is restricted to audit a subset of the potential violations. We provide novel polynomial time algorithms to approximate the non-convex optimization problem used to compute the Stackelberg equilibrium. The algorithms output optimal audit resource allocation strategy and punishment levels. We also provide a method to reduce the optimization problem size, achieving up to 5x speedup for realistic instances of the audit problem, and for the related security game instances.
549

Empowering bystanders to facilitate Internet censorship measurement and circumvention

Burnett, Samuel Read 27 August 2014 (has links)
Free and open exchange of information on the Internet is at risk: more than 60 countries practice some form of Internet censorship, and both the number of countries practicing censorship and the proportion of Internet users who are subject to it are on the rise. Understanding and mitigating these threats to Internet freedom is a continuous technological arms race with many of the most influential governments and corporations. By its very nature, Internet censorship varies drastically from region to region, which has impeded nearly all efforts to observe and fight it on a global scale. Researchers and developers in one country may find it very difficult to study censorship in another; this is particularly true for those in North America and Europe attempting to study notoriously pervasive censorship in Asia and the Middle East. This dissertation develops techniques and systems that empower users in one country, or bystanders, to assist in the measurement and circumvention of Internet censorship in another. Our work builds from the observation that there are people everywhere who are willing to help us if only they knew how. First, we develop Encore, which allows webmasters to help study Web censorship by collecting measurements from their sites' visitors. Encore leverages weaknesses in cross-origin security policy to collect measurements from a far more diverse set of vantage points than previously possible. Second, we build Collage, a technique that uses the pervasiveness and scalability of user-generated content to disseminate censored content. Collage's novel communication model is robust against censorship that is significantly more powerful than governments use today. Together, Encore and Collage help people everywhere study and circumvent Internet censorship.
550

The Collaborative Self: From Collectivity to Individuality and What Blogs Can Teach Us About Identity

Hagenah, Nathan January 2013 (has links)
This paper uses blogs as a starting point for an examination of how identity is constructed collaboratively through a series of linguistically mediated social processes. The goal is to establish a theoretical framework for understanding individual identity as rooted in media, language, and society and the result of collective social processes as opposed to their genesis. It draws together conceptual models from theorists in sociology, media studies, and genre theory to explore how selves are created in the online contexts of blogs and how those concepts relate to wider cultural concerns and anxieties related to the construction of individual identity. By examining issues of privacy, anonymity, and authenticity as they relate to blogs and bloggers, this paper aims to provide a view of individual identity as contextually situated yet continuous across social contexts and which is the result of collaborative, collective social processes.

Page generated in 0.0564 seconds