Дисертації з теми "Obfuscations"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 дисертацій для дослідження на тему "Obfuscations".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
Homoliak, Ivan. "Detekce Útoků v Síťovém Provozu." Doctoral thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2016. http://www.nusl.cz/ntk/nusl-261231.
Повний текст джерелаBatchelder, Michael Robert. "Java bytecode obfuscation." Thesis, McGill University, 2007. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=18300.
Повний текст джерелаLes programmes écrits pour l'exécution d'ordinateur seront toujours susceptibles au vol d'information. Cette information peut inclure des algorithmes de marque de commerce, des données incluses dans le programme, ou même des données concernant les accès de programme. Suivant les avancées technologiques, les informaticiens construisent des outils de plus en plus puissants pour l'ingénierie inverse telle que le décompilateur. Le langage de programmation de Java est particulièrement ouvert aux attaques de l'ingénierie inverse en raison de son format binaire bien défini, ouvert, et portatif. Nous recherches portent sur un domaine permettant de mieux sécuriser fixer la propriété intellectuelle des programmes en Java; obscurcissement. L'obscurcissement d'un programme implique de transformer le code du programme en une représentation plus complexe mais sémantiquement équivalente. Ceci peut inclure l'addition de l'écoulement embrouillant de commande, de la supression de certaines informations incluses dans les programmes dont l'exécution n'est pas spécifiquement exigée, ou de la dissimulation des données. Excepté les techniques cryptologique s, l'obscurcissement est l'une des seules techniques disponibles. Même si beaucoup de stratégies de l'obscurissment sont finalement réversibles, il gêne sérieusement ceux qui essayent de voler l'information en augmentant la durée de calcul et la puissance exigées par les logicels d'ingénierie inverse et augmente considérablement la complexité de n'importe quel code source récupere par cette technique. Dans cette thèse nous présentons un certain nombre de transformations d'obscurcissement mises en application dans un outil automatique que nous appelons le Java Bytecode Obfuscator (JBCO). Nous présentons des mesures empiriques des coûts d'exécution de ces transformations en termes de vitesse d'exécution et taille de programme. Des mesures de complexité qui mesurent l'efficacité des obscurc
ARVIDSSON, OSKAR. "Platform Independent Code Obfuscation." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-146986.
Повний текст джерелаKodobfuskering är ett verktyg för att göra mjukvara svårare att läsa, förstå och bakåtkompilera. Det an- vänds inom industrin för att skydda proprietära algo- ritmer samt för att skydda program och tjänster från att missbrukas. De lösningar som finns att tillgå idag är dock ofta beroende av en eller flera specifika platt- formar. I den här rapporten undersöker vi möjlighe- ten att göra plattformsoberoende obfuskering. Resul- tatet är en undersökning av vilka obfuskeringsmeto- der som finns tillgängliga, samt en djupare studie av några av dessa. Den djupare studien ger, för var och en av de studerade metoderna, insikter om hur svåra de är att deobfuskera för hand, hur svåra de är att deobfuskera automatiskt, hur pass svårt det är att skilja den obfuskerade koden från den oobfuskerade, samt hur lätt det är att implementera och integrera dem i en kompileringskedja.
ARVIDSSON, OSKAR. "Platform Independent Code Obfuscation." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-142031.
Повний текст джерелаVaria, Mayank (Mayank Harshad). "Studies in program obfuscation." Thesis, Massachusetts Institute of Technology, 2010. http://hdl.handle.net/1721.1/64489.
Повний текст джерелаThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student submitted PDF version of thesis.
Includes bibliographical references (p. 159-164).
Program obfuscation is the software analog to the problem of tamper-proofing hardware. The goal of program obfuscation is to construct a compiler, called an "obfuscator," that garbles the code of a computer program while maintaining its functionality. Commercial products exist to perform this procedure, but they do not provide a rigorous security guarantee. Over the past decade, program obfuscation has been studied by the theoretical cryptography community, where rigorous definitions of security have been proposed and obfuscators have been constructed for some families of programs. This thesis presents three contributions based on the virtual black-box security definition of Barak et al [10]. First, we show tight connections between obfuscation and symmetric-key encryption. Specifically, obfuscation can be used to construct an encryption scheme with strong leakage resilience and key-dependent message security. The converse is also true, and these connections scale with the level of security desired. As a result, the known constructions and impossibility results for each primitive carry over to the other. Second, we present two new security definitions that augment the virtual black-box property to incorporate non-malleability. The virtual black-box definition does not prevent an adversary from modifying an obfuscated program intelligently. By contrast, our new definitions provide software with the same security guarantees as tamper-proof and tamper-evident hardware, respectively. The first definition prohibits tampering, and the second definition requires that tampering is detectable after the fact. We construct non-malleable obfuscators of both favors for some program families of interest. Third, we present an obfuscator for programs that test for membership in a hyperplane. This generalizes prior works that obfuscate equality testing. We prove the security of the obfuscator under a new strong variant of the Decisional Diffie-Hellman assumption that holds in the generic group model. Additionally, we show a cryptographic application of the new obfuscator to leak-ageresilient one-time digital signatures. The thesis also includes a survey of the prior results in the field.
by Mayank Varia.
Ph.D.
KUMAR, AMIT. "CONTROL FLOW OBFUSCATION COMPLEXITY." University of Cincinnati / OhioLINK, 2005. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1116221965.
Повний текст джерелаDuchene, Julien. "Développement et évaluation d'obfuscations de protocoles basées sur la spécification." Electronic Thesis or Diss., Toulouse, INSA, 2018. http://www.theses.fr/2018ISAT0054.
Повний текст джерелаThere are more and more protocols. Many of them have their specification available for interoperability purpose for instance. However, when it comes to intellectual property, this specification is kept secret. Attackers might use a wrongly implemented protocol to compromise a system, if he has access to the specification, it’s attack would be far more efficient. Even if he does not have access to the specification, he can reverse-engine it. Thus, create protocols hard to reverse is interesting. In this thesis, we develop a novel approach of protocol protections to make protocol reverse engineering more complex. We apply some obfuscations on protocol message format, furthermore, we do it automatically from the original protocol specification. Firstly, we have analyzed more than 30 different contributions of protocol reverse engineering tools. We retrieved the following elements : 1) Protocol reverse engineering tools try to infer regular models ; 2) They suppose that the parsing is done from left to right ; 3) They delimit fields based on well-known delimiters or with ad-hoc techniques ; 4) They cluster messages based on pattern similarity measures. Thus, to make protocol reverse harder, one can create protocols which does not respect theses statements. Secondly, we have proposed a model of message format on which obfuscations can be applied. With this model, we also provide some atomic obfuscations which can be composed. Each obfuscation target one or more protocol reverse engineering hypothesis. Obfuscation composition ensures effectiveness of our solution and makes protocol reverse-engineering more complex. This model is used to automatically generate code for parser, serializer and accessors. This solution is implemented into a framework we called ProtoObf. ProtoObf is used to evaluate obfuscations performance. Results show an increase of protocol complexity with the number of obfuscation composition while costs (particularly the serialized buffer size) stay low
Chakraborty, Rajat Subhra. "Hardware Security through Design Obfuscation." Cleveland, Ohio : Case Western Reserve University, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=case1270133481.
Повний текст джерелаDepartment of EECS - Computer Engineering Title from PDF (viewed on 2010-05-25) Includes abstract Includes bibliographical references and appendices Available online via the OhioLINK ETD Center
Drape, Stephen. "Obfuscation of abstract data-types." Thesis, University of Oxford, 2004. http://ora.ox.ac.uk/objects/uuid:fa574ce9-4ed2-41f5-86d8-78113828b9ab.
Повний текст джерелаSethi, Amit. "Digital Rights Management and Code Obfuscation." Thesis, University of Waterloo, 2004. http://hdl.handle.net/10012/1012.
Повний текст джерелаMohsen, Rabih. "Quantitative measures for code obfuscation security." Thesis, Imperial College London, 2016. http://hdl.handle.net/10044/1/55180.
Повний текст джерелаHolmgren, Justin Lee. "Succinct garbled RAM from indistinguishablity obfuscation." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/100600.
Повний текст джерелаThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 83-86).
In this thesis, I give the first construction of a succinct garbling scheme for RAM programs. For a program requiring space S and time T to compute, the size of its garbling is Õ(S) instead of poly(T). This construction relies on the existence of indistinguishability obfuscation, as well as the existence of injective one-way functions. As a building block, I introduce and construct a primitive called asymmetrically constrained encryption (ACE). This primitive is an encryption system for which keys can be punctured on succinctly described sets of plaintexts. For programs acting on ACE-encrypted values, I give a natural and general condition for their obfuscations to be indistinguishable, using the fact that the encryption and decryption keys can be separately punctured. This succinct garbling scheme serves as a drop-in replacement for the ubiquitous garbled circuits of Yao, but with better asymptotic parameters. In some cases, these improved parameters allow qualitatively new applications.
by Justin Lee Holmgren.
M. Eng.
Lombardi, Alex (Alex John). "Low complexity pseudorandom generators and indistinguishability obfuscation." Thesis, Massachusetts Institute of Technology, 2018. http://hdl.handle.net/1721.1/118056.
Повний текст джерелаCataloged from PDF version of thesis.
Includes bibliographical references (pages 61-64).
In the study of cryptography in NCO, it was previously known that Goldreich's candidate pseudorandom generator (PRG) is insecure when instantiated with a predicate P in 4 or fewer variables, if one wants to achieve polynomial stretch. On the other hand, there is a standard candidate PRG with locality 5 based on the "tri-sum-and" predicate ... However, locality is only one complexity measure of a PRG that one could hope to minimize. In this work, we consider the problem of minimizing three other complexity measures of a (local) PRG: decision tree (DT-)complexity, Q-degree (i.e., the degree of P as a polynomial over Q), and the recent notion of blockwise locality (due to Lin and Tessaro). These three complexity measures are all of interest for their possible applications to constructing indistinguishability obfuscation (IO) schemes based on low-degree multilinear maps. Indeed, Lin and Tessaro recently proposed an intriguing candidate IO scheme based on bilinear maps and a non-standard assumption on "Goldreich-like" pseudorandom generators. We obtain both positive and negative results on the existence of low complexity PRGs. First, we give a candidate predicate for Goldreich's PRG with DT-complexity 4 and Q-degree 3. We also show that all predicates with either DT-complexity less than 4 or Q-degree less than 3 yield insecure PRGs, so our candidate predicate simultaneously achieves the best possible locality, DT-complexity, Q-degree, and F2-degree according to all known attacks. Finally, we show polynomial-time attacks on the blockwise 2-local PRGs required in the Lin-Tessaro work, invalidating the security of their IO and FE candidates based on bilinear maps. Our attack uses tools from the literature on two-source extractors (Chor and Goldreich, SICOMP 1988) and efficient refutation of random 2-XOR instances (Charikar and Wirth, FOCS 2004).
by Alex Lombardi.
S.M. in Computer Science and Engineering
Shruti, Banda. "Complexity and obfuscation in evolving platform pricing." Thesis, Massachusetts Institute of Technology, 2017. http://hdl.handle.net/1721.1/118561.
Повний текст джерелаCataloged from PDF version of thesis.
Includes bibliographical references (pages 62-65).
Two-sided platforms include some of the largest and fastest-growing businesses of the past decade. They are composed of three parts: two distinct groups of end-users and a platform. Two-sided platforms face unique challenges such as design, pricing, governance rules etc. The pricing decision specifically has been the subject of rigorous research. As the value that each group derives from using the platform depends on the size of the other side of the market, the platform's pricing strategies of the two groups are closely linked. A platform pricing strategy includes decisions about which side of the platform to charge, how much to charge them and an overall approach to attract and benefit both sides of the platform. Though the study of platform strategies has been quite popular among many economists, they have focused on analyzing the strategies from a static perspective. Because platforms have evolved their pricing strategies over time to be competitive in the market and have faced challenges, the process deserves attention. This thesis therefore analyzes the evolution of pricing strategies of platforms such as eBay (sellers and buyers) and Uber (riders and drivers) and the challenges they overcame to stay ahead in the market. We study that eBay initially used a complex pricing strategy but simplified it to compete in the market with Amazon and other e-commerce firms. Uber, in contrast, began with a simple "taxi-meter" pricing but changed their pricing strategy to account for the multiple variables such as demand, supply, location etc. The study concludes that to stay relevant in the market and to be successful, platforms need to evolve their pricing strategy over time depending on various market conditions. Though there is not one fixed pattern of how platforms evolve their pricing, their strategies consider simplicity, data availability and transparency while making pricing decisions. Future platforms can use these learnings while designing their pricing strategies.
by Banda Shruti.
S.M. in Engineering and Management
Degwekar, Akshay (Akshay Dhananjai). "Structure vs. hardness through the obfuscation lens." Thesis, Massachusetts Institute of Technology, 2016. http://hdl.handle.net/1721.1/105578.
Повний текст джерелаThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 71-[77]).
Cryptography relies on the computational hardness of structured problems. While one-way functions, the most basic cryptographic object, does not seem to require much structure, as we advance up the ranks into public-key cryptography and beyond, we seem to require that certain structured problems are hard. For example, factoring, quadratic residuosity, discrete logarithms, and approximate shortest and closest vectors in lattices all have considerable algebraic structure. This structure, on the one hand, enables useful applications such as public-key and homomorphic encryption, but on the other, also puts their hardness in question. Their structure is exactly what puts them in low complexity classes such as SZK or NP [set-theoretic intersection symbol] coNP, and is in fact the reason behind (sub-exponential or quantum) algorithms for these problems. The question is whether such structure is inherent in different cryptographic primitives, deeming them inherently easier. We study the relationship between two structured complexity classes, statistical zero-knowledge (SZK) and NP [set-theoretic intersection symbol] coNP, and cryptography. To frame the question in a meaningful way, we rely on the language of black-box constructions and separations. Our results are the following: -- Cryptography vs. Structured Hardness: Our two main results show that there are no black-box constructions of hard problems in SZK or NP [set-theoretic intersection symbol] coNP starting from one of a wide variety of cryptographic primitives such as one-way and trapdoor functions, one-way and trapdoor permutations (in the case of SZK), public-key encryption, oblivious transfer, deniable encryption, functional encryption, and even indistinguishability obfuscation; -- Complexity-theoretic Implications: As a corollary of our result, we show a separation between SZK and NP[set-theoretic intersection symbol]coNP and the class PPAD that captures the complexity of computing Nash Equilibria; and -- Positive Results: We construct collision-resistant hashing from a strong form of SZK-hardness and indistinguishability obfuscation. It was previously known that indistinguishability obfuscation by itself does not imply collision-resistant hashing in a black-box way; we show that it does if one adds SZK-hardness as a "catalyst". Our black-box separations are derived using indistinguishability obfuscation as a "gateway", by first showing a (separation) result for indistinguishability obfuscation and then leveraging on the fact that indistinguishability obfuscation can be used to construct the above variety of cryptographic primitives and hard PPAD instances in a black-box manner.
by Akshay Degwekar.
S.M.
Rodriguez, Perdomo Carlos Mario. "Designing interactions for data obfuscation in IoT." Thesis, Malmö högskola, Fakulteten för kultur och samhälle (KS), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-22494.
Повний текст джерелаFerla, Daniele. "ROPfuscator: machine code obfuscation through Return Oriented Programming." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2019. http://amslaurea.unibo.it/17539/.
Повний текст джерелаRahbari, Hanif. "Obfuscation of Transmission Fingerprints for Secure Wireless Communications." Diss., The University of Arizona, 2016. http://hdl.handle.net/10150/612371.
Повний текст джерелаAravalli, SaiKrishna. "Some Novice methods for Software Protection with Obfuscation." ScholarWorks@UNO, 2006. http://scholarworks.uno.edu/td/479.
Повний текст джерелаWang, Yan. "Obfuscation-Resilient Code Detection Analyses for Android Apps." The Ohio State University, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=osu1534337202264542.
Повний текст джерелаGraux, Pierre. "Challenges of native android applications : obfuscation and vulnerabilities." Thesis, Rennes 1, 2020. http://www.theses.fr/2020REN1S047.
Повний текст джерелаAndroid is the most used operating system and thus, ensuring security for its applications is an essential task. Securing an application consists in preventing potential attackers to divert the normal behavior of the targeted application. In particular, the attacker may take advantage of vulnerabilities left by the developer in the code and also tries to steal intellectual property of existing applications. To slow down the work of attackers who try to reverse the logic of a released application, developers are incited to track potential vulnerabilities and to introduce countermeasures in the code. Among the possible countermeasures, the obfuscation of the code is a technique that hides the real intent of the developer by making the code unavailable to an adversary using a reverse engineering tool. With the growing amount of malware and applications carrying sensitive information, obfuscating the code and searching vulnerabilities becomes essential. This thesis presents the impact of native code on both reverse-engineering and vulnerability finding applied to Android applications. First, by listing the possible interferences between assembly and bytecode, we highlight new obfuscation techniques and software vulnerabilities. Then, we propose new analysis techniques combining static and dynamic analysis blocks, such as taint tracking or system monitoring, to observe the code behaviors that have been obfuscated or to reveal new vulnerabilities. These two objectives have led us to develop two new tools. The first one spots a specific vulnerability that comes from inconsistently mixing native and Java data. The second one extracts the object level behavior of an application, regardless of whether this application contains native code, embedded for obfuscation purposes. Finally, we implemented these new methods and conducted experimental evaluations. In particular, we automatically found a vulnerability in the Android SSL library and we analyzed several Android firmware to detect usage of a specific class of obfuscation
Coogan, Kevin Patrick. "Deobfuscation of Packed and Virtualization-Obfuscation Protected Binaries." Diss., The University of Arizona, 2011. http://hdl.handle.net/10150/202716.
Повний текст джерелаDALLA, PREDA Mila. "Code obfuscation and malware detection by abstract interpretation." Doctoral thesis, Università degli Studi di Verona, 2007. http://hdl.handle.net/11562/337972.
Повний текст джерелаAn obfuscating transformation aims at confusing a program in order to make it more difficult to understand while preserving its functionality. Software protection and malware detection are two major applications of code obfuscation. Software developers use code obfuscation in order to defend their programs against attacks to the intellectual property, usually called malicious host attacks. In fact, by making the programs more difficult to understand it is possible to obstruct malicious reverse engineering – a typical attack to the intellectual property of programs. On the other side, malware writers usually obfuscate their malicious code in order to avoid detection. In this setting, the ability of code obfuscation to foil most of the existing detection techniques, such as misuse detection algorithms, relies in their purely syntactic nature that makes malware detection sensitive to slight modifications of programs syntax. In the software protection scenario, researchers try to develop sophisticated obfuscating techniques that are able to resist as many attacks as possible. In the malware detection scenario, on the other hand, it is important to design advanced detection algorithms in order to detect as many variants of obfuscated malware as possible. It is clear how both malicious host and malicious code attacks represent harmful threats to the security of computer networks. In this dissertation, we are interested in both security issues described above. In particular, we describe a formal approach to code obfuscation and malware detection based on program semantics and abstract interpretation. This theoretical framework is useful in contrasting some well known drawbacks of software protection through code obfuscation, as well as for improving existing malware detection schemes. In fact, the lack of rigorous theoretical bases for code obfuscation prevents any possibility to formally study and certify their effectiveness in protecting proprietary programs. Moreover, in order to design malware detection schemes that are resilient to obfuscation we have to focus on program semantics rather than on program syntax. Our formal framework for code obfuscation relies on a semantics-based definition of code obfuscation that characterizes each program transformation T as a potential obfuscation in terms of the most concrete property preserved by T on program semantics. Deobfuscating techniques, and reverse engineering in general, usually begin with some sort of static program analysis, which can be specified as an abstraction of program semantics. In the software protection scenario, this observation naturally leads to model attackers as abstractions of program semantics. In fact, the abstraction modeling the attacker expresses the amount of information, namely the semantic properties, that the attacker is able to observe. It follows that, comparing the degree of abstraction of an attacker A with the one of the most concrete property preserved by an obfuscating transformation T, it is possible to understand whether obfuscation T defeats attack A. Following the same reasoning it is possible to compare the efficiency of different obfuscating transformations, as well as the ability of different attackers in contrasting a given obfuscation. We apply our semantics-based framework to a known control code obfuscation technique that aims at confusing the control flow of the original program by inserting opaque predicates. As argued above, an obfuscating transformation modifies a program while preserving an abstraction of its semantics. This means that different obfuscated versions of the same malware have to share (at least) the malicious intent, namely the maliciousness of their semantics, even if they may express it through different syntactic forms. The basic idea of our formal approach to malware detection is to use program semantics to model both malware and program behaviour, and semantic abstractions to hide the details changed by the obfuscation. Thus, given an obfuscation T, we are interested in defining an abstraction of program semantics that does not distinguish between the semantics of malware M and the semantics of its obfuscated version T(M). In particular, we provide this suitable abstraction for an interesting class of commonly used obfuscating transformations. It is clear that, given a malware detector D, it is always possible to define its semantic counterpart by analyzing how D works on program semantics. At this point, by translating both malware detectors and obfuscating transformations in the semantic world, we are able to certify which obfuscations a detector is able to handle. This means that our semanticsbased framework provides a formal setting where malware detectors designers can prove the efficiency of their algorithms.
Tauman, Kalai Yael. "Attacks on the Fiat-Shamir paradigm and program obfuscation." Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/34026.
Повний текст джерелаThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Includes bibliographical references (p. 115-119).
The goal of cryptography is to construct *secure* and *efficient* protocols for various tasks. Unfortunately, it is often the case that protocols that are provably secure are not efficient enough for practical use. As a result, most protocols used in practice are *heuristics* that lack proofs of security. These heuristics are typically very efficient and are believed to be secure, though no proof of security has been provided. In this thesis we study the security of some of these popular heuristics. In particular, we focus on two types of heuristics: (1) the Fiat-Shamir heuristic for constructing digital signature schemes, and (2) heuristics for obfuscation. We show that, in some sense, both of these types of heuristics are insecure. Thus, this thesis consists of two parts: (1) The insecuirty of the Fiat-Shamir paradigm: The Fiat-Shamir heuristic provides a general method for transforming secure 3-round public-coin identification schemes into digital signature schemes. The idea of the transformation is to replace the random (second-round) message of the verifier in the identification scheme, with the value of some deterministic hash function evaluated on the first-round message (sent by the prover) and on the message to be signed.
(cont.) The Fiat-Shamir methodology for producing digital signature schemes quickly gained popularity both in theory and in practice, as it yields efficient and easy to implement digital signature schemes. The most important question however remained open: are the digital signature schemes produced by the Fiat-Shamir methodology secure? In this thesis, we answer this question negatively. We show that there exist secure 3-round public-coin identification schemes for which the Fiat-Shamir transformation yields *insecure* digital signature schemes for *any* hash function used by the transformation. This is in contrast to the work of Pointcheval and Stern, who proved that the Fiat-Shamir methodology always produces digital signature schemes that are secure against chosen message attacks in the ``Random Oracle Model" -- when the hash function is modeled by a random oracle. (2) The impossibility of obfuscation: The goal of code obfuscation is to make a program completely "unintelligible" while preserving its functionality. Obfuscation has been used for many years in attempts to prevent reverse engineering, e.g ., in copy protection, licensing schemes, and games.
(cont.) As a result, many heuristics for obfuscation have emerged, and the important question that remained is: are these heuristics for obfuscation secure? In this thesis, we show that there are many "natural" classes of functions for which obfuscation is not at all possible. This impossibility result holds in an augmentation of the formal obfuscation model of Barak, et al. (2001) that includes auxiliary input. In both of these parts, among other tools, we make new usage of Barak's technique for taking advantage of non black-box access to a program, this time in the context of digital signature schemes and in the context of obfuscation.
by Yael Tauman Kalai.
Ph.D.
Lu, Weiyun. "Formally Verified Code Obfuscation in the Coq Proof Assistant." Thesis, Université d'Ottawa / University of Ottawa, 2019. http://hdl.handle.net/10393/39994.
Повний текст джерелаParameswaran, Rupa. "A Robust Data Obfuscation Technique for Privacy Preserving Collaborative Filtering." Diss., Georgia Institute of Technology, 2006. http://hdl.handle.net/1853/11459.
Повний текст джерелаDesai, Avinash R. "Anti-Counterfeit and Anti-Tamper Hardware Implementation using Hardware Obfuscation." Thesis, Virginia Tech, 2013. http://hdl.handle.net/10919/23756.
Повний текст джерелаMaster of Science
Makin, Cameron. "Primary User Obfuscation in an Incumbent Informed Spectrum Access System." Thesis, Virginia Tech, 2021. http://hdl.handle.net/10919/104015.
Повний текст джерелаMaster of Science
With a growing demand for spectrum availability, wireless spectrum sharing has become a high-profile solution to spectrum overcrowding. In order to enable spectrum sharing between incumbent/primary (e.g.,federal communications, naval radar, users already grandfathered into the band) and secondary users (e.g., commercial communications companies), incumbents must have spectrum protection and privacy from malicious new entrants. In this Spectrum Access System (SAS) advancement, Primary Users (PUs) are obfuscated with the efforts of the incumbent informed SAS and the cooperation of obedient new entrants. Further, the necessary changes to the SAS to support this privacy scheme are exposed to suggest improvements in PU privacy, Citizens Broadband Radio Service Device (CBSD)-SAS relations, and punishment for unauthorized transmission. Results show the feasibility of PU obfuscation with respect to malicious spectrum sensing users. Simulation results indicate that the obfuscation tactic can deliver location and frequency occupation privacy with 75% and 66% effectiveness respectively in a 100% efficient spectrum utilization oriented obfuscation scheme. A scheme without spectrum utilization constraint shows up to 91% location privacy effectiveness. Experiment trials indicate that the privacy tactic can be implemented on an open-source SAS, however environmental factors may degrade the tactic's performance.
Kandikonda, Balausha Varshini. "A Key Based Obfuscation and Anonymization of Behavior VHDL Models." Scholar Commons, 2018. https://scholarcommons.usf.edu/etd/7686.
Повний текст джерелаRiaud, Stéphanie. "Obfuscation de données pour la protection de programmes contre l'analyse dynamique." Thesis, Rennes 1, 2015. http://www.theses.fr/2015REN1S167.
Повний текст джерелаReverse engineering is a technique that consists in analyzing a product in order to extract a secret. When a computer program is targeted, the reverse engineer may seek to extract an algorithm code or any component of this program. Obfuscation is a protection technique aimed to make it more difficult to reverse engineer. We are interested in the study and development of obfuscation techniques to protect computer programs. We have developed a new technique of code obfuscation, then we have demonstrated its effectiveness, and finally we implemented another protection technique with the aim of enhance the resilience of anti-reverse engineering protection techniques. So we, initially, designed and implemented a new obfuscation technique to protect certain specific elements contained in the programs implemented in C language. By relying on dynamic analysis techniques, we have established the effectiveness of this protection technique. Secondly, we have backed up previously established elements, by demonstrating empirically that this protection can be applied to concrete programs. We demonstrate that this protection can be placed on high-level codes and remain effective on executable files obtained from these codes. We demonstrate that when the process of obfuscation is realized in a scrupulous way, the execution time of programs remains in the same order as that of the protected programs. Thirdly, we work on developing targeted protection mechanisms to counter automatic analysis tools used by reverse engineers. Their aim is to enhance the robustness of the techniques applied to high level by increasing their stealth and providing fake results for the reverse engineers. Our contributions cover various topics related to protection against reverse engineering. We have developed and implemented new code protection techniques. When these protection techniques are apply to high level, we have developed a process to demonstrate that they do not lose efficiency and their cost in terms of execution time remains acceptable. For the lowest level protection techniques that we have developed, we have demonstrated their effectiveness face of dynamic code analysis tools used in reverse engineering
WERKELIN, AHLIN OSKAR. "Implementation and evaluation of some platformindependent obfuscating transformations." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-142376.
Повний текст джерелаVi studerar kodobfuskering, ett verktyg som används för att skydda mjukvara från att bakåtkompileras. När man obfuskerar programkod så komplicerar man exekveringsflödet och gör det på så sätt svårare för angripare eller konkurrenter att tyda den bakomliggande logiken hos programmet. Dagens bästa lösningar för kodobfuskering är beroende av en viss plattform. Vi utvärderar några plattformsoberoende obfuskeringsalgoritmer genom att implementera dem och utvärdera dem med avseende på ett antal definierade mätvärden. Obfuskeringsmetoderna implementeras med hjälp av ett vanligt kompilatorprojekt som baseras på öppen källkod. Vi konstaterar att det är gynnsamt att göra implementationerna på valt sätt. Givet implementationen av några vanliga obfuskeringsmetoder så utvärderar vi dem var för sig, och ensamma visar de sig inte vara så kraftfulla som förväntat. Vi kan dock konstatera att obfuskeringsmetoderna kan bli mycket mer kraftfulla om de appliceras i kombination med varandra.
Kuseler, Torben. "Localisation and obfuscation techniques for enhanced multi-factor authentification in mcommerce applications." Thesis, University of Buckingham, 2012. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.573423.
Повний текст джерелаEdwards, Robert Andrew. "Essays in industrial organisation : price competition, strategic obfuscation, advertising & consumer behaviour." Thesis, University of Liverpool, 2017. http://livrepository.liverpool.ac.uk/3007004/.
Повний текст джерелаZabransky, Douglas Milton. "Incorporating Obfuscation Techniques in Privacy Preserving Database-Driven Dynamic Spectrum Access Systems." Thesis, Virginia Tech, 2018. http://hdl.handle.net/10919/85001.
Повний текст джерелаMaster of Science
Hendrikse, Steven. "The Effect of Code Obfuscation on Authorship Attribution of Binary Computer Files." NSUWorks, 2017. http://nsuworks.nova.edu/gscis_etd/1009.
Повний текст джерелаEyrolles, Ninon. "Obfuscation par expressions mixtes arithmético-booléennes : reconstruction, analyse et outils de simplification." Thesis, Université Paris-Saclay (ComUE), 2017. http://www.theses.fr/2017SACLV031/document.
Повний текст джерелаSoftware obfuscation is a software protection technique thattransforms code in order to make its analysis more difficult. MixedBoolean-Arithmetic (MBA) expressions are presented as a strongobfuscation in the context of data flow obfuscation. As the domainaround MBA obfuscation is quite young, there is little literatureon the conception and analysis of such obfuscated expressions.Therefore many interesting subjects arise during its study, both around theobfuscation and deobfuscation (or simplification) of MBA expressions.During our work, we structured the subject of MBA obfuscation, linkingit to other topics like cryptography or rewriting. We also reconstructedan MBA obfuscation technique from public samples. We studied themeaning of simplifying an obfuscated expression, and definedour own simplicity metrics for MBA expressions. The study of MBAsimplification yielded the implementation of two deobfuscation toolsthat successfully simplified several public examples of obfuscatedexpressions. Finally, we assessed the resilience of the MBAobfuscation with regard to our simplification algorithms (as well asother deobfuscation techniques), concluding that this obfuscationtechnique offers little resilience as it is, and we proposed a few ideasto help improve this type of obfuscation
Kwon, Duke L. "Obfuscation and restoration Paul's use of Isaiah in 1 Corinthians 14:20-25 /." Theological Research Exchange Network (TREN) Access this title online, 2004. http://www.tren.com.
Повний текст джерелаWainwright, Edward. "Transparency and obfuscation : politics and architecture in the work of Foster & Partners." Thesis, Cardiff University, 2010. http://orca.cf.ac.uk/55462/.
Повний текст джерелаMerkl-Davies, Doris. "The obfuscation hypothesis re-examined : analyzing impression management in corporate narrative report documents." Thesis, Bangor University, 2007. https://research.bangor.ac.uk/portal/en/theses/the-obfuscation-hypothesis-reexamined--analyzing-impression-management-in-corporate-narrative-report-documents(3fd58e2c-790a-44b7-80c8-2c4b41ef72c3).html.
Повний текст джерелаКарплюк, Володимир Ігорович, та Volodymyr Karpliuk. "Обфускаційні методи захисту програмного коду в комп’ютерних системах". Master's thesis, Тернопільський національний технічний університет імені Івана Пулюя, 2020. http://elartu.tntu.edu.ua/handle/lib/33269.
Повний текст джерелаObfuscation methods of program code protection in computer systems // Master's qualification work // Karplyuk Volodymyr Ihorovych // Ternopil National Technical University, Department of Computer Systems and Networks, Computer Engineering, SIM-61 Group // Ternopil, 2020 / / P. - 83, fig. - 27, bibliogr. - 32, table. - 1. The master's thesis is devoted to the development of an obfuscator for the JavaScript programming language. A balance was found between the level of obfuscation and the required productivity. The research helped to increase the level of security of information and software products by their own methods of obfuscation. The analysis of ready decisions is carried out. The evaluation of already existing methods and means of obfuscation is carried out in the work, the optimal combinations of confusing transformations are found. The efficiency of using the developed obfuscator is proved. The application of the developed obfuscation technologies will allow to improve such indicators of the developed software as: stability, reliability, safety.
1.Аналіз уже існуючих технологій обфускації програмного коду. 2.Захист на апаратному та програмному рівнях. Оцінка якості обфускації. Дослідження методів обфускації на різних рівнях. 3.Розробка алгоритмів обфускатора. Реалізація власного програмного продукту для обфускації вихідного коду на мові програмування JavaScript.
Badier, Hannah. "Transient obfuscation for HLS security : application to cloud security, birthmarking and hardware Trojan defense." Thesis, Brest, École nationale supérieure de techniques avancées Bretagne, 2021. https://tel.archives-ouvertes.fr/tel-03789700.
Повний текст джерелаThe growing globalization of the semiconductor supply chain, as well as the increasing complexity and diversity of hardware design flows, have lead to a surge in security threats: risks of intellectual property theft and reselling, reverse-engineering and malicious code insertion in the form of hardware Trojans during manufacturing and at design time have been a growing research focus in the past years. However, threats during highlevel synthesis (HLS), where an algorithmic description is transformed into a lower level hardware implementation, have only recently been considered, and few solutions have been given so far. In this thesis, we focus on how to secure designs during behavioral synthesis using either a cloud-based or an internal but untrusted HLS tool. We introduce a novel design time protection method called transient obfuscation, where the high-level source code is obfuscated using key-based techniques, and deobfuscated after HLS at register-transfer level. This two-step method ensures correct design functionality and low design overhead. We propose three ways to integrate transient obfuscation in different security mechanisms. First, we show how it can be used to prevent intellectual property theft and illegal reuse in a cloud-based HLS scenario. Then, we extend this work to watermarking, by exploiting the side-effects of transient obfuscation on HLS tools to identify stolen designs. Finally, we show how this method can also be used against hardware Trojans, both by preventing insertion and by facilitating detection
Lukšas, Darius. "Programinio kodo obfuskacija ir įgyvendinimo metodai." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2006. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2006~D_20060114_012503-75154.
Повний текст джерелаLu, Gen. "Analysis of Evasion Techniques in Web-based Malware." Diss., The University of Arizona, 2013. http://hdl.handle.net/10150/312567.
Повний текст джерелаCakmak, Ozan. "PRIVACY PRESERVATION IN A HYBRID MULTI MESH-LTE AMI NETWORK FOR SMART GRID." OpenSIUC, 2015. https://opensiuc.lib.siu.edu/theses/1720.
Повний текст джерелаBeussink, Andrew. "Preserving Consumer Privacy on IEEE 802.11s-Based Smart Grid AMI Networks." OpenSIUC, 2014. https://opensiuc.lib.siu.edu/theses/1383.
Повний текст джерелаHoward, Adam. "Obfuscation by Design: How Visual ComComplexity and Cognitive Bias Shape Our Understanding of Political Information." Research Showcase @ CMU, 2011. http://repository.cmu.edu/theses/8.
Повний текст джерелаZhuang, Yan [Verfasser], and Felix [Gutachter] Freiling. "Methods for Improving the Quality of Software Obfuscation for Android Applications / Yan Zhuang ; Gutachter: Felix Freiling." Erlangen : Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU), 2017. http://d-nb.info/1140917110/34.
Повний текст джерелаChilowicz, Michel. "Recherche de similarité dans du code source." Phd thesis, Université Paris-Est, 2010. http://tel.archives-ouvertes.fr/tel-00587628.
Повний текст джерелаGodfroy, Hubert. "Réflexion, calculs et logiques." Thesis, Université de Lorraine, 2017. http://www.theses.fr/2017LORR0130/document.
Повний текст джерелаThe goal of my Ph.D. is to finds high level models in which self-modification can be expressed. What is readable and changeable is a data, and a program is executable. We propose an abstract machine where this duality is structurally emphasized. On one hand the program zone beholds registers which can be executed, and on the other hand data zone contains readable and changeable registers. Self-modification is enabled by passing a data register into program zone, or a program register into data zone. In this case, we give an abstraction of executions which only extracts information about self-modifications: execution is cut into paths without self-modification. For the logical part, we tried to find a Curry-Howard correspondence between a language with self-modifications and logical world. For that we built an extension of lambda-calculus with frozen terms, noted , that is, terms which cannot reduce. This terms are considered as data. Other terms are programs. We first prove that this language as expected properties like confluence. On the other hand, we found a type system where a subset of terms of this language can be expressed. Our type system is inspired by Linear Logic, without resources management. We prove that this system has good properties like subject reduction. We finally have extended the system with continuation and double negation. This extension can be expressed in a krivine style, using a machine inspired by krivine machine
Ceder, Felicia, and Olivia Ahlmén. "Årsredovisningen, ett objektivt informationsdokument eller ett marknadsföringsverktyg? : En kvantitativ studie om läsbarheten i svenska börsnoterade företags årsredovisningar." Thesis, Linköpings universitet, Företagsekonomi, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-148893.
Повний текст джерелаIntroduction Nowdays the narrative parts are the majority of the annual report. The narrative parts help the reader to interpret the financial information. Thus, the readability is important for the usefulness of the annual report. Prior research has found that corporations strategically use the language as a tool to hide information and to obfuscate the reader. Purpose The purpose of this study is to explain variation in readability between Swedish listed corporations’ annual reports. Method This quantitative study is based on an eclectical and deductive approach where both theories of readability and accounting theories have formulated the hypotheses. A cross-sectional design has been used and the study's empirical data consist of secondary data, derived from annual reports. Variation in annual reports readability has been analysed by multiple linear regression. Conclusion The result shows that there is a strong positive correlation between profitability and readability, thus less profitable corporations have lower readability in their annual reports. The result also shows that there are weak differences in the annual reports' readability between different industries. Furthermore, the analysis indicates that larger companies write longer texts and thus more difficult.