Matching Items (177)
150382-Thumbnail Image.png
Description
This thesis proposed a novel approach to establish the trust model in a social network scenario based on users' emails. Email is one of the most important social connections nowadays. By analyzing email exchange activities among users, a social network trust model can be established to judge the trust rate

This thesis proposed a novel approach to establish the trust model in a social network scenario based on users' emails. Email is one of the most important social connections nowadays. By analyzing email exchange activities among users, a social network trust model can be established to judge the trust rate between each two users. The whole trust checking process is divided into two steps: local checking and remote checking. Local checking directly contacts the email server to calculate the trust rate based on user's own email communication history. Remote checking is a distributed computing process to get help from user's social network friends and built the trust rate together. The email-based trust model is built upon a cloud computing framework called MobiCloud. Inside MobiCloud, each user occupies a virtual machine which can directly communicate with others. Based on this feature, the distributed trust model is implemented as a combination of local analysis and remote analysis in the cloud. Experiment results show that the trust evaluation model can give accurate trust rate even in a small scale social network which does not have lots of social connections. With this trust model, the security in both social network services and email communication could be improved.
ContributorsZhong, Yunji (Author) / Huang, Dijiang (Thesis advisor) / Dasgupta, Partha (Committee member) / Syrotiuk, Violet (Committee member) / Arizona State University (Publisher)
Created2011
150385-Thumbnail Image.png
Description
In nearly all commercially successful internal combustion engine applications, the slider crank mechanism is used to convert the reciprocating motion of the piston into rotary motion. The hypocycloid mechanism, wherein the crankshaft is replaced with a novel gearing arrangement, is a viable alternative to the slider crank mechanism. The geared

In nearly all commercially successful internal combustion engine applications, the slider crank mechanism is used to convert the reciprocating motion of the piston into rotary motion. The hypocycloid mechanism, wherein the crankshaft is replaced with a novel gearing arrangement, is a viable alternative to the slider crank mechanism. The geared hypocycloid mechanism allows for linear motion of the connecting rod and provides a method for perfect balance with any number of cylinders including single cylinder applications. A variety of hypocycloid engine designs and research efforts have been undertaken and produced successful running prototypes. Wiseman Technologies, Inc provided one of these prototypes to this research effort. This two-cycle 30cc half crank hypocycloid engine has shown promise in several performance categories including balance and efficiency. To further investigate its potential a more thorough and scientific analysis was necessary and completed in this research effort. The major objective of the research effort was to critically evaluate and optimize the Wiseman prototype for maximum performance in balance, efficiency, and power output. A nearly identical slider crank engine was used extensively to establish baseline performance data and make comparisons. Specialized equipment and methods were designed and built to collect experimental data on both engines. Simulation and mathematical models validated by experimental data collection were used to better quantify performance improvements. Modifications to the Wiseman prototype engine improved balance by 20 to 50% (depending on direction) and increased peak power output by 24%.
ContributorsConner, Thomas (Author) / Redkar, Sangram (Thesis advisor) / Rogers, Bradley (Committee member) / Georgeou, Trian (Committee member) / Arizona State University (Publisher)
Created2011
Description

This thesis worked towards the development of a parameterized 3D model off a cover that could go over any specific prosthesis depending on the parameters that had been entered. It also focused on gathering user inputs, which was done with the aid of the Amputee Coalition, that could be used

This thesis worked towards the development of a parameterized 3D model off a cover that could go over any specific prosthesis depending on the parameters that had been entered. It also focused on gathering user inputs, which was done with the aid of the Amputee Coalition, that could be used to create an aesthetic design on this cover. The Amputee Coalition helped to recruit participants through its website and social media platforms. Finally, multiple methods of creating a design were developed to increase the amount of customization that a user could have for their cover.

