Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 42 for “"Indistinguishability"”.

  1. Localization of robot and landmark with indistinguishability

    … robots and landmarks related to the aspect of indistinguishability in multi-dimensional spaces. With the initial position ranges for the robot and landmarks using specific measurement models, we develop a general algorithm for minimizing the position ranges under various conditions, which are …

    uiuc Repository record for Localization of robot and landmark with indistinguishability (opens in a new tab)

  2. Attacking schedule indistinguishability in real-time systems

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2022-11-11 without embargo terms

    uiuc Repository record for Attacking schedule indistinguishability in real-time systems (opens in a new tab)

  3. Low complexity pseudorandom generators and indistinguishability obfuscation

    … 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 …

    mit Repository record for Low complexity pseudorandom generators and indistinguishability obfuscation (opens in a new tab)

  4. The indistinguishability between God and man in the thoughts of Meister Eckhart.

    … a particular focus on how Eckhart presents the indistinguishability between God and man. I have chosen to use the term indistinguishability because, although union with God involves identity and indistinction, the idea of indistinguishability provides a unique and clearer insight to the thoughts …

    uwtsd Repository record for The indistinguishability between God and man in the thoughts of Meister Eckhart. (opens in a new tab)

  5. The Indistinguishability Between the Arbitrary and Non-Arbitrary Nature of Things in Hegel’s Phenomenology of Spirit

    … we have argued for the thesis that there is an indistinguishability between the arbitrary and the non-arbitrary nature of things. We argued that this position has its origins in Hegel’s Phenomenology once the three skeptical discoveries are realized. These skeptical discoveries are 1) That what …

    claremont Repository record for The Indistinguishability Between the Arbitrary and Non-Arbitrary Nature of Things in Hegel’s Phenomenology of Spirit (opens in a new tab)

  6. Structure vs. hardness through the obfuscation lens

    … 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 …

    mit Repository record for Structure vs. hardness through the obfuscation lens (opens in a new tab)

  7. Secure channel free public key encryption with multiple keywords search

    … and also has the characters of Ciphertext Indistinguishability and Trapdoor Indistinguishability so that it proves to be semantic secure under Random Oracle Models by Bilinear Diffie-Hellman (BDH) and 1-Bilinear Diffie-Hellman Inversion(1-BDHI) assumptions for preventing OKGA. Besides, the …

    london-metro Repository record for Secure channel free public key encryption with multiple keywords search (opens in a new tab)

  8. Attacks on multilinear maps

    … vulnerabilities while other applications like indistinguishability obfuscation. I analyze the attacks against these maps and show why they are not able to break the program obfuscation application of multilinear maps.

    mit Repository record for Attacks on multilinear maps (opens in a new tab)

  9. Deterministic Circuit Range Avoidance is (Likely) Intractable

    … that NP ≠ coNP and that subexponentially-secure indistinguishability obfuscation exists.

    mit Repository record for Deterministic Circuit Range Avoidance is (Likely) Intractable (opens in a new tab)

  10. Cryptographic agents

    … in an ideal world. Our new security definition, indistinguishability preservation, is parametrized by a family of 'test' functions. We say that a scheme securely implements a schema against a test family in the real world if for every test in the family, if test is able to hide some bit of …

    uiuc Repository record for Cryptographic agents (opens in a new tab)

  11. Improving the adaptability of differential privacy

    … privacy guarantees by ensuring statistical indistinguishability of individuals in a dataset. It has become the de facto framework for providing privacy-preserving data analysis over statistical datasets. Differential privacy has garnered significant attention from researchers and privacy …

    mit Repository record for Improving the adaptability of differential privacy (opens in a new tab)

  12. Raising the bar for password crackers: improving the quality of honeywords with deep neural networks

    … text similarity-based metrics to evaluate the indistinguishability of honeywords. We analyze our HGTs compared with the other two state-of-the-art HGTs quantitatively and qualitatively and demonstrate that our HGTs can produce honeywords that are substantially more difficult for attackers to …

    uoit Repository record for Raising the bar for password crackers: improving the quality of honeywords with deep neural networks (opens in a new tab)

  13. Distributed correlation generators

    … primitives. Secondly, assuming the existence of indistinguishability obfuscators, we show a construction of distributed correlation generators for a large and natural class of joint distributions that we call conditionally sampleable distributions. Finally, we show a construction for the subclass …

    mit Repository record for Distributed correlation generators (opens in a new tab)

  14. A framework for specifying and formally verifying application security policies

    … specified security policies, using proofs of indistinguishability of labeled transition systems. The primary goal of our framework is to be applicable to a wide variety of applications and policies, moreso than existing analysis tools. In addition to a formalization of applications and …

    mit Repository record for A framework for specifying and formally verifying application security policies (opens in a new tab)

  15. Succinct garbled RAM from indistinguishablity obfuscation

    … 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 …

    mit Repository record for Succinct garbled RAM from indistinguishablity obfuscation (opens in a new tab)

  16. The Stoic cognitive impression and the Academic Aparallaxia Argument: a study of an epistemological debate.

    … could be an indistinguishable false impression (Indistinguishability Thesis). The thesis is structured in six chapters. The opening chapter introduces the Stoic theory of perception and the role that rational sense-impressions play in their theory of knowledge, whilst examining how the Stoics …

    cambridge Repository record for The Stoic cognitive impression and the Academic Aparallaxia Argument: a study of an epistemological debate. (opens in a new tab)

  17. Quantum dot-based Entangled-Light Emitting Diodes (E-LED) for quantum relays

    … small multi-photon probability, and quantum indistinguishability. In this work, a simple quantum dot-based LED (E-LED) was used as a quantum light source for on-demand emission, indicating the potential for use as quantum information devices. Limitations of the device include the …

    cambridge Repository record for Quantum dot-based Entangled-Light Emitting Diodes (E-LED) for quantum relays (opens in a new tab)

  18. Expressivity and Structure in Networks: Ising Models, Random Graphs, and Neural Networks.

    … develop convergence results to show statistical indistinguishability. We then explore the problem of neural network representation to characterize the kind of functions which can be represented by neural networks of a given depth. In doing so, we establish that even shallow networks can express …

    mit Repository record for Expressivity and Structure in Networks: Ising Models, Random Graphs, and Neural Networks. (opens in a new tab)

Page 1 of 3