Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

You searched for id:"handle:2152/69248". One record found.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


University of Texas – Austin

1. -4429-2872. Program obfuscation: new applications and constructions from standard assumptions.

Degree: Computer Sciences, 2018, University of Texas – Austin

Code obfuscation has been one of the main focal points of cryptographic research over the last few years. This proposed thesis studies two different aspects of program obfuscation. In the first part, we examine the power of indistinguishability obfuscation. This notion of indistinguishability obfuscation requires that the obfuscation of two functionally identical programs must be computationally indistinguishable. In this work, we show how obfuscation for circuits can be used to obfuscate Turing machines. Our obfuscation scheme satisfies the succinctness requirement; that is, the obfuscation of a Turing machine M has size polynomial in the machine description |M| and a maximum bound on the input length n. Previous works that addressed this problem required an additional bound on the maximum space used by the Turing machine. Our construction is based on indistinguishability obfuscation for circuits, one way functions and injective pseudo random generators. In the second part of the proposed dissertation, we study constructions of obfuscation for restricted function classes under standard assumptions. We introduce the notion of lockable obfuscation. In a lockable obfuscation scheme there exists an obfuscation algorithm that takes as input a security parameter, a program P, a message m and “lock value” α and outputs an obfuscated program P̃. One can evaluate the obfuscated program P̃ on any input x where the output of evaluation is the message m if P(x) = α and otherwise receives a rejecting symbol. We proceed to provide a construction of lockable obfuscation and prove it secure under the Learning with Errors (LWE) assumption. Previous constructions of obfuscation under standard assumptions worked for much weaker function classes such as point functions and conjunctions. Next, we describe multiple applications of lockable obfuscation. The first application is a generic transformation of any attribute-based encryption (ABE) scheme into one in which the attributes used to encrypt the message are hidden from any user that is not authorized to decrypt the message. Similarly, we show how to upgrade broadcast encryption schemes to have one-sided anonymity. We also show applications of lockable obfuscation to separation and uninstantiability results. Advisors/Committee Members: Waters, Brent R., 1978- (advisor), Sahai, Amit (committee member), Klivans, Adam (committee member), Zuckerman, David (committee member).

Subjects/Keywords: Code obfuscation; Cryptography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

-4429-2872. (2018). Program obfuscation: new applications and constructions from standard assumptions. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/69248

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

-4429-2872. “Program obfuscation: new applications and constructions from standard assumptions.” 2018. Thesis, University of Texas – Austin. Accessed December 15, 2018. http://hdl.handle.net/2152/69248.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

-4429-2872. “Program obfuscation: new applications and constructions from standard assumptions.” 2018. Web. 15 Dec 2018.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

-4429-2872. Program obfuscation: new applications and constructions from standard assumptions. [Internet] [Thesis]. University of Texas – Austin; 2018. [cited 2018 Dec 15]. Available from: http://hdl.handle.net/2152/69248.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

-4429-2872. Program obfuscation: new applications and constructions from standard assumptions. [Thesis]. University of Texas – Austin; 2018. Available from: http://hdl.handle.net/2152/69248

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

.