ContributorsRiley, Nicholas (Co-author) / Fusaro, Gerard (Co-author) / Sugar, Thomas (Thesis director) / Redkar, Sangram (Committee member) / Engineering Programs (Contributor) / Barrett, The Honors College (Contributor)
Created2021-05
Description

This thesis worked towards the development of a parameterized 3D model off a cover that could go over any specific prosthesis depending on the parameters that had been entered. It also focused on gathering user inputs, which was done with the aid of the Amputee Coalition, that could be used

This thesis worked towards the development of a parameterized 3D model off a cover that could go over any specific prosthesis depending on the parameters that had been entered. It also focused on gathering user inputs, which was done with the aid of the Amputee Coalition, that could be used to create an aesthetic design on this cover. The Amputee Coalition helped to recruit participants through its website and social media platforms. Finally, multiple methods of creating a design were developed to increase the amount of customization that a user could have for their cover.

ContributorsFusaro, Gerard Anthony (Co-author) / Riley, Nicholas (Co-author) / Sugar, Thomas (Thesis director) / Redkar, Sangram (Committee member) / College of Integrative Sciences and Arts (Contributor) / Engineering Programs (Contributor, Contributor) / Barrett, The Honors College (Contributor)
Created2021-05
149803-Thumbnail Image.png
Description
With the advent of technologies such as web services, service oriented architecture and cloud computing, modern organizations have to deal with policies such as Firewall policies to secure the networks, XACML (eXtensible Access Control Markup Language) policies for controlling the access to critical information as well as resources. Management of

With the advent of technologies such as web services, service oriented architecture and cloud computing, modern organizations have to deal with policies such as Firewall policies to secure the networks, XACML (eXtensible Access Control Markup Language) policies for controlling the access to critical information as well as resources. Management of these policies is an extremely important task in order to avoid unintended security leakages via illegal accesses, while maintaining proper access to services for legitimate users. Managing and maintaining access control policies manually over long period of time is an error prone task due to their inherent complex nature. Existing tools and mechanisms for policy management use different approaches for different types of policies. This research thesis represents a generic framework to provide an unified approach for policy analysis and management of different types of policies. Generic approach captures the common semantics and structure of different access control policies with the notion of policy ontology. Policy ontology representation is then utilized for effectively analyzing and managing the policies. This thesis also discusses a proof-of-concept implementation of the proposed generic framework and demonstrates how efficiently this unified approach can be used for analysis and management of different types of access control policies.
ContributorsKulkarni, Ketan (Author) / Ahn, Gail-Joon (Thesis advisor) / Yau, Stephen S. (Committee member) / Huang, Dijiang (Committee member) / Arizona State University (Publisher)
Created2011
149851-Thumbnail Image.png
Description
This research describes software based remote attestation schemes for obtaining the integrity of an executing user application and the Operating System (OS) text section of an untrusted client platform. A trusted external entity issues a challenge to the client platform. The challenge is executable code which the client must execute,

This research describes software based remote attestation schemes for obtaining the integrity of an executing user application and the Operating System (OS) text section of an untrusted client platform. A trusted external entity issues a challenge to the client platform. The challenge is executable code which the client must execute, and the code generates results which are sent to the external entity. These results provide the external entity an assurance as to whether the client application and the OS are in pristine condition. This work also presents a technique where it can be verified that the application which was attested, did not get replaced by a different application after completion of the attestation. The implementation of these three techniques was achieved entirely in software and is backward compatible with legacy machines on the Intel x86 architecture. This research also presents two approaches to incorporating software based "root of trust" using Virtual Machine Monitors (VMMs). The first approach determines the integrity of an executing Guest OS from the Host OS using Linux Kernel-based Virtual Machine (KVM) and qemu emulation software. The second approach implements a small VMM called MIvmm that can be utilized as a trusted codebase to build security applications such as those implemented in this research. MIvmm was conceptualized and implemented without using any existing codebase; its minimal size allows it to be trustworthy. Both the VMM approaches leverage processor support for virtualization in the Intel x86 architecture.
ContributorsSrinivasan, Raghunathan (Author) / Dasgupta, Partha (Thesis advisor) / Colbourn, Charles (Committee member) / Shrivastava, Aviral (Committee member) / Huang, Dijiang (Committee member) / Dewan, Prashant (Committee member) / Arizona State University (Publisher)
Created2011
149858-Thumbnail Image.png
Description
This dissertation is focused on building scalable Attribute Based Security Systems (ABSS), including efficient and privacy-preserving attribute based encryption schemes and applications to group communications and cloud computing. First of all, a Constant Ciphertext Policy Attribute Based Encryption (CCP-ABE) is proposed. Existing Attribute Based Encryption (ABE) schemes usually incur large,

