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 54 for “"non-interactive"”.

  1. Succinct non-Interactive arguments

    Succinct non-interactive arguments (SNARGs), also known as "CS proofs" [Micali, FOCS 1994], enable verifying NP statements with much lower complexity than required for classical NP verification (in fact, with complexity that is independent of the NP language at hand). In particular, SNARGs provide …

    mit Repository record for Succinct non-Interactive arguments (opens in a new tab)

  2. Études in non-interactive zero-knowledge

    N a ZERO-KNOWLEDGE PROOF [GMR85], Prover interactively convinces Verifier that theorem 7r is true in such a way that (a) a corrupt Prover cannot convince Verifier of a false theorem and (b) a corrupt Verifier cannot "learn" anything other than the fact that r is true. In a NON-INTERACTIVE

    mit Repository record for Études in non-interactive zero-knowledge (opens in a new tab)

  3. Toward improved non-interactive proof systems

    The study of non-interactive proof systems, such as Merlin-Arthur proof systems and probabilistically checkable proofs, can yield insights into problems for which we do not yet have efficient algorithms. This work compiles many recent results in improved non-interactive proof systems–primarily …

    mit Repository record for Toward improved non-interactive proof systems (opens in a new tab)

  4. Succinct non-interactive arguments for bounded depth computations

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

    uiuc Repository record for Succinct non-interactive arguments for bounded depth computations (opens in a new tab)

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

    Succinct non-interactive arguments for batch-NP computations, called BARGs (Choudhuri, Jain and Jin, STOC 2021), have emerged as a powerful tool to construct succinct non-interactive arguments (SNARGs) for expressive classes of computations such as all deterministic computations (P), time-space …

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

  6. Efficient Non-Interactive Secure Two-Party Computation for Equality and Comparison

    … two-party computation. In particular, we propose non-interactive constructions for securely computing private equality testing and greater-than testing protocols. Our first construction is a private equality testing (PET) protocol. What distinguishes our construction from the state of the art is …

    calgary Repository record for Efficient Non-Interactive Secure Two-Party Computation for Equality and Comparison (opens in a new tab)

  7. Emotion Regulation and Screen Use among Parents of Toddlers: A Moderating Role of Parental Personality

    … and different types of screen use, including non-interactive and interactive media (Extremera et al., 2019; Rozgonjuk & Elhai, 2021). It has also been suggested that the role of emotion regulations strategies may differ by personality traits (Gross & John, 2003). However, limited research to …

    vt Repository record for Emotion Regulation and Screen Use among Parents of Toddlers: A Moderating Role of Parental Personality (opens in a new tab)

  8. Knowledge synthesis in the biomedical literature: Nordihydroguaiaretic acid and breast cancer.

    … synthesis endeavors bring together two or more non-interactive literatures to create combinatorial research data on a specific topic. In this endeavor the biomedical literature was searched on the anti-neoplastic agent nordihydroguaiaretic acid (NDGA) for its potential role as a functional food …

    unt Repository record for Knowledge synthesis in the biomedical literature: Nordihydroguaiaretic acid and breast cancer. (opens in a new tab)

  9. Differentially private data publishing for data analysis

    … the empirical error behaviors of the existing interactive and non-interactive approaches. Based on the analysis, we propose an improvement of the DPLloyd algorithm which is a differentially private version of the Lloyd algorithm and propose a non-interactive approach EUGkM which publishes a …

    purdue-thes Repository record for Differentially private data publishing for data analysis (opens in a new tab)

  10. A global study of tropospheric methane chemistry and emissions

    … self-feedback. This complements the existing, interactive chemistry scheme. Interactive methane concentrations and its atmospheric lifetime were found to be slightly low biased relative to observations with a source strength of 548 Tg(CH4) yr-1, in line with recent estimates. This low bias may …

    cambridge Repository record for A global study of tropospheric methane chemistry and emissions (opens in a new tab)

  11. Data preparation and visualization for the SWAN refraction model

    … development project seeks to provide a usable interactive graphical interface to an environment that otherwise involves primarily numerical data in a static, non-interactive format. Tools will be developed that enable users to prepare numerical data required for the SWAN refraction model and to …

    cape-town Repository record for Data preparation and visualization for the SWAN refraction model (opens in a new tab)

  12. SNARKs for C : verifying program executions succinctly and in zero knowledge

    … key, anyone can use the proving key to generate non-interactive proofs for adaptively-chosen NP statements, and the proofs can be verified by anyone using the verification key. Moreover, our system is statistically zero-knowledge and the generated public parameters are reusable. The NP-complete …

    mit Repository record for SNARKs for C : verifying program executions succinctly and in zero knowledge (opens in a new tab)

  13. Incrementally verifiable computation or knowledge implies time/space efficiency

    … In this thesis we explore the ultimate limits of non-interactive proof systems with respect to time/space efficiency and the new criterion of composability. We deduce the existence of our proposed proof system by way of a natural new assumption about proofs of knowledge. In fact, a main …

    mit Repository record for Incrementally verifiable computation or knowledge implies time/space efficiency (opens in a new tab)

  14. Functional signatures

    … of functional signature in constructing succinct non-interactive arguments and delegation schemes. We give several constructions for this primitive, and describe the trade-offs between them in terms of the assumptions they require and the size of the signatures.

    mit Repository record for Functional signatures (opens in a new tab)

  15. On deploying succinct zero-knowledge proofs

    … practical scenarios it is crucial that proofs be non-interactive and succinct. In the standard model, non-interactive zero-knowledge (NIZK) proofs do not exist for languages outside BPP (even with just computational soundness). However, if the security model includes a trusted party, available for …

    mit Repository record for On deploying succinct zero-knowledge proofs (opens in a new tab)

  16. Collaborative scientific publishing : a new research ecosystem

    … process from one of static critique to one of interactive collaboration we can increase the error-detection rate of scientific review. We present an experiment to test this hypothesis by measuring error detection rates across several interactive and non-interactive documents. This work is …

    mit Repository record for Collaborative scientific publishing : a new research ecosystem (opens in a new tab)

  17. Design of interactive maps for ocean dynamics data

    … and assimilation. The group has primarily used non-interactive ocean plots to visualize its simulated and measured data. Although these maps and sections allow for analysis of ocean physics and the underlying numerical schemes, more interactive maps provide more user control over depicted data, …

    mit Repository record for Design of interactive maps for ocean dynamics data (opens in a new tab)

  18. Delegation with Updatable Unambiguous Proofs and PPAD-Hardness

    … computations and is publicly verifiable and non-interactive in the common reference string (CRS) model. It is updatable meaning that given a proof for the statement that a Turing machine reaches some configuration C in T steps, it is efficient to update it into a proof for the statement that …

    mit Repository record for Delegation with Updatable Unambiguous Proofs and PPAD-Hardness (opens in a new tab)

  19. Cryptographic key distribution in wireless sensor networks: a hardware perspective

    … for key distribution using identity based Non-Interactive Key Distribution Scheme (NIKDS) and Identity-Based Signature (IBS) scheme is presented. The protocol is analysed on the ARM920T processor and measurements were taken for the run time and energy of its components parts. It was found …

    dcu Repository record for Cryptographic key distribution in wireless sensor networks: a hardware perspective (opens in a new tab)

  20. A longitudinal study on the effectiveness of preschool special education

    … future learning. Data was obtained through non-interactive evaluation of existing class lists, student records, and Application for State School Aide (ASSA) reports of 342 disabled or developmentally delayed children between 3 and 5 years of age who participated in Evesham Township's …

    rowan Repository record for A longitudinal study on the effectiveness of preschool special education (opens in a new tab)

Page 1 of 3