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 11 of 11 for “"Random Oracle"”.

  1. Relative to a random oracle, co-NP [not equal to or included in] IP/poly

    … given polynomial-length advice along with the random oracle R, it still does not include all of co-NPᴿ. In this case, intuition says that since co-NP is uniform, adding nonuniformity to IPᴿ won't be of any help. On the other hand, IP accomplishes surprising things with few resources, and advice …

    iastate Repository record for Relative to a random oracle, co-NP [not equal to or included in] IP/poly (opens in a new tab)

  2. Rate-1 non-interactive arguments for batch-NP

    … non-standard knowledge assumptions or in the random oracle model; multi-hop BARGs were only known under non-standard knowledge assumptions or in the random oracle model; and aggregate signatures were only known under indistinguishability obfuscation (and RSA) or in the random oracle model.

    mit Repository record for Rate-1 non-interactive arguments for batch-NP (opens in a new tab)

  3. Quantum query complexity revisited

    … and relate it to the BQPA = PA question for a random oracle A. We will also look at some open problems and improve some bounds relating classical and quantum complexity.

    mit Repository record for Quantum query complexity revisited (opens in a new tab)

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

    … 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 efficiency and performance of tSCF-MPEKS is presented from both the theoretical analysis and the …

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

  5. Post-Quantum Verifiable Oblivious Pseudorandom Functions

    … of a post-quantum verifiable oblivious pseudorandom function (VOPRF) with a focus on efficiency and practicality. Leveraging lattice-based cryptographic primitives, particularly the Learning With Errors (LWE) problem, our VOPRF construction aims to address the limitations of existing …

    mit Repository record for Post-Quantum Verifiable Oblivious Pseudorandom Functions (opens in a new tab)

  6. Security and Privacy Schemes for Demand Response in Smart Grids

    … anonymous authentication scheme is secure in a random oracle model. In the voluntary incentivebased demand-response program, consumers are categorized as either obedient or disobedient consumers according to their consumption curtailment. Consumers utilize a homomorphic encryption algorithm to …

    passau-thes Repository record for Security and Privacy Schemes for Demand Response in Smart Grids (opens in a new tab)

  7. A fair payment system with online anonymous transfer

    … the Decisional Diffie-Hellman assumption in the random oracle model. Furthermore, we provide extensions for our system that could allow it to deal with offline payments and micropayments. Our system has been implemented in java. Tests have shown that it performs and scales well, as expected.

    mit Repository record for A fair payment system with online anonymous transfer (opens in a new tab)

  8. Entropy Estimation for Arbiter PUF and Applications to Authenticated Key Exchange

    … and estimating the entropy of PUF responses to random challenges is the first step in formalizing the security of PUF-based cryptographic protocols. In this thesis, we consider the Arbiter PUF (APUF), a widely used and studied PUF construction. We propose a novel approach to modeling and …

    calgary Repository record for Entropy Estimation for Arbiter PUF and Applications to Authenticated Key Exchange (opens in a new tab)

  9. Unclonable Secret Keys

    … propose a construction relative to a classical oracle and prove its unconditional security. Moreover, we provide numerous applications including a signature scheme where an adversary can sign as many messages as it wants and yet it cannot generate two signing keys for the same public key. We …

    cuny-grad Repository record for Unclonable Secret Keys (opens in a new tab)

  10. A Machine Learning Classification Framework for Early Prediction of Alzheimer’s Disease

    … we used five different Machine Learning models; Random Forest (RF), Random Oracle Model (ROM), a hybrid model combined of Levenberg-Marquardt neural network and Random Forest, combined using Fischer discriminate analysis (H2), Linear Neural Networks (LNN), and Multi-layer Perceptron Model (MLP). …

    liverpool-jm Repository record for A Machine Learning Classification Framework for Early Prediction of Alzheimer’s Disease (opens in a new tab)

  11. Minería de Datos y combinación de regresores

    La Inteligencia Artificial es el área de conocimiento que se dedica a la investigación en la mejora de algoritmos para añadir comportamiento más parecido al humano en los sistemas informáticos. La Minería de Datos es una de sus ramas, que está especializada en buscar y extraer información …

    burgos Repository record for Minería de Datos y combinación de regresores (opens in a new tab)