This dissertation is focused on building scalable Attribute Based Security Systems (ABSS), including efficient and privacy-preserving attribute based encryption schemes and applications to group communications and cloud computing. First of all, a Constant Ciphertext Policy Attribute Based Encryption (CCP-ABE) is proposed. Existing Attribute Based Encryption (ABE) schemes usually incur large, linearly increasing ciphertext. The proposed CCP-ABE dramatically reduces the ciphertext to small, constant size. This is the first existing ABE scheme that achieves constant ciphertext size. Also, the proposed CCP-ABE scheme is fully collusion-resistant such that users can not combine their attributes to elevate their decryption capacity. Next step, efficient ABE schemes are applied to construct optimal group communication schemes and broadcast encryption schemes. An attribute based Optimal Group Key (OGK) management scheme that attains communication-storage optimality without collusion vulnerability is presented. Then, a novel broadcast encryption model: Attribute Based Broadcast Encryption (ABBE) is introduced, which exploits the many-to-many nature of attributes to dramatically reduce the storage complexity from linear to logarithm and enable expressive attribute based access policies. The privacy issues are also considered and addressed in ABSS. Firstly, a hidden policy based ABE schemes is proposed to protect receivers' privacy by hiding the access policy. Secondly,a new concept: Gradual Identity Exposure (GIE) is introduced to address the restrictions of hidden policy based ABE schemes. GIE's approach is to reveal the receivers' information gradually by allowing ciphertext recipients to decrypt the message using their possessed attributes one-by-one. If the receiver does not possess one attribute in this procedure, the rest of attributes are still hidden. Compared to hidden-policy based solutions, GIE provides significant performance improvement in terms of reducing both computation and communication overhead. Last but not least, ABSS are incorporated into the mobile cloud computing scenarios. In the proposed secure mobile cloud data management framework, the light weight mobile devices can securely outsource expensive ABE operations and data storage to untrusted cloud service providers. The reported scheme includes two components: (1) a Cloud-Assisted Attribute-Based Encryption/Decryption (CA-ABE) scheme and (2) An Attribute-Based Data Storage (ABDS) scheme that achieves information theoretical optimality.
ContributorsZhou, Zhibin (Author) / Huang, Dijiang (Thesis advisor) / Yau, Sik-Sang (Committee member) / Ahn, Gail-Joon (Committee member) / Reisslein, Martin (Committee member) / Arizona State University (Publisher)
Created2011
150093-Thumbnail Image.png
Description
Action language C+ is a formalism for describing properties of actions, which is based on nonmonotonic causal logic. The definite fragment of C+ is implemented in the Causal Calculator (CCalc), which is based on the reduction of nonmonotonic causal logic to propositional logic. This thesis describes the language

Action language C+ is a formalism for describing properties of actions, which is based on nonmonotonic causal logic. The definite fragment of C+ is implemented in the Causal Calculator (CCalc), which is based on the reduction of nonmonotonic causal logic to propositional logic. This thesis describes the language of CCalc in terms of answer set programming (ASP), based on the translation of nonmonotonic causal logic to formulas under the stable model semantics. I designed a standard library which describes the constructs of the input language of CCalc in terms of ASP, allowing a simple modular method to represent CCalc input programs in the language of ASP. Using the combination of system F2LP and answer set solvers, this method achieves functionality close to that of CCalc while taking advantage of answer set solvers to yield efficient computation that is orders of magnitude faster than CCalc for many benchmark examples. In support of this, I created an automated translation system Cplus2ASP that implements the translation and encoding method and automatically invokes the necessary software to solve the translated input programs.
ContributorsCasolary, Michael (Author) / Lee, Joohyung (Thesis advisor) / Ahn, Gail-Joon (Committee member) / Baral, Chitta (Committee member) / Arizona State University (Publisher)
Created2011
150148-Thumbnail Image.png
Description
In order to catch the smartest criminals in the world, digital forensics examiners need a means of collaborating and sharing information with each other and outside experts that is not prohibitively difficult. However, standard operating procedures and the rules of evidence generally disallow the use of the collaboration software and

In order to catch the smartest criminals in the world, digital forensics examiners need a means of collaborating and sharing information with each other and outside experts that is not prohibitively difficult. However, standard operating procedures and the rules of evidence generally disallow the use of the collaboration software and techniques that are currently available because they do not fully adhere to the dictated procedures for the handling, analysis, and disclosure of items relating to cases. The aim of this work is to conceive and design a framework that provides a completely new architecture that 1) can perform fundamental functions that are common and necessary to forensic analyses, and 2) is structured such that it is possible to include collaboration-facilitating components without changing the way users interact with the system sans collaboration. This framework is called the Collaborative Forensic Framework (CUFF). CUFF is constructed from four main components: Cuff Link, Storage, Web Interface, and Analysis Block. With the Cuff Link acting as a mediator between components, CUFF is flexible in both the method of deployment and the technologies used in implementation. The details of a realization of CUFF are given, which uses a combination of Java, the Google Web Toolkit, Django with Apache for a RESTful web service, and an Ubuntu Enterprise Cloud using Eucalyptus. The functionality of CUFF's components is demonstrated by the integration of an acquisition script designed for Android OS-based mobile devices that use the YAFFS2 file system. While this work has obvious application to examination labs which work under the mandate of judicial or investigative bodies, security officers at any organization would benefit from the improved ability to cooperate in electronic discovery efforts and internal investigations.
ContributorsMabey, Michael Kent (Author) / Ahn, Gail-Joon (Thesis advisor) / Yau, Stephen S. (Committee member) / Huang, Dijiang (Committee member) / Arizona State University (Publisher)
Created2011
150105-Thumbnail Image.png
Description
The objective of this work is to develop a Stop-Rotor Multimode UAV. This UAV is capable of vertical take-off and landing like a helicopter and can convert from a helicopter mode to an airplane mode in mid-flight. Thus, this UAV can hover as a helicopter and achieve high mission range

The objective of this work is to develop a Stop-Rotor Multimode UAV. This UAV is capable of vertical take-off and landing like a helicopter and can convert from a helicopter mode to an airplane mode in mid-flight. Thus, this UAV can hover as a helicopter and achieve high mission range of an airplane. The stop-rotor concept implies that in mid-flight the lift generating helicopter rotor stops and rotates the blades into airplane wings. The thrust in airplane mode is then provided by a pusher propeller. The aircraft configuration presents unique challenges in flight dynamics, modeling and control. In this thesis a mathematical model along with the design and simulations of a hover control will be presented. In addition, the discussion of the performance in fixed-wing flight, and the autopilot architecture of the UAV will be presented. Also presented, are some experimental "conversion" results where the Stop-Rotor aircraft was dropped from a hot air balloon and performed a successful conversion from helicopter to airplane mode.
ContributorsVargas-Clara, Alvaro (Author) / Redkar, Sangram (Thesis advisor) / Macia, Narciso (Committee member) / Rajadas, John (Committee member) / Arizona State University (Publisher)
Created